%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SEU132+2 : TPTP v9.3.1. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n019.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:54 PM UTC 2026
% Result : Theorem 34.95s 5.78s
% Output : CNFRefutation 34.95s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 4
% Syntax : Number of formulae : 32 ( 7 unt; 0 def)
% Number of atoms : 94 ( 18 equ)
% Maximal formula atoms : 20 ( 2 avg)
% Number of connectives : 103 ( 41 ~; 42 |; 11 &)
% ( 6 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-3 aty)
% Number of variables : 72 ( 4 sgn 34 !; 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/sandbox2/benchmark/theBenchmark.p',d4_xboole_0) ).
fof(t33_xboole_1,conjecture,
! [X1,X2,X3] :
( subset(X1,X2)
=> subset(set_difference(X1,X3),set_difference(X2,X3)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t33_xboole_1) ).
fof(d3_tarski,axiom,
! [X1,X2] :
( subset(X1,X2)
<=> ! [X3] :
( in(X3,X1)
=> in(X3,X2) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d3_tarski) ).
fof(l32_xboole_1,lemma,
! [X1,X2] :
( set_difference(X1,X2) = empty_set
<=> subset(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l32_xboole_1) ).
fof(c_0_4,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_5,negated_conjecture,
~ ! [X1,X2,X3] :
( subset(X1,X2)
=> subset(set_difference(X1,X3),set_difference(X2,X3)) ),
inference(assume_negation,[status(cth)],[t33_xboole_1]) ).
fof(c_0_6,plain,
! [X41,X42,X43,X44,X45,X46,X47,X48] :
( ( X48 = set_difference(X46,X47)
| in(esk5_3(X46,X47,X48),X48)
| ~ in(esk5_3(X46,X47,X48),X47) )
& ( X48 = set_difference(X46,X47)
| in(esk5_3(X46,X47,X48),X48)
| in(esk5_3(X46,X47,X48),X46) )
& ( X48 = set_difference(X46,X47)
| in(esk5_3(X46,X47,X48),X47)
| ~ in(esk5_3(X46,X47,X48),X46)
| ~ in(esk5_3(X46,X47,X48),X48) )
& ( X43 != set_difference(X41,X42)
| in(X45,X43)
| in(X45,X42)
| ~ in(X45,X41) )
& ( X43 != set_difference(X41,X42)
| ~ in(X44,X43)
| ~ in(X44,X42) )
& ( X43 != set_difference(X41,X42)
| ~ in(X44,X43)
| in(X44,X41) ) ),
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_4])])])])])])]) ).
fof(c_0_7,plain,
! [X26,X27,X28,X29,X30] :
( ( subset(X29,X30)
| ~ in(esk3_2(X29,X30),X30) )
& ( subset(X29,X30)
| in(esk3_2(X29,X30),X29) )
& ( in(X28,X27)
| ~ in(X28,X26)
| ~ subset(X26,X27) ) ),
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_tarski])])])])])])]) ).
fof(c_0_8,negated_conjecture,
( ~ subset(set_difference(esk9_0,esk11_0),set_difference(esk10_0,esk11_0))
& subset(esk9_0,esk10_0) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[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,plain,
( ~ in(X3,X1)
| ~ subset(X1,X2)
| in(X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_11,negated_conjecture,
subset(esk9_0,esk10_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_12,plain,
( X3 != set_difference(X2,X4)
| ~ in(X1,X3)
| in(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_13,negated_conjecture,
~ subset(set_difference(esk9_0,esk11_0),set_difference(esk10_0,esk11_0)),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_14,plain,
( subset(X1,X2)
| in(esk3_2(X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
fof(c_0_15,lemma,
! [X58,X59] :
( ( set_difference(X58,X59) = empty_set
| ~ subset(X58,X59) )
& ( subset(X58,X59)
| set_difference(X58,X59) != empty_set ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[l32_xboole_1])])]) ).
cnf(c_0_16,plain,
( ~ in(X1,X2)
| in(X1,X3)
| in(X1,set_difference(X2,X3)) ),
inference(er,[status(thm)],[c_0_9]) ).
cnf(c_0_17,negated_conjecture,
( ~ in(X1,esk9_0)
| in(X1,esk10_0) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_18,plain,
( ~ in(X1,set_difference(X2,X3))
| in(X1,X2) ),
inference(er,[status(thm)],[c_0_12]) ).
cnf(c_0_19,negated_conjecture,
in(esk3_2(set_difference(esk9_0,esk11_0),set_difference(esk10_0,esk11_0)),set_difference(esk9_0,esk11_0)),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_20,plain,
( X3 != set_difference(X4,X2)
| ~ in(X1,X3)
| ~ in(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_21,lemma,
( ~ subset(X1,X2)
| set_difference(X1,X2) = empty_set ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_22,plain,
( ~ in(esk3_2(X1,X2),X2)
| subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_23,negated_conjecture,
( ~ in(X1,esk9_0)
| in(X1,X2)
| in(X1,set_difference(esk10_0,X2)) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_24,negated_conjecture,
in(esk3_2(set_difference(esk9_0,esk11_0),set_difference(esk10_0,esk11_0)),esk9_0),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_25,lemma,
( set_difference(X1,X2) != empty_set
| subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_26,plain,
( ~ in(X1,X3)
| ~ in(X1,set_difference(X2,X3)) ),
inference(er,[status(thm)],[c_0_20]) ).
cnf(c_0_27,lemma,
( ~ in(esk3_2(X1,X2),X2)
| set_difference(X1,X2) = empty_set ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_28,negated_conjecture,
( in(esk3_2(set_difference(esk9_0,esk11_0),set_difference(esk10_0,esk11_0)),X1)
| in(esk3_2(set_difference(esk9_0,esk11_0),set_difference(esk10_0,esk11_0)),set_difference(esk10_0,X1)) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_29,negated_conjecture,
set_difference(set_difference(esk9_0,esk11_0),set_difference(esk10_0,esk11_0)) != empty_set,
inference(spm,[status(thm)],[c_0_13,c_0_25]) ).
cnf(c_0_30,negated_conjecture,
~ in(esk3_2(set_difference(esk9_0,esk11_0),set_difference(esk10_0,esk11_0)),esk11_0),
inference(spm,[status(thm)],[c_0_26,c_0_19]) ).
cnf(c_0_31,lemma,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_29]),c_0_30]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SEU132+2 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.36 % Computer : n019.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Mon Sep 21 05:52:05 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.13/0.42 Running first-order theorem proving
% 0.13/0.42 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
% 34.95/5.78 % Version: 3.5.1
% 34.95/5.78 % Preprocessing class: FSMSSMSSSSSNFFN.
% 34.95/5.78 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 34.95/5.78 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 34.95/5.78 % Starting new_bool_3 with 300s (1) cores
% 34.95/5.78 % Starting new_bool_1 with 300s (1) cores
% 34.95/5.78 % Starting sh5l with 300s (1) cores
% 34.95/5.78 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 1822091 completed with status 0
% 34.95/5.78 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 34.95/5.78 % Preprocessing class: FSMSSMSSSSSNFFN.
% 34.95/5.78 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 34.95/5.78 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 34.95/5.78 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 34.95/5.78 % No SInE strategy applied
% 34.95/5.78 % Search class: FGHSM-FFMS32-SFFFFFNN
% 34.95/5.78 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 34.95/5.78 % Starting SubtermCWHack with 136s (1) cores
% 34.95/5.78 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 34.95/5.78 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04AN with 136s (1) cores
% 34.95/5.78 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S059I with 136s (1) cores
% 34.95/5.78 % Starting new_bool_3 with 136s (1) cores
% 34.95/5.78 % G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S059I with pid 1822098 completed with status 0
% 34.95/5.78 % Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S059I
% 34.95/5.78 % Preprocessing class: FSMSSMSSSSSNFFN.
% 34.95/5.78 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 34.95/5.78 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 34.95/5.78 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 34.95/5.78 % No SInE strategy applied
% 34.95/5.78 % Search class: FGHSM-FFMS32-SFFFFFNN
% 34.95/5.78 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 34.95/5.78 % Starting SubtermCWHack with 136s (1) cores
% 34.95/5.78 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 34.95/5.78 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04AN with 136s (1) cores
% 34.95/5.78 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S059I with 136s (1) cores
% 34.95/5.78 % Preprocessing time : 0.002 s
% 34.95/5.78 % Presaturation interreduction done
% 34.95/5.78
% 34.95/5.78 % Proof found!
% 34.95/5.78 % SZS status Theorem
% 34.95/5.78 % SZS output start CNFRefutation
% See solution above
% 34.95/5.78 % Parsed axioms : 45
% 34.95/5.78 % Removed by relevancy pruning/SinE : 0
% 34.95/5.78 % Initial clauses : 72
% 34.95/5.78 % Removed in clause preprocessing : 4
% 34.95/5.78 % Initial clauses in saturation : 68
% 34.95/5.78 % Processed clauses : 36658
% 34.95/5.78 % ...of these trivial : 1041
% 34.95/5.78 % ...subsumed : 31018
% 34.95/5.78 % ...remaining for further processing : 4599
% 34.95/5.78 % Other redundant clauses eliminated : 1249
% 34.95/5.78 % Clauses deleted for lack of memory : 0
% 34.95/5.78 % Backward-subsumed : 201
% 34.95/5.78 % Backward-rewritten : 43
% 34.95/5.78 % Generated clauses : 345371
% 34.95/5.78 % ...of the previous two non-redundant : 300395
% 34.95/5.78 % ...aggressively subsumed : 0
% 34.95/5.78 % Contextual simplify-reflections : 4
% 34.95/5.78 % Paramodulations : 343677
% 34.95/5.78 % Factorizations : 444
% 34.95/5.78 % NegExts : 0
% 34.95/5.78 % Equation resolutions : 1249
% 34.95/5.78 % Disequality decompositions : 0
% 34.95/5.78 % Total rewrite steps : 147233
% 34.95/5.78 % ...of those cached : 142318
% 34.95/5.78 % Propositional unsat checks : 0
% 34.95/5.78 % Propositional check models : 0
% 34.95/5.78 % Propositional check unsatisfiable : 0
% 34.95/5.78 % Propositional clauses : 0
% 34.95/5.78 % Propositional clauses after purity: 0
% 34.95/5.78 % Propositional unsat core size : 0
% 34.95/5.78 % Propositional preprocessing time : 0.000
% 34.95/5.78 % Propositional encoding time : 0.000
% 34.95/5.78 % Propositional solver time : 0.000
% 34.95/5.78 % Success case prop preproc time : 0.000
% 34.95/5.78 % Success case prop encoding time : 0.000
% 34.95/5.78 % Success case prop solver time : 0.000
% 34.95/5.78 % Current number of processed clauses : 4276
% 34.95/5.78 % Positive orientable unit clauses : 326
% 34.95/5.78 % Positive unorientable unit clauses: 2
% 34.95/5.78 % Negative unit clauses : 448
% 34.95/5.78 % Non-unit-clauses : 3500
% 34.95/5.78 % Current number of unprocessed clauses: 263127
% 34.95/5.78 % ...number of literals in the above : 837402
% 34.95/5.78 % Current number of archived formulas : 0
% 34.95/5.78 % Current number of archived clauses : 311
% 34.95/5.78 % Clause-clause subsumption calls (NU) : 1154154
% 34.95/5.78 % Rec. Clause-clause subsumption calls : 801779
% 34.95/5.78 % Non-unit clause-clause subsumptions : 12493
% 34.95/5.78 % Unit Clause-clause subsumption calls : 77863
% 34.95/5.78 % Rewrite failures with RHS unbound : 0
% 34.95/5.78 % BW rewrite match attempts : 276
% 34.95/5.78 % BW rewrite match successes : 65
% 34.95/5.78 % Condensation attempts : 0
% 34.95/5.78 % Condensation successes : 0
% 34.95/5.78 % Termbank termtop insertions : 4502800
% 34.95/5.78 % Search garbage collected termcells : 1037
% 34.95/5.78
% 34.95/5.78 % -------------------------------------------------
% 34.95/5.78 % User time : 4.767 s
% 34.95/5.78 % System time : 0.191 s
% 34.95/5.78 % Total time : 4.958 s
% 34.95/5.78 % Maximum resident set size: 3668 pages
% 34.95/5.78
% 34.95/5.78 % -------------------------------------------------
% 34.95/5.78 % User time : 23.671 s
% 34.95/5.78 % System time : 1.073 s
% 34.95/5.78 % Total time : 24.743 s
% 34.95/5.78 % Maximum resident set size: 4864 pages
% 34.95/5.78 % E exiting
%------------------------------------------------------------------------------