%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SEU132+1 : 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 : n004.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 0.04s 0.47s
% Output : CNFRefutation 0.04s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 3
% Syntax : Number of formulae : 30 ( 5 unt; 0 def)
% Number of atoms : 90 ( 11 equ)
% Maximal formula atoms : 20 ( 3 avg)
% Number of connectives : 97 ( 37 ~; 42 |; 10 &)
% ( 5 <=>; 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 : 6 ( 6 usr; 3 con; 0-3 aty)
% Number of variables : 77 ( 6 sgn 30 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
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(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(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(c_0_3,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_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,plain,
! [X8,X9,X10,X11,X12] :
( ( subset(X11,X12)
| ~ in(esk4_2(X11,X12),X12) )
& ( subset(X11,X12)
| in(esk4_2(X11,X12),X11) )
& ( in(X10,X9)
| ~ in(X10,X8)
| ~ subset(X8,X9) ) ),
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_6,negated_conjecture,
( ~ subset(set_difference(esk1_0,esk3_0),set_difference(esk2_0,esk3_0))
& subset(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_3])])])]) ).
fof(c_0_7,plain,
! [X15,X16,X17,X18,X19,X20,X21,X22] :
( ( X22 = set_difference(X20,X21)
| in(esk5_3(X20,X21,X22),X22)
| ~ in(esk5_3(X20,X21,X22),X21) )
& ( X22 = set_difference(X20,X21)
| in(esk5_3(X20,X21,X22),X22)
| in(esk5_3(X20,X21,X22),X20) )
& ( X22 = set_difference(X20,X21)
| in(esk5_3(X20,X21,X22),X21)
| ~ in(esk5_3(X20,X21,X22),X20)
| ~ in(esk5_3(X20,X21,X22),X22) )
& ( X17 != set_difference(X15,X16)
| in(X19,X17)
| in(X19,X16)
| ~ in(X19,X15) )
& ( X17 != set_difference(X15,X16)
| ~ in(X18,X17)
| ~ in(X18,X16) )
& ( X17 != set_difference(X15,X16)
| ~ in(X18,X17)
| in(X18,X15) ) ),
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])])])])])])]) ).
cnf(c_0_8,plain,
( ~ in(X3,X1)
| ~ subset(X1,X2)
| in(X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,negated_conjecture,
subset(esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,plain,
( X3 != set_difference(X2,X4)
| ~ in(X1,X3)
| in(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_11,plain,
( ~ in(esk4_2(X1,X2),X2)
| subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_12,negated_conjecture,
( ~ in(X1,esk1_0)
| in(X1,esk2_0) ),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_13,plain,
( ~ in(X1,set_difference(X2,X3))
| in(X1,X2) ),
inference(er,[status(thm)],[c_0_10]) ).
cnf(c_0_14,plain,
( subset(X1,X2)
| in(esk4_2(X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_15,negated_conjecture,
( ~ in(esk4_2(X1,esk2_0),esk1_0)
| subset(X1,esk2_0) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_16,plain,
( in(esk4_2(set_difference(X1,X2),X3),X1)
| subset(set_difference(X1,X2),X3) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_17,plain,
( X4 != set_difference(X2,X3)
| ~ in(X1,X2)
| in(X1,X4)
| in(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_18,negated_conjecture,
subset(set_difference(esk1_0,X1),esk2_0),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_19,plain,
( X3 != set_difference(X4,X2)
| ~ in(X1,X3)
| ~ in(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_20,plain,
( ~ in(X1,X2)
| in(X1,X3)
| in(X1,set_difference(X2,X3)) ),
inference(er,[status(thm)],[c_0_17]) ).
cnf(c_0_21,negated_conjecture,
( ~ in(X1,set_difference(esk1_0,X2))
| in(X1,esk2_0) ),
inference(spm,[status(thm)],[c_0_8,c_0_18]) ).
cnf(c_0_22,plain,
( ~ in(X1,X3)
| ~ in(X1,set_difference(X2,X3)) ),
inference(er,[status(thm)],[c_0_19]) ).
cnf(c_0_23,plain,
( ~ in(esk4_2(X1,set_difference(X2,X3)),X2)
| in(esk4_2(X1,set_difference(X2,X3)),X3)
| subset(X1,set_difference(X2,X3)) ),
inference(spm,[status(thm)],[c_0_11,c_0_20]) ).
cnf(c_0_24,negated_conjecture,
( in(esk4_2(set_difference(esk1_0,X1),X2),esk2_0)
| subset(set_difference(esk1_0,X1),X2) ),
inference(spm,[status(thm)],[c_0_21,c_0_14]) ).
cnf(c_0_25,plain,
( ~ in(esk4_2(set_difference(X1,X2),X3),X2)
| subset(set_difference(X1,X2),X3) ),
inference(spm,[status(thm)],[c_0_22,c_0_14]) ).
cnf(c_0_26,negated_conjecture,
( in(esk4_2(set_difference(esk1_0,X1),set_difference(esk2_0,X2)),X2)
| subset(set_difference(esk1_0,X1),set_difference(esk2_0,X2)) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_27,negated_conjecture,
~ subset(set_difference(esk1_0,esk3_0),set_difference(esk2_0,esk3_0)),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_28,negated_conjecture,
subset(set_difference(esk1_0,X1),set_difference(esk2_0,X1)),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_29,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_27,c_0_28])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU132+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.37 % Computer : n004.cluster.edu
% 0.11/0.37 % Model : x86_64 x86_64
% 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37 % Memory : 8046.5625MB
% 0.11/0.37 % OS : Linux 6.8.0-71-generic
% 0.11/0.37 % CPULimit : 300
% 0.11/0.37 % WCLimit : 300
% 0.11/0.37 % DateTime : Mon Sep 21 05:51:49 UTC 2026
% 0.04/0.38 % CPUTime :
% 0.04/0.38 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.04/0.42 Running first-order theorem proving
% 0.04/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
% 0.04/0.47 % Version: 3.5.1
% 0.04/0.47 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.04/0.47 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.04/0.47 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.04/0.47 % Starting new_bool_3 with 300s (1) cores
% 0.04/0.47 % Starting new_bool_1 with 300s (1) cores
% 0.04/0.47 % Starting sh5l with 300s (1) cores
% 0.04/0.47 % sh5l with pid 2382488 completed with status 0
% 0.04/0.47 % Result found by sh5l
% 0.04/0.47 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.04/0.47 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.04/0.47 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.04/0.47 % Starting new_bool_3 with 300s (1) cores
% 0.04/0.47 % Starting new_bool_1 with 300s (1) cores
% 0.04/0.47 % Starting sh5l with 300s (1) cores
% 0.04/0.47 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.04/0.47 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.04/0.47 % Search class: FGHSS-FFSS32-SFFFFFNN
% 0.04/0.47 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.04/0.47 % Starting SubtermCWHack with 31s (1) cores
% 0.04/0.47 % SubtermCWHack with pid 2382489 completed with status 0
% 0.04/0.47 % Result found by SubtermCWHack
% 0.04/0.47 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.04/0.47 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.04/0.47 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.04/0.47 % Starting new_bool_3 with 300s (1) cores
% 0.04/0.47 % Starting new_bool_1 with 300s (1) cores
% 0.04/0.47 % Starting sh5l with 300s (1) cores
% 0.04/0.47 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.04/0.47 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.04/0.47 % Search class: FGHSS-FFSS32-SFFFFFNN
% 0.04/0.47 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.04/0.47 % Starting SubtermCWHack with 31s (1) cores
% 0.04/0.47 % Preprocessing time : 0.001 s
% 0.04/0.47
% 0.04/0.47 % Proof found!
% 0.04/0.47 % SZS status Theorem
% 0.04/0.47 % SZS output start CNFRefutation
% See solution above
% 0.04/0.47 % Parsed axioms : 15
% 0.04/0.47 % Removed by relevancy pruning/SinE : 2
% 0.04/0.47 % Initial clauses : 21
% 0.04/0.47 % Removed in clause preprocessing : 0
% 0.04/0.47 % Initial clauses in saturation : 21
% 0.04/0.47 % Processed clauses : 518
% 0.04/0.47 % ...of these trivial : 0
% 0.04/0.47 % ...subsumed : 358
% 0.04/0.47 % ...remaining for further processing : 160
% 0.04/0.47 % Other redundant clauses eliminated : 3
% 0.04/0.47 % Clauses deleted for lack of memory : 0
% 0.04/0.47 % Backward-subsumed : 5
% 0.04/0.47 % Backward-rewritten : 10
% 0.04/0.47 % Generated clauses : 1794
% 0.04/0.47 % ...of the previous two non-redundant : 1332
% 0.04/0.47 % ...aggressively subsumed : 0
% 0.04/0.47 % Contextual simplify-reflections : 3
% 0.04/0.47 % Paramodulations : 1781
% 0.04/0.47 % Factorizations : 10
% 0.04/0.47 % NegExts : 0
% 0.04/0.47 % Equation resolutions : 3
% 0.04/0.47 % Disequality decompositions : 0
% 0.04/0.47 % Total rewrite steps : 930
% 0.04/0.47 % ...of those cached : 852
% 0.04/0.47 % Propositional unsat checks : 0
% 0.04/0.47 % Propositional check models : 0
% 0.04/0.47 % Propositional check unsatisfiable : 0
% 0.04/0.47 % Propositional clauses : 0
% 0.04/0.47 % Propositional clauses after purity: 0
% 0.04/0.47 % Propositional unsat core size : 0
% 0.04/0.47 % Propositional preprocessing time : 0.000
% 0.04/0.47 % Propositional encoding time : 0.000
% 0.04/0.47 % Propositional solver time : 0.000
% 0.04/0.47 % Success case prop preproc time : 0.000
% 0.04/0.47 % Success case prop encoding time : 0.000
% 0.04/0.47 % Success case prop solver time : 0.000
% 0.04/0.47 % Current number of processed clauses : 142
% 0.04/0.47 % Positive orientable unit clauses : 19
% 0.04/0.47 % Positive unorientable unit clauses: 0
% 0.04/0.47 % Negative unit clauses : 6
% 0.04/0.47 % Non-unit-clauses : 117
% 0.04/0.47 % Current number of unprocessed clauses: 800
% 0.04/0.47 % ...number of literals in the above : 2355
% 0.04/0.47 % Current number of archived formulas : 0
% 0.04/0.47 % Current number of archived clauses : 15
% 0.04/0.47 % Clause-clause subsumption calls (NU) : 2272
% 0.04/0.47 % Rec. Clause-clause subsumption calls : 1840
% 0.04/0.47 % Non-unit clause-clause subsumptions : 214
% 0.04/0.47 % Unit Clause-clause subsumption calls : 119
% 0.04/0.47 % Rewrite failures with RHS unbound : 0
% 0.04/0.47 % BW rewrite match attempts : 36
% 0.04/0.47 % BW rewrite match successes : 6
% 0.04/0.47 % Condensation attempts : 0
% 0.04/0.47 % Condensation successes : 0
% 0.04/0.47 % Termbank termtop insertions : 20916
% 0.04/0.47 % Search garbage collected termcells : 333
% 0.04/0.47
% 0.04/0.47 % -------------------------------------------------
% 0.04/0.47 % User time : 0.032 s
% 0.04/0.47 % System time : 0.003 s
% 0.04/0.47 % Total time : 0.035 s
% 0.04/0.47 % Maximum resident set size: 3588 pages
% 0.04/0.47
% 0.04/0.47 % -------------------------------------------------
% 0.04/0.47 % User time : 0.033 s
% 0.04/0.47 % System time : 0.008 s
% 0.04/0.47 % Total time : 0.041 s
% 0.04/0.47 % Maximum resident set size: 4608 pages
% 0.04/0.47 % E exiting
%------------------------------------------------------------------------------