%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SEU105+1 : TPTP v9.3.1. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n011.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.28s 0.60s
% Output : CNFRefutation 0.28s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 5
% Syntax : Number of formulae : 31 ( 9 unt; 0 def)
% Number of atoms : 95 ( 6 equ)
% Maximal formula atoms : 15 ( 3 avg)
% Number of connectives : 113 ( 49 ~; 37 |; 12 &)
% ( 1 <=>; 14 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 1 con; 0-2 aty)
% Number of variables : 44 ( 0 sgn 30 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t16_finsub_1,conjecture,
! [X1] :
( ~ empty(X1)
=> ( ! [X2] :
( element(X2,X1)
=> ! [X3] :
( element(X3,X1)
=> ( in(set_intersection2(X2,X3),X1)
& in(symmetric_difference(X2,X3),X1) ) ) )
=> preboolean(X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t16_finsub_1) ).
fof(t10_finsub_1,axiom,
! [X1] :
( preboolean(X1)
<=> ! [X2,X3] :
( ( in(X3,X1)
& in(X2,X1) )
=> ( in(set_difference(X2,X3),X1)
& in(set_union2(X2,X3),X1) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t10_finsub_1) ).
fof(t100_xboole_1,axiom,
! [X1,X2] : set_difference(X1,X2) = symmetric_difference(X1,set_intersection2(X1,X2)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t100_xboole_1) ).
fof(t94_xboole_1,axiom,
! [X1,X2] : set_union2(X1,X2) = symmetric_difference(symmetric_difference(X1,X2),set_intersection2(X1,X2)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t94_xboole_1) ).
fof(t1_subset,axiom,
! [X1,X2] :
( in(X1,X2)
=> element(X1,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t1_subset) ).
fof(c_0_5,negated_conjecture,
~ ! [X1] :
( ~ empty(X1)
=> ( ! [X2] :
( element(X2,X1)
=> ! [X3] :
( element(X3,X1)
=> ( in(set_intersection2(X2,X3),X1)
& in(symmetric_difference(X2,X3),X1) ) ) )
=> preboolean(X1) ) ),
inference(assume_negation,[status(cth)],[t16_finsub_1]) ).
fof(c_0_6,plain,
! [X55,X56,X57,X58] :
( ( preboolean(X58)
| ~ in(set_difference(esk11_1(X58),esk12_1(X58)),X58)
| ~ in(set_union2(esk11_1(X58),esk12_1(X58)),X58) )
& ( preboolean(X58)
| in(esk12_1(X58),X58) )
& ( preboolean(X58)
| in(esk11_1(X58),X58) )
& ( ~ preboolean(X55)
| ~ in(X57,X55)
| ~ in(X56,X55)
| in(set_difference(X56,X57),X55) )
& ( ~ preboolean(X55)
| ~ in(X57,X55)
| ~ in(X56,X55)
| in(set_union2(X56,X57),X55) ) ),
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)],[t10_finsub_1])])])])])])]) ).
fof(c_0_7,plain,
! [X53,X54] : set_difference(X53,X54) = symmetric_difference(X53,set_intersection2(X53,X54)),
inference(variable_rename,[status(thm)],[t100_xboole_1]) ).
fof(c_0_8,plain,
! [X86,X87] : set_union2(X86,X87) = symmetric_difference(symmetric_difference(X86,X87),set_intersection2(X86,X87)),
inference(variable_rename,[status(thm)],[t94_xboole_1]) ).
fof(c_0_9,negated_conjecture,
~ ! [X1] :
( ~ empty(X1)
=> ( ! [X2] :
( element(X2,X1)
=> ! [X3] :
( element(X3,X1)
=> ( in(set_intersection2(X2,X3),X1)
& in(symmetric_difference(X2,X3),X1) ) ) )
=> preboolean(X1) ) ),
inference(fof_simplification,[status(thm)],[c_0_5]) ).
cnf(c_0_10,plain,
( ~ in(set_difference(esk11_1(X1),esk12_1(X1)),X1)
| ~ in(set_union2(esk11_1(X1),esk12_1(X1)),X1)
| preboolean(X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_11,plain,
set_difference(X1,X2) = symmetric_difference(X1,set_intersection2(X1,X2)),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_12,plain,
set_union2(X1,X2) = symmetric_difference(symmetric_difference(X1,X2),set_intersection2(X1,X2)),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_13,negated_conjecture,
! [X62,X63] :
( ~ preboolean(esk13_0)
& ( ~ element(X62,esk13_0)
| ~ element(X63,esk13_0)
| in(set_intersection2(X62,X63),esk13_0) )
& ( ~ element(X62,esk13_0)
| ~ element(X63,esk13_0)
| in(symmetric_difference(X62,X63),esk13_0) )
& ~ empty(esk13_0) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_9])])])])])]) ).
cnf(c_0_14,plain,
( ~ in(symmetric_difference(symmetric_difference(esk11_1(X1),esk12_1(X1)),set_intersection2(esk11_1(X1),esk12_1(X1))),X1)
| ~ in(symmetric_difference(esk11_1(X1),set_intersection2(esk11_1(X1),esk12_1(X1))),X1)
| preboolean(X1) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_10,c_0_11]),c_0_12]) ).
cnf(c_0_15,negated_conjecture,
( ~ element(X1,esk13_0)
| ~ element(X2,esk13_0)
| in(symmetric_difference(X1,X2),esk13_0) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_16,negated_conjecture,
~ preboolean(esk13_0),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_17,negated_conjecture,
( ~ in(symmetric_difference(esk11_1(esk13_0),set_intersection2(esk11_1(esk13_0),esk12_1(esk13_0))),esk13_0)
| ~ element(symmetric_difference(esk11_1(esk13_0),esk12_1(esk13_0)),esk13_0)
| ~ element(set_intersection2(esk11_1(esk13_0),esk12_1(esk13_0)),esk13_0) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16]) ).
fof(c_0_18,plain,
! [X65,X66] :
( element(X65,X66)
| ~ in(X65,X66) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t1_subset])])]) ).
cnf(c_0_19,negated_conjecture,
( ~ element(esk11_1(esk13_0),esk13_0)
| ~ element(symmetric_difference(esk11_1(esk13_0),esk12_1(esk13_0)),esk13_0)
| ~ element(set_intersection2(esk11_1(esk13_0),esk12_1(esk13_0)),esk13_0) ),
inference(spm,[status(thm)],[c_0_17,c_0_15]) ).
cnf(c_0_20,plain,
( ~ in(X1,X2)
| element(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_21,negated_conjecture,
( ~ in(set_intersection2(esk11_1(esk13_0),esk12_1(esk13_0)),esk13_0)
| ~ element(esk11_1(esk13_0),esk13_0)
| ~ element(symmetric_difference(esk11_1(esk13_0),esk12_1(esk13_0)),esk13_0) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_22,negated_conjecture,
( ~ element(X1,esk13_0)
| ~ element(X2,esk13_0)
| in(set_intersection2(X1,X2),esk13_0) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_23,negated_conjecture,
( ~ element(esk12_1(esk13_0),esk13_0)
| ~ element(esk11_1(esk13_0),esk13_0)
| ~ element(symmetric_difference(esk11_1(esk13_0),esk12_1(esk13_0)),esk13_0) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_24,negated_conjecture,
( ~ element(esk12_1(esk13_0),esk13_0)
| ~ element(esk11_1(esk13_0),esk13_0) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_20]),c_0_15]) ).
cnf(c_0_25,negated_conjecture,
( ~ in(esk12_1(esk13_0),esk13_0)
| ~ element(esk11_1(esk13_0),esk13_0) ),
inference(spm,[status(thm)],[c_0_24,c_0_20]) ).
cnf(c_0_26,negated_conjecture,
( ~ in(esk11_1(esk13_0),esk13_0)
| ~ in(esk12_1(esk13_0),esk13_0) ),
inference(spm,[status(thm)],[c_0_25,c_0_20]) ).
cnf(c_0_27,plain,
( preboolean(X1)
| in(esk12_1(X1),X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_28,negated_conjecture,
~ in(esk11_1(esk13_0),esk13_0),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_16]) ).
cnf(c_0_29,plain,
( preboolean(X1)
| in(esk11_1(X1),X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_30,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_16]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : SEU105+1 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.07 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.17/0.42 % Computer : n011.cluster.edu
% 0.17/0.42 % Model : x86_64 x86_64
% 0.17/0.42 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.42 % Memory : 8046.5625MB
% 0.17/0.42 % OS : Linux 6.8.0-71-generic
% 0.17/0.42 % CPULimit : 300
% 0.17/0.42 % WCLimit : 300
% 0.17/0.42 % DateTime : Mon Sep 21 05:50:55 UTC 2026
% 0.17/0.43 % CPUTime :
% 0.17/0.43 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.17/0.50 Running first-order theorem proving
% 0.17/0.50 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
% 0.28/0.60 % Version: 3.5.1
% 0.28/0.60 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.28/0.60 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.28/0.60 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.28/0.60 % Starting new_bool_3 with 300s (1) cores
% 0.28/0.60 % Starting new_bool_1 with 300s (1) cores
% 0.28/0.60 % Starting sh5l with 300s (1) cores
% 0.28/0.60 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 1106243 completed with status 0
% 0.28/0.60 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.28/0.60 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.28/0.60 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.28/0.60 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.28/0.60 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.28/0.60 % No SInE strategy applied
% 0.28/0.60 % Search class: FGHSM-FFMM21-MFFFFFNN
% 0.28/0.60 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.28/0.60 % Starting SubtermCWHack with 136s (1) cores
% 0.28/0.60 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.28/0.60 % Starting SAT001_MinMin_p005000_rr_RG with 136s (1) cores
% 0.28/0.60 % Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S0Y with 136s (1) cores
% 0.28/0.60 % Starting new_bool_3 with 136s (1) cores
% 0.28/0.60 % G-E--_302_C18_F1_URBAN_S5PRR_RG_S0Y with pid 1106252 completed with status 0
% 0.28/0.60 % Result found by G-E--_302_C18_F1_URBAN_S5PRR_RG_S0Y
% 0.28/0.60 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.28/0.60 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.28/0.60 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.28/0.60 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.28/0.60 % No SInE strategy applied
% 0.28/0.60 % Search class: FGHSM-FFMM21-MFFFFFNN
% 0.28/0.60 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.28/0.60 % Starting SubtermCWHack with 136s (1) cores
% 0.28/0.60 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.28/0.60 % Starting SAT001_MinMin_p005000_rr_RG with 136s (1) cores
% 0.28/0.60 % Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S0Y with 136s (1) cores
% 0.28/0.60 % Preprocessing time : 0.003 s
% 0.28/0.60
% 0.28/0.60 % Proof found!
% 0.28/0.60 % SZS status Theorem
% 0.28/0.60 % SZS output start CNFRefutation
% See solution above
% 0.28/0.60 % Parsed axioms : 48
% 0.28/0.60 % Removed by relevancy pruning/SinE : 0
% 0.28/0.60 % Initial clauses : 77
% 0.28/0.60 % Removed in clause preprocessing : 2
% 0.28/0.60 % Initial clauses in saturation : 75
% 0.28/0.60 % Processed clauses : 135
% 0.28/0.60 % ...of these trivial : 7
% 0.28/0.60 % ...subsumed : 15
% 0.28/0.60 % ...remaining for further processing : 113
% 0.28/0.60 % Other redundant clauses eliminated : 0
% 0.28/0.60 % Clauses deleted for lack of memory : 0
% 0.28/0.60 % Backward-subsumed : 2
% 0.28/0.60 % Backward-rewritten : 14
% 0.28/0.60 % Generated clauses : 256
% 0.28/0.60 % ...of the previous two non-redundant : 212
% 0.28/0.60 % ...aggressively subsumed : 0
% 0.28/0.60 % Contextual simplify-reflections : 1
% 0.28/0.60 % Paramodulations : 256
% 0.28/0.60 % Factorizations : 0
% 0.28/0.60 % NegExts : 0
% 0.28/0.60 % Equation resolutions : 0
% 0.28/0.60 % Disequality decompositions : 0
% 0.28/0.60 % Total rewrite steps : 146
% 0.28/0.60 % ...of those cached : 127
% 0.28/0.60 % Propositional unsat checks : 0
% 0.28/0.60 % Propositional check models : 0
% 0.28/0.60 % Propositional check unsatisfiable : 0
% 0.28/0.60 % Propositional clauses : 0
% 0.28/0.60 % Propositional clauses after purity: 0
% 0.28/0.60 % Propositional unsat core size : 0
% 0.28/0.60 % Propositional preprocessing time : 0.000
% 0.28/0.60 % Propositional encoding time : 0.000
% 0.28/0.60 % Propositional solver time : 0.000
% 0.28/0.60 % Success case prop preproc time : 0.000
% 0.28/0.60 % Success case prop encoding time : 0.000
% 0.28/0.60 % Success case prop solver time : 0.000
% 0.28/0.60 % Current number of processed clauses : 97
% 0.28/0.60 % Positive orientable unit clauses : 29
% 0.28/0.60 % Positive unorientable unit clauses: 2
% 0.28/0.60 % Negative unit clauses : 8
% 0.28/0.60 % Non-unit-clauses : 58
% 0.28/0.60 % Current number of unprocessed clauses: 144
% 0.28/0.60 % ...number of literals in the above : 364
% 0.28/0.60 % Current number of archived formulas : 0
% 0.28/0.60 % Current number of archived clauses : 18
% 0.28/0.60 % Clause-clause subsumption calls (NU) : 736
% 0.28/0.60 % Rec. Clause-clause subsumption calls : 673
% 0.28/0.60 % Non-unit clause-clause subsumptions : 14
% 0.28/0.60 % Unit Clause-clause subsumption calls : 153
% 0.28/0.60 % Rewrite failures with RHS unbound : 0
% 0.28/0.60 % BW rewrite match attempts : 28
% 0.28/0.60 % BW rewrite match successes : 22
% 0.28/0.60 % Condensation attempts : 0
% 0.28/0.60 % Condensation successes : 0
% 0.28/0.60 % Termbank termtop insertions : 6666
% 0.28/0.60 % Search garbage collected termcells : 637
% 0.28/0.60
% 0.28/0.60 % -------------------------------------------------
% 0.28/0.60 % User time : 0.021 s
% 0.28/0.60 % System time : 0.003 s
% 0.28/0.60 % Total time : 0.024 s
% 0.28/0.60 % Maximum resident set size: 3672 pages
% 0.28/0.60
% 0.28/0.60 % -------------------------------------------------
% 0.28/0.60 % User time : 0.133 s
% 0.28/0.60 % System time : 0.022 s
% 0.28/0.60 % Total time : 0.156 s
% 0.28/0.60 % Maximum resident set size: 4608 pages
% 0.28/0.60 % E exiting
%------------------------------------------------------------------------------