%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : SET907+1 : TPTP v9.3.1. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n018.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Thu Sep 24 02:18:52 PM UTC 2026
% Result : Theorem 0.26s 0.53s
% Output : CNFRefutation 0.26s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 4
% Syntax : Number of formulae : 19 ( 8 unt; 0 def)
% Number of atoms : 42 ( 13 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 39 ( 16 ~; 12 |; 7 &)
% ( 1 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 33 ( 0 sgn 20 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t48_zfmisc_1,conjecture,
! [X1,X2,X3] :
( ( in(X3,X2)
& in(X1,X2) )
=> set_union2(unordered_pair(X1,X3),X2) = X2 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t48_zfmisc_1) ).
fof(t12_xboole_1,axiom,
! [X1,X2] :
( subset(X1,X2)
=> set_union2(X1,X2) = X2 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t12_xboole_1) ).
fof(t38_zfmisc_1,axiom,
! [X1,X2,X3] :
( subset(unordered_pair(X1,X2),X3)
<=> ( in(X2,X3)
& in(X1,X3) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t38_zfmisc_1) ).
fof(commutativity_k2_xboole_0,axiom,
! [X1,X2] : set_union2(X1,X2) = set_union2(X2,X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',commutativity_k2_xboole_0) ).
fof(c_0_4,negated_conjecture,
~ ! [X1,X2,X3] :
( ( in(X3,X2)
& in(X1,X2) )
=> set_union2(unordered_pair(X1,X3),X2) = X2 ),
inference(assume_negation,[status(cth)],[t48_zfmisc_1]) ).
fof(c_0_5,plain,
! [X24,X25] :
( set_union2(X24,X25) = X25
| ~ subset(X24,X25) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t12_xboole_1])])]) ).
fof(c_0_6,plain,
! [X16,X17,X18] :
( ( subset(unordered_pair(X16,X17),X18)
| ~ in(X17,X18)
| ~ in(X16,X18) )
& ( ~ subset(unordered_pair(X16,X17),X18)
| in(X17,X18) )
& ( ~ subset(unordered_pair(X16,X17),X18)
| in(X16,X18) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t38_zfmisc_1])])])]) ).
fof(c_0_7,negated_conjecture,
( set_union2(unordered_pair(esk1_0,esk3_0),esk2_0) != esk2_0
& in(esk3_0,esk2_0)
& in(esk1_0,esk2_0) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])])]) ).
fof(c_0_8,plain,
! [X7,X8] : set_union2(X7,X8) = set_union2(X8,X7),
inference(variable_rename,[status(thm)],[commutativity_k2_xboole_0]) ).
cnf(c_0_9,plain,
( ~ subset(X1,X2)
| set_union2(X1,X2) = X2 ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_10,plain,
( ~ in(X3,X2)
| ~ in(X1,X2)
| subset(unordered_pair(X1,X3),X2) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_11,negated_conjecture,
set_union2(unordered_pair(esk1_0,esk3_0),esk2_0) != esk2_0,
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_12,plain,
set_union2(X1,X2) = set_union2(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,plain,
( ~ in(X1,X3)
| ~ in(X2,X3)
| set_union2(unordered_pair(X1,X2),X3) = X3 ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_14,negated_conjecture,
set_union2(esk2_0,unordered_pair(esk1_0,esk3_0)) != esk2_0,
inference(rw,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_15,plain,
( ~ in(X2,X1)
| ~ in(X3,X1)
| set_union2(X1,unordered_pair(X2,X3)) = X1 ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_16,negated_conjecture,
in(esk3_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_17,negated_conjecture,
in(esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_18,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16]),c_0_17])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : SET907+1 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.07 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.17/0.43 % Computer : n018.cluster.edu
% 0.17/0.43 % Model : x86_64 x86_64
% 0.17/0.43 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.43 % Memory : 8046.5625MB
% 0.17/0.43 % OS : Linux 6.8.0-71-generic
% 0.17/0.43 % CPULimit : 300
% 0.17/0.43 % WCLimit : 300
% 0.17/0.43 % DateTime : Mon Sep 21 05:45:29 UTC 2026
% 0.17/0.44 % CPUTime :
% 0.17/0.44 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.26/0.50 Running first-order theorem proving
% 0.26/0.50 Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.26/0.53 % Version: 3.5.1
% 0.26/0.53 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.26/0.53 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.26/0.53 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.26/0.53 % Starting new_bool_3 with 300s (1) cores
% 0.26/0.53 % Starting new_bool_1 with 300s (1) cores
% 0.26/0.53 % Starting sh5l with 300s (1) cores
% 0.26/0.53 % new_bool_3 with pid 1093224 completed with status 0
% 0.26/0.53 % Result found by new_bool_3
% 0.26/0.53 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.26/0.53 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.26/0.53 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.26/0.53 % Starting new_bool_3 with 300s (1) cores
% 0.26/0.53 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.26/0.53 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.26/0.53 % Search class: FHHSM-FFSS22-SFFFFFNN
% 0.26/0.53 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.26/0.53 % Starting SubtermCWHack with 31s (1) cores
% 0.26/0.53 % SubtermCWHack with pid 1093227 completed with status 0
% 0.26/0.53 % Result found by SubtermCWHack
% 0.26/0.53 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.26/0.53 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.26/0.53 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.26/0.53 % Starting new_bool_3 with 300s (1) cores
% 0.26/0.53 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.26/0.53 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.26/0.53 % Search class: FHHSM-FFSS22-SFFFFFNN
% 0.26/0.53 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.26/0.53 % Starting SubtermCWHack with 31s (1) cores
% 0.26/0.53 % Preprocessing time : 0.002 s
% 0.26/0.53
% 0.26/0.53 % Proof found!
% 0.26/0.53 % SZS status Theorem
% 0.26/0.53 % SZS output start CNFRefutation
% See solution above
% 0.26/0.53 % Parsed axioms : 12
% 0.26/0.53 % Removed by relevancy pruning/SinE : 0
% 0.26/0.53 % Initial clauses : 16
% 0.26/0.53 % Removed in clause preprocessing : 0
% 0.26/0.53 % Initial clauses in saturation : 16
% 0.26/0.53 % Processed clauses : 44
% 0.26/0.53 % ...of these trivial : 2
% 0.26/0.53 % ...subsumed : 14
% 0.26/0.53 % ...remaining for further processing : 28
% 0.26/0.53 % Other redundant clauses eliminated : 0
% 0.26/0.53 % Clauses deleted for lack of memory : 0
% 0.26/0.53 % Backward-subsumed : 0
% 0.26/0.53 % Backward-rewritten : 0
% 0.26/0.53 % Generated clauses : 56
% 0.26/0.53 % ...of the previous two non-redundant : 38
% 0.26/0.53 % ...aggressively subsumed : 0
% 0.26/0.53 % Contextual simplify-reflections : 0
% 0.26/0.53 % Paramodulations : 56
% 0.26/0.53 % Factorizations : 0
% 0.26/0.53 % NegExts : 0
% 0.26/0.53 % Equation resolutions : 0
% 0.26/0.53 % Disequality decompositions : 0
% 0.26/0.53 % Total rewrite steps : 10
% 0.26/0.53 % ...of those cached : 4
% 0.26/0.53 % Propositional unsat checks : 0
% 0.26/0.53 % Propositional check models : 0
% 0.26/0.53 % Propositional check unsatisfiable : 0
% 0.26/0.53 % Propositional clauses : 0
% 0.26/0.53 % Propositional clauses after purity: 0
% 0.26/0.53 % Propositional unsat core size : 0
% 0.26/0.53 % Propositional preprocessing time : 0.000
% 0.26/0.53 % Propositional encoding time : 0.000
% 0.26/0.53 % Propositional solver time : 0.000
% 0.26/0.53 % Success case prop preproc time : 0.000
% 0.26/0.53 % Success case prop encoding time : 0.000
% 0.26/0.53 % Success case prop solver time : 0.000
% 0.26/0.53 % Current number of processed clauses : 28
% 0.26/0.53 % Positive orientable unit clauses : 7
% 0.26/0.53 % Positive unorientable unit clauses: 2
% 0.26/0.53 % Negative unit clauses : 6
% 0.26/0.53 % Non-unit-clauses : 13
% 0.26/0.53 % Current number of unprocessed clauses: 10
% 0.26/0.53 % ...number of literals in the above : 30
% 0.26/0.53 % Current number of archived formulas : 0
% 0.26/0.53 % Current number of archived clauses : 0
% 0.26/0.53 % Clause-clause subsumption calls (NU) : 35
% 0.26/0.53 % Rec. Clause-clause subsumption calls : 35
% 0.26/0.53 % Non-unit clause-clause subsumptions : 10
% 0.26/0.53 % Unit Clause-clause subsumption calls : 2
% 0.26/0.53 % Rewrite failures with RHS unbound : 0
% 0.26/0.53 % BW rewrite match attempts : 7
% 0.26/0.53 % BW rewrite match successes : 6
% 0.26/0.53 % Condensation attempts : 0
% 0.26/0.53 % Condensation successes : 0
% 0.26/0.53 % Termbank termtop insertions : 1214
% 0.26/0.53 % Search garbage collected termcells : 131
% 0.26/0.53
% 0.26/0.53 % -------------------------------------------------
% 0.26/0.53 % User time : 0.006 s
% 0.26/0.53 % System time : 0.003 s
% 0.26/0.53 % Total time : 0.009 s
% 0.26/0.53 % Maximum resident set size: 3636 pages
% 0.26/0.53
% 0.26/0.53 % -------------------------------------------------
% 0.26/0.53 % User time : 0.007 s
% 0.26/0.53 % System time : 0.010 s
% 0.26/0.53 % Total time : 0.017 s
% 0.26/0.53 % Maximum resident set size: 4608 pages
% 0.26/0.53 % E exiting
%------------------------------------------------------------------------------