%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SEU103+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 : 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:49 PM UTC 2026
% Result : Theorem 0.29s 0.68s
% Output : CNFRefutation 0.29s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 6
% Syntax : Number of formulae : 34 ( 11 unt; 0 def)
% Number of atoms : 123 ( 11 equ)
% Maximal formula atoms : 5 ( 3 avg)
% Number of connectives : 140 ( 51 ~; 41 |; 34 &)
% ( 0 <=>; 14 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 6 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 3 con; 0-3 aty)
% Number of variables : 69 ( 0 sgn 49 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t14_finsub_1,conjecture,
! [X1,X2,X3] :
( ( preboolean(X3)
& ~ empty(X3) )
=> ( ( element(X2,X3)
& element(X1,X3) )
=> element(symmetric_difference(X1,X2),X3) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t14_finsub_1) ).
fof(dt_k1_finsub_1,axiom,
! [X1,X2,X3] :
( ( element(X3,X1)
& element(X2,X1)
& preboolean(X1)
& ~ empty(X1) )
=> element(prebool_union2(X1,X2,X3),X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',dt_k1_finsub_1) ).
fof(redefinition_k1_finsub_1,axiom,
! [X1,X2,X3] :
( ( element(X3,X1)
& element(X2,X1)
& preboolean(X1)
& ~ empty(X1) )
=> prebool_union2(X1,X2,X3) = set_union2(X2,X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',redefinition_k1_finsub_1) ).
fof(d6_xboole_0,axiom,
! [X1,X2] : symmetric_difference(X1,X2) = set_union2(set_difference(X1,X2),set_difference(X2,X1)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d6_xboole_0) ).
fof(dt_k2_finsub_1,axiom,
! [X1,X2,X3] :
( ( element(X3,X1)
& element(X2,X1)
& preboolean(X1)
& ~ empty(X1) )
=> element(prebool_difference(X1,X2,X3),X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',dt_k2_finsub_1) ).
fof(redefinition_k2_finsub_1,axiom,
! [X1,X2,X3] :
( ( element(X3,X1)
& element(X2,X1)
& preboolean(X1)
& ~ empty(X1) )
=> prebool_difference(X1,X2,X3) = set_difference(X2,X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',redefinition_k2_finsub_1) ).
fof(c_0_6,negated_conjecture,
~ ! [X1,X2,X3] :
( ( preboolean(X3)
& ~ empty(X3) )
=> ( ( element(X2,X3)
& element(X1,X3) )
=> element(symmetric_difference(X1,X2),X3) ) ),
inference(assume_negation,[status(cth)],[t14_finsub_1]) ).
fof(c_0_7,negated_conjecture,
~ ! [X1,X2,X3] :
( ( preboolean(X3)
& ~ empty(X3) )
=> ( ( element(X2,X3)
& element(X1,X3) )
=> element(symmetric_difference(X1,X2),X3) ) ),
inference(fof_simplification,[status(thm)],[c_0_6]) ).
fof(c_0_8,plain,
! [X1,X2,X3] :
( ( element(X3,X1)
& element(X2,X1)
& preboolean(X1)
& ~ empty(X1) )
=> element(prebool_union2(X1,X2,X3),X1) ),
inference(fof_simplification,[status(thm)],[dt_k1_finsub_1]) ).
fof(c_0_9,plain,
! [X1,X2,X3] :
( ( element(X3,X1)
& element(X2,X1)
& preboolean(X1)
& ~ empty(X1) )
=> prebool_union2(X1,X2,X3) = set_union2(X2,X3) ),
inference(fof_simplification,[status(thm)],[redefinition_k1_finsub_1]) ).
fof(c_0_10,negated_conjecture,
( ~ element(symmetric_difference(esk11_0,esk12_0),esk13_0)
& element(esk12_0,esk13_0)
& element(esk11_0,esk13_0)
& preboolean(esk13_0)
& ~ empty(esk13_0) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])])]) ).
fof(c_0_11,plain,
! [X18,X19] : symmetric_difference(X18,X19) = set_union2(set_difference(X18,X19),set_difference(X19,X18)),
inference(variable_rename,[status(thm)],[d6_xboole_0]) ).
fof(c_0_12,plain,
! [X20,X21,X22] :
( element(prebool_union2(X20,X21,X22),X20)
| ~ element(X22,X20)
| ~ element(X21,X20)
| ~ preboolean(X20)
| empty(X20) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])])]) ).
fof(c_0_13,plain,
! [X57,X58,X59] :
( prebool_union2(X57,X58,X59) = set_union2(X58,X59)
| ~ element(X59,X57)
| ~ element(X58,X57)
| ~ preboolean(X57)
| empty(X57) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_9])])]) ).
fof(c_0_14,plain,
! [X1,X2,X3] :
( ( element(X3,X1)
& element(X2,X1)
& preboolean(X1)
& ~ empty(X1) )
=> element(prebool_difference(X1,X2,X3),X1) ),
inference(fof_simplification,[status(thm)],[dt_k2_finsub_1]) ).
fof(c_0_15,plain,
! [X1,X2,X3] :
( ( element(X3,X1)
& element(X2,X1)
& preboolean(X1)
& ~ empty(X1) )
=> prebool_difference(X1,X2,X3) = set_difference(X2,X3) ),
inference(fof_simplification,[status(thm)],[redefinition_k2_finsub_1]) ).
cnf(c_0_16,negated_conjecture,
~ element(symmetric_difference(esk11_0,esk12_0),esk13_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_17,plain,
symmetric_difference(X1,X2) = set_union2(set_difference(X1,X2),set_difference(X2,X1)),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_18,plain,
( ~ element(X3,X1)
| ~ element(X2,X1)
| ~ preboolean(X1)
| element(prebool_union2(X1,X2,X3),X1)
| empty(X1) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_19,plain,
( ~ element(X3,X1)
| ~ element(X2,X1)
| ~ preboolean(X1)
| prebool_union2(X1,X2,X3) = set_union2(X2,X3)
| empty(X1) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
fof(c_0_20,plain,
! [X23,X24,X25] :
( element(prebool_difference(X23,X24,X25),X23)
| ~ element(X25,X23)
| ~ element(X24,X23)
| ~ preboolean(X23)
| empty(X23) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_14])])]) ).
fof(c_0_21,plain,
! [X60,X61,X62] :
( prebool_difference(X60,X61,X62) = set_difference(X61,X62)
| ~ element(X62,X60)
| ~ element(X61,X60)
| ~ preboolean(X60)
| empty(X60) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_15])])]) ).
cnf(c_0_22,negated_conjecture,
~ element(set_union2(set_difference(esk11_0,esk12_0),set_difference(esk12_0,esk11_0)),esk13_0),
inference(rw,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_23,plain,
( ~ preboolean(X3)
| ~ element(X1,X3)
| ~ element(X2,X3)
| empty(X3)
| element(set_union2(X1,X2),X3) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_24,negated_conjecture,
preboolean(esk13_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_25,negated_conjecture,
~ empty(esk13_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_26,plain,
( ~ element(X3,X1)
| ~ element(X2,X1)
| ~ preboolean(X1)
| element(prebool_difference(X1,X2,X3),X1)
| empty(X1) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_27,plain,
( ~ element(X3,X1)
| ~ element(X2,X1)
| ~ preboolean(X1)
| prebool_difference(X1,X2,X3) = set_difference(X2,X3)
| empty(X1) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_28,negated_conjecture,
( ~ element(set_difference(esk11_0,esk12_0),esk13_0)
| ~ element(set_difference(esk12_0,esk11_0),esk13_0) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_24])]),c_0_25]) ).
cnf(c_0_29,plain,
( ~ preboolean(X3)
| ~ element(X1,X3)
| ~ element(X2,X3)
| empty(X3)
| element(set_difference(X1,X2),X3) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_30,negated_conjecture,
element(esk11_0,esk13_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_31,negated_conjecture,
element(esk12_0,esk13_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_32,negated_conjecture,
~ element(set_difference(esk11_0,esk12_0),esk13_0),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_30]),c_0_31]),c_0_24])]),c_0_25]) ).
cnf(c_0_33,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_29]),c_0_31]),c_0_30]),c_0_24])]),c_0_25]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : SEU103+1 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.08 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.19/0.47 % Computer : n019.cluster.edu
% 0.19/0.47 % Model : x86_64 x86_64
% 0.19/0.47 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.19/0.47 % Memory : 8046.5625MB
% 0.19/0.47 % OS : Linux 6.8.0-71-generic
% 0.19/0.47 % CPULimit : 300
% 0.19/0.47 % WCLimit : 300
% 0.19/0.47 % DateTime : Mon Sep 21 05:50:36 UTC 2026
% 0.19/0.48 % CPUTime :
% 0.19/0.48 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.24/0.56 Running first-order theorem proving
% 0.24/0.56 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.29/0.68 % Version: 3.5.1
% 0.29/0.68 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.29/0.68 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.29/0.68 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.29/0.68 % Starting new_bool_3 with 300s (1) cores
% 0.29/0.68 % Starting new_bool_1 with 300s (1) cores
% 0.29/0.68 % Starting sh5l with 300s (1) cores
% 0.29/0.68 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 1817243 completed with status 0
% 0.29/0.68 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.29/0.68 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.29/0.68 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.29/0.68 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.29/0.68 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.29/0.68 % No SInE strategy applied
% 0.29/0.68 % Search class: FGHSM-FFMM31-SFFFFFNN
% 0.29/0.68 % Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 0.29/0.68 % Starting SubtermCWHack with 136s (1) cores
% 0.29/0.68 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.29/0.68 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S4b with 136s (1) cores
% 0.29/0.68 % Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S0Y with 136s (1) cores
% 0.29/0.68 % Starting G-E--_208_B07----D_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.29/0.68 % G-E--_302_C18_F1_URBAN_S5PRR_RG_S0Y with pid 1817250 completed with status 0
% 0.29/0.68 % Result found by G-E--_302_C18_F1_URBAN_S5PRR_RG_S0Y
% 0.29/0.68 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.29/0.68 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.29/0.68 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.29/0.68 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.29/0.68 % No SInE strategy applied
% 0.29/0.68 % Search class: FGHSM-FFMM31-SFFFFFNN
% 0.29/0.68 % Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 0.29/0.68 % Starting SubtermCWHack with 136s (1) cores
% 0.29/0.68 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.29/0.68 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S4b with 136s (1) cores
% 0.29/0.68 % Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S0Y with 136s (1) cores
% 0.29/0.68 % Preprocessing time : 0.006 s
% 0.29/0.68
% 0.29/0.68 % Proof found!
% 0.29/0.68 % SZS status Theorem
% 0.29/0.69 % SZS output start CNFRefutation
% See solution above
% 0.29/0.69 % Parsed axioms : 46
% 0.29/0.69 % Removed by relevancy pruning/SinE : 0
% 0.29/0.69 % Initial clauses : 72
% 0.29/0.69 % Removed in clause preprocessing : 1
% 0.29/0.69 % Initial clauses in saturation : 71
% 0.29/0.69 % Processed clauses : 169
% 0.29/0.69 % ...of these trivial : 7
% 0.29/0.69 % ...subsumed : 39
% 0.29/0.69 % ...remaining for further processing : 123
% 0.29/0.69 % Other redundant clauses eliminated : 0
% 0.29/0.69 % Clauses deleted for lack of memory : 0
% 0.29/0.69 % Backward-subsumed : 5
% 0.29/0.69 % Backward-rewritten : 14
% 0.29/0.69 % Generated clauses : 224
% 0.29/0.69 % ...of the previous two non-redundant : 180
% 0.29/0.69 % ...aggressively subsumed : 0
% 0.29/0.69 % Contextual simplify-reflections : 4
% 0.29/0.69 % Paramodulations : 224
% 0.29/0.69 % Factorizations : 0
% 0.29/0.69 % NegExts : 0
% 0.29/0.69 % Equation resolutions : 0
% 0.29/0.69 % Disequality decompositions : 0
% 0.29/0.69 % Total rewrite steps : 76
% 0.29/0.69 % ...of those cached : 55
% 0.29/0.69 % Propositional unsat checks : 0
% 0.29/0.69 % Propositional check models : 0
% 0.29/0.69 % Propositional check unsatisfiable : 0
% 0.29/0.69 % Propositional clauses : 0
% 0.29/0.69 % Propositional clauses after purity: 0
% 0.29/0.69 % Propositional unsat core size : 0
% 0.29/0.69 % Propositional preprocessing time : 0.000
% 0.29/0.69 % Propositional encoding time : 0.000
% 0.29/0.69 % Propositional solver time : 0.000
% 0.29/0.69 % Success case prop preproc time : 0.000
% 0.29/0.69 % Success case prop encoding time : 0.000
% 0.29/0.69 % Success case prop solver time : 0.000
% 0.29/0.69 % Current number of processed clauses : 104
% 0.29/0.69 % Positive orientable unit clauses : 29
% 0.29/0.69 % Positive unorientable unit clauses: 1
% 0.29/0.69 % Negative unit clauses : 7
% 0.29/0.69 % Non-unit-clauses : 67
% 0.29/0.69 % Current number of unprocessed clauses: 70
% 0.29/0.69 % ...number of literals in the above : 354
% 0.29/0.69 % Current number of archived formulas : 0
% 0.29/0.69 % Current number of archived clauses : 20
% 0.29/0.69 % Clause-clause subsumption calls (NU) : 1722
% 0.29/0.69 % Rec. Clause-clause subsumption calls : 775
% 0.29/0.69 % Non-unit clause-clause subsumptions : 47
% 0.29/0.69 % Unit Clause-clause subsumption calls : 30
% 0.29/0.69 % Rewrite failures with RHS unbound : 0
% 0.29/0.69 % BW rewrite match attempts : 21
% 0.29/0.69 % BW rewrite match successes : 13
% 0.29/0.69 % Condensation attempts : 0
% 0.29/0.69 % Condensation successes : 0
% 0.29/0.69 % Termbank termtop insertions : 7314
% 0.29/0.69 % Search garbage collected termcells : 625
% 0.29/0.69
% 0.29/0.69 % -------------------------------------------------
% 0.29/0.69 % User time : 0.032 s
% 0.29/0.69 % System time : 0.005 s
% 0.29/0.69 % Total time : 0.037 s
% 0.29/0.69 % Maximum resident set size: 3620 pages
% 0.29/0.69
% 0.29/0.69 % -------------------------------------------------
% 0.29/0.69 % User time : 0.246 s
% 0.29/0.69 % System time : 0.035 s
% 0.29/0.69 % Total time : 0.281 s
% 0.29/0.69 % Maximum resident set size: 4864 pages
% 0.29/0.69 % E exiting
%------------------------------------------------------------------------------