%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SEU138+1 : TPTP v9.3.1. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n002.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:23:56 PM UTC 2026
% Result : Theorem 50.69s 7.96s
% Output : CNFRefutation 50.69s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 3
% Syntax : Number of formulae : 28 ( 8 unt; 0 def)
% Number of atoms : 106 ( 28 equ)
% Maximal formula atoms : 20 ( 3 avg)
% Number of connectives : 128 ( 50 ~; 59 |; 13 &)
% ( 6 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 2 con; 0-3 aty)
% Number of variables : 81 ( 6 sgn 32 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(d4_xboole_0,axiom,
! [X1,X2,X3] :
( X3 = set_difference(X1,X2)
<=> ! [X4] :
( in(X4,X3)
<=> ( ~ in(X4,X2)
& in(X4,X1) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d4_xboole_0) ).
fof(t48_xboole_1,conjecture,
! [X1,X2] : set_difference(X1,set_difference(X1,X2)) = set_intersection2(X1,X2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t48_xboole_1) ).
fof(d3_xboole_0,axiom,
! [X1,X2,X3] :
( X3 = set_intersection2(X1,X2)
<=> ! [X4] :
( in(X4,X3)
<=> ( in(X4,X2)
& in(X4,X1) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d3_xboole_0) ).
fof(c_0_3,plain,
! [X1,X2,X3] :
( X3 = set_difference(X1,X2)
<=> ! [X4] :
( in(X4,X3)
<=> ( ~ in(X4,X2)
& in(X4,X1) ) ) ),
inference(fof_simplification,[status(thm)],[d4_xboole_0]) ).
fof(c_0_4,negated_conjecture,
~ ! [X1,X2] : set_difference(X1,set_difference(X1,X2)) = set_intersection2(X1,X2),
inference(assume_negation,[status(cth)],[t48_xboole_1]) ).
fof(c_0_5,plain,
! [X17,X18,X19,X20,X21,X22,X23,X24] :
( ( X24 = set_intersection2(X22,X23)
| in(esk2_3(X22,X23,X24),X24)
| in(esk2_3(X22,X23,X24),X23) )
& ( X24 = set_intersection2(X22,X23)
| in(esk2_3(X22,X23,X24),X24)
| in(esk2_3(X22,X23,X24),X22) )
& ( X24 = set_intersection2(X22,X23)
| ~ in(esk2_3(X22,X23,X24),X23)
| ~ in(esk2_3(X22,X23,X24),X22)
| ~ in(esk2_3(X22,X23,X24),X24) )
& ( X19 != set_intersection2(X17,X18)
| in(X21,X19)
| ~ in(X21,X18)
| ~ in(X21,X17) )
& ( X19 != set_intersection2(X17,X18)
| ~ in(X20,X19)
| in(X20,X18) )
& ( X19 != set_intersection2(X17,X18)
| ~ in(X20,X19)
| in(X20,X17) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[d3_xboole_0])])])])])])]) ).
fof(c_0_6,plain,
! [X26,X27,X28,X29,X30,X31,X32,X33] :
( ( X33 = set_difference(X31,X32)
| in(esk3_3(X31,X32,X33),X33)
| ~ in(esk3_3(X31,X32,X33),X32) )
& ( X33 = set_difference(X31,X32)
| in(esk3_3(X31,X32,X33),X33)
| in(esk3_3(X31,X32,X33),X31) )
& ( X33 = set_difference(X31,X32)
| in(esk3_3(X31,X32,X33),X32)
| ~ in(esk3_3(X31,X32,X33),X31)
| ~ in(esk3_3(X31,X32,X33),X33) )
& ( X28 != set_difference(X26,X27)
| in(X30,X28)
| in(X30,X27)
| ~ in(X30,X26) )
& ( X28 != set_difference(X26,X27)
| ~ in(X29,X28)
| ~ in(X29,X27) )
& ( X28 != set_difference(X26,X27)
| ~ in(X29,X28)
| in(X29,X26) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])])])])])]) ).
fof(c_0_7,negated_conjecture,
set_difference(esk6_0,set_difference(esk6_0,esk7_0)) != set_intersection2(esk6_0,esk7_0),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])])]) ).
cnf(c_0_8,plain,
( X3 != set_intersection2(X2,X4)
| ~ in(X1,X3)
| in(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,plain,
( X4 != set_difference(X2,X3)
| ~ in(X1,X2)
| in(X1,X4)
| in(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,negated_conjecture,
set_difference(esk6_0,set_difference(esk6_0,esk7_0)) != set_intersection2(esk6_0,esk7_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_11,plain,
( X3 = set_difference(X1,X2)
| in(esk3_3(X1,X2,X3),X3)
| in(esk3_3(X1,X2,X3),X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_12,plain,
( ~ in(X1,set_intersection2(X2,X3))
| in(X1,X2) ),
inference(er,[status(thm)],[c_0_8]) ).
cnf(c_0_13,plain,
( X4 != set_intersection2(X2,X3)
| ~ in(X1,X3)
| ~ in(X1,X2)
| in(X1,X4) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_14,plain,
( ~ in(X1,X2)
| in(X1,X3)
| in(X1,set_difference(X2,X3)) ),
inference(er,[status(thm)],[c_0_9]) ).
cnf(c_0_15,negated_conjecture,
in(esk3_3(esk6_0,set_difference(esk6_0,esk7_0),set_intersection2(esk6_0,esk7_0)),esk6_0),
inference(csr,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11])]),c_0_12]) ).
cnf(c_0_16,plain,
( X3 != set_intersection2(X4,X2)
| ~ in(X1,X3)
| in(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_17,plain,
( ~ in(esk3_3(X1,X2,X3),X1)
| ~ in(esk3_3(X1,X2,X3),X3)
| X3 = set_difference(X1,X2)
| in(esk3_3(X1,X2,X3),X2) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_18,plain,
( ~ in(X1,X2)
| ~ in(X1,X3)
| in(X1,set_intersection2(X2,X3)) ),
inference(er,[status(thm)],[c_0_13]) ).
cnf(c_0_19,plain,
( ~ in(esk3_3(X1,X2,X3),X2)
| X3 = set_difference(X1,X2)
| in(esk3_3(X1,X2,X3),X3) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_20,negated_conjecture,
( in(esk3_3(esk6_0,set_difference(esk6_0,esk7_0),set_intersection2(esk6_0,esk7_0)),X1)
| in(esk3_3(esk6_0,set_difference(esk6_0,esk7_0),set_intersection2(esk6_0,esk7_0)),set_difference(esk6_0,X1)) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_21,plain,
( ~ in(X1,set_intersection2(X3,X2))
| in(X1,X2) ),
inference(er,[status(thm)],[c_0_16]) ).
cnf(c_0_22,plain,
( X3 != set_difference(X4,X2)
| ~ in(X1,X3)
| ~ in(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_23,plain,
( ~ in(esk3_3(X3,X4,set_intersection2(X1,X2)),X1)
| ~ in(esk3_3(X3,X4,set_intersection2(X1,X2)),X2)
| ~ in(esk3_3(X3,X4,set_intersection2(X1,X2)),X3)
| in(esk3_3(X3,X4,set_intersection2(X1,X2)),X4)
| set_intersection2(X1,X2) = set_difference(X3,X4) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_24,negated_conjecture,
in(esk3_3(esk6_0,set_difference(esk6_0,esk7_0),set_intersection2(esk6_0,esk7_0)),esk7_0),
inference(csr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_10]),c_0_21]) ).
cnf(c_0_25,plain,
( ~ in(X1,X3)
| ~ in(X1,set_difference(X2,X3)) ),
inference(er,[status(thm)],[c_0_22]) ).
cnf(c_0_26,negated_conjecture,
in(esk3_3(esk6_0,set_difference(esk6_0,esk7_0),set_intersection2(esk6_0,esk7_0)),set_difference(esk6_0,esk7_0)),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_15]),c_0_24]),c_0_15])]),c_0_10]) ).
cnf(c_0_27,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_24])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : SEU138+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.08 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.20/0.45 % Computer : n002.cluster.edu
% 0.20/0.45 % Model : x86_64 x86_64
% 0.20/0.45 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.20/0.45 % Memory : 8046.5625MB
% 0.20/0.45 % OS : Linux 6.8.0-71-generic
% 0.20/0.45 % CPULimit : 300
% 0.20/0.45 % WCLimit : 300
% 0.20/0.45 % DateTime : Mon Sep 21 05:55:01 UTC 2026
% 0.20/0.46 % CPUTime :
% 0.20/0.46 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.24/0.51 Running first-order theorem proving
% 0.24/0.51 Running: /export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p
% 50.69/7.96 % Version: 3.5.1
% 50.69/7.96 % Preprocessing class: FSMSSMSSSSSNFFN.
% 50.69/7.96 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 50.69/7.96 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 50.69/7.96 % Starting new_bool_3 with 300s (1) cores
% 50.69/7.96 % Starting new_bool_1 with 300s (1) cores
% 50.69/7.96 % Starting sh5l with 300s (1) cores
% 50.69/7.96 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 2572040 completed with status 0
% 50.69/7.96 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 50.69/7.96 % Preprocessing class: FSMSSMSSSSSNFFN.
% 50.69/7.96 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 50.69/7.96 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 50.69/7.96 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 50.69/7.96 % No SInE strategy applied
% 50.69/7.96 % Search class: FGHSM-FFMF32-SFFFFFNN
% 50.69/7.96 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 50.69/7.96 % Starting SubtermCWHack with 136s (1) cores
% 50.69/7.96 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 50.69/7.96 % Starting U----_116XG_C05_02_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 164s (1) cores
% 50.69/7.96 % Starting G-E--_208_B07CMA_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 50.69/7.96 % Starting G-E--_208_C12_02_nc_F1_SE_CS_SP_PS_S022A with 136s (1) cores
% 50.69/7.96 % G-E--_208_B07CMA_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 2572050 completed with status 0
% 50.69/7.96 % Result found by G-E--_208_B07CMA_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 50.69/7.96 % Preprocessing class: FSMSSMSSSSSNFFN.
% 50.69/7.96 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 50.69/7.96 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 50.69/7.96 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 50.69/7.96 % No SInE strategy applied
% 50.69/7.96 % Search class: FGHSM-FFMF32-SFFFFFNN
% 50.69/7.96 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 50.69/7.96 % Starting SubtermCWHack with 136s (1) cores
% 50.69/7.96 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 50.69/7.96 % Starting U----_116XG_C05_02_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 164s (1) cores
% 50.69/7.96 % Starting G-E--_208_B07CMA_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 50.69/7.96 % Preprocessing time : 0.002 s
% 50.69/7.96 % Presaturation interreduction done
% 50.69/7.96
% 50.69/7.96 % Proof found!
% 50.69/7.96 % SZS status Theorem
% 50.69/7.96 % SZS output start CNFRefutation
% See solution above
% 50.69/7.96 % Parsed axioms : 21
% 50.69/7.96 % Removed by relevancy pruning/SinE : 0
% 50.69/7.96 % Initial clauses : 35
% 50.69/7.96 % Removed in clause preprocessing : 3
% 50.69/7.96 % Initial clauses in saturation : 32
% 50.69/7.96 % Processed clauses : 3857
% 50.69/7.96 % ...of these trivial : 31
% 50.69/7.96 % ...subsumed : 3134
% 50.69/7.96 % ...remaining for further processing : 692
% 50.69/7.96 % Other redundant clauses eliminated : 1957
% 50.69/7.96 % Clauses deleted for lack of memory : 0
% 50.69/7.96 % Backward-subsumed : 40
% 50.69/7.96 % Backward-rewritten : 32
% 50.69/7.96 % Generated clauses : 148145
% 50.69/7.96 % ...of the previous two non-redundant : 142863
% 50.69/7.96 % ...aggressively subsumed : 0
% 50.69/7.96 % Contextual simplify-reflections : 11
% 50.69/7.96 % Paramodulations : 146028
% 50.69/7.96 % Factorizations : 158
% 50.69/7.96 % NegExts : 0
% 50.69/7.96 % Equation resolutions : 1959
% 50.69/7.96 % Disequality decompositions : 0
% 50.69/7.96 % Total rewrite steps : 9555
% 50.69/7.96 % ...of those cached : 9412
% 50.69/7.96 % Propositional unsat checks : 0
% 50.69/7.96 % Propositional check models : 0
% 50.69/7.96 % Propositional check unsatisfiable : 0
% 50.69/7.96 % Propositional clauses : 0
% 50.69/7.96 % Propositional clauses after purity: 0
% 50.69/7.96 % Propositional unsat core size : 0
% 50.69/7.96 % Propositional preprocessing time : 0.000
% 50.69/7.96 % Propositional encoding time : 0.000
% 50.69/7.96 % Propositional solver time : 0.000
% 50.69/7.96 % Success case prop preproc time : 0.000
% 50.69/7.96 % Success case prop encoding time : 0.000
% 50.69/7.96 % Success case prop solver time : 0.000
% 50.69/7.96 % Current number of processed clauses : 582
% 50.69/7.96 % Positive orientable unit clauses : 29
% 50.69/7.96 % Positive unorientable unit clauses: 1
% 50.69/7.96 % Negative unit clauses : 21
% 50.69/7.96 % Non-unit-clauses : 531
% 50.69/7.96 % Current number of unprocessed clauses: 138894
% 50.69/7.96 % ...number of literals in the above : 786355
% 50.69/7.96 % Current number of archived formulas : 0
% 50.69/7.96 % Current number of archived clauses : 102
% 50.69/7.96 % Clause-clause subsumption calls (NU) : 44162
% 50.69/7.96 % Rec. Clause-clause subsumption calls : 27122
% 50.69/7.96 % Non-unit clause-clause subsumptions : 2130
% 50.69/7.96 % Unit Clause-clause subsumption calls : 766
% 50.69/7.96 % Rewrite failures with RHS unbound : 0
% 50.69/7.96 % BW rewrite match attempts : 44
% 50.69/7.96 % BW rewrite match successes : 20
% 50.69/7.96 % Condensation attempts : 0
% 50.69/7.96 % Condensation successes : 0
% 50.69/7.96 % Termbank termtop insertions : 3203518
% 50.69/7.96 % Search garbage collected termcells : 504
% 50.69/7.96
% 50.69/7.96 % -------------------------------------------------
% 50.69/7.96 % User time : 7.037 s
% 50.69/7.96 % System time : 0.166 s
% 50.69/7.96 % Total time : 7.203 s
% 50.69/7.96 % Maximum resident set size: 3644 pages
% 50.69/7.96
% 50.69/7.96 % -------------------------------------------------
% 50.69/7.96 % User time : 35.155 s
% 50.69/7.96 % System time : 1.128 s
% 50.69/7.96 % Total time : 36.282 s
% 50.69/7.96 % Maximum resident set size: 4608 pages
% 50.69/7.96 % E exiting
%------------------------------------------------------------------------------