%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : SEU411+3 : TPTP v9.3.1. Released v3.4.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:29:18 PM UTC 2026
% Result : Theorem 84.07s 13.82s
% Output : CNFRefutation 84.07s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 4
% Syntax : Number of formulae : 28 ( 16 unt; 0 def)
% Number of atoms : 153 ( 11 equ)
% Maximal formula atoms : 20 ( 5 avg)
% Number of connectives : 171 ( 46 ~; 31 |; 79 &)
% ( 2 <=>; 13 =>; 0 <=; 0 <~>)
% Maximal formula depth : 20 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 14 ( 12 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 2 con; 0-3 aty)
% Number of variables : 39 ( 2 sgn 28 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t20_latsum_1,conjecture,
! [X1] :
( ( l1_orders_2(X1)
& v1_lattice3(X1)
& v1_yellow_0(X1)
& v4_orders_2(X1)
& v3_orders_2(X1)
& v2_orders_2(X1)
& ~ v3_struct_0(X1) )
=> ! [X2] :
( ( l1_orders_2(X2)
& v1_lattice3(X2)
& v1_yellow_0(X2)
& v4_orders_2(X2)
& v3_orders_2(X2)
& v2_orders_2(X2)
& ~ v3_struct_0(X2) )
=> ( ( m1_subset_1(k3_xboole_0(u1_struct_0(X1),u1_struct_0(X2)),k1_zfmisc_1(u1_struct_0(X2)))
& v12_waybel_0(k3_xboole_0(u1_struct_0(X1),u1_struct_0(X2)),X2)
& v1_waybel_0(k3_xboole_0(u1_struct_0(X1),u1_struct_0(X2)),X2)
& ~ v1_xboole_0(k3_xboole_0(u1_struct_0(X1),u1_struct_0(X2))) )
=> r2_hidden(k3_yellow_0(X2),u1_struct_0(X1)) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t20_latsum_1) ).
fof(t10_waybel12,axiom,
! [X1] :
( ( l1_orders_2(X1)
& v1_yellow_0(X1)
& v4_orders_2(X1)
& ~ v3_struct_0(X1) )
=> ! [X2] :
( ( m1_subset_1(X2,k1_zfmisc_1(u1_struct_0(X1)))
& v12_waybel_0(X2,X1)
& ~ v1_xboole_0(X2) )
=> r2_hidden(k3_yellow_0(X1),X2) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET007/SET007+506.ax',t10_waybel12) ).
fof(commutativity_k3_xboole_0,axiom,
! [X1,X2] : k3_xboole_0(X1,X2) = k3_xboole_0(X2,X1),
file('/export/starexec/sandbox/benchmark/Axioms/SET007/SET007+2.ax',commutativity_k3_xboole_0) ).
fof(d3_xboole_0,axiom,
! [X1,X2,X3] :
( X3 = k3_xboole_0(X1,X2)
<=> ! [X4] :
( r2_hidden(X4,X3)
<=> ( r2_hidden(X4,X2)
& r2_hidden(X4,X1) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET007/SET007+2.ax',d3_xboole_0) ).
fof(c_0_4,negated_conjecture,
~ ! [X1] :
( ( l1_orders_2(X1)
& v1_lattice3(X1)
& v1_yellow_0(X1)
& v4_orders_2(X1)
& v3_orders_2(X1)
& v2_orders_2(X1)
& ~ v3_struct_0(X1) )
=> ! [X2] :
( ( l1_orders_2(X2)
& v1_lattice3(X2)
& v1_yellow_0(X2)
& v4_orders_2(X2)
& v3_orders_2(X2)
& v2_orders_2(X2)
& ~ v3_struct_0(X2) )
=> ( ( m1_subset_1(k3_xboole_0(u1_struct_0(X1),u1_struct_0(X2)),k1_zfmisc_1(u1_struct_0(X2)))
& v12_waybel_0(k3_xboole_0(u1_struct_0(X1),u1_struct_0(X2)),X2)
& v1_waybel_0(k3_xboole_0(u1_struct_0(X1),u1_struct_0(X2)),X2)
& ~ v1_xboole_0(k3_xboole_0(u1_struct_0(X1),u1_struct_0(X2))) )
=> r2_hidden(k3_yellow_0(X2),u1_struct_0(X1)) ) ) ),
inference(assume_negation,[status(cth)],[t20_latsum_1]) ).
fof(c_0_5,negated_conjecture,
~ ! [X1] :
( ( l1_orders_2(X1)
& v1_lattice3(X1)
& v1_yellow_0(X1)
& v4_orders_2(X1)
& v3_orders_2(X1)
& v2_orders_2(X1)
& ~ v3_struct_0(X1) )
=> ! [X2] :
( ( l1_orders_2(X2)
& v1_lattice3(X2)
& v1_yellow_0(X2)
& v4_orders_2(X2)
& v3_orders_2(X2)
& v2_orders_2(X2)
& ~ v3_struct_0(X2) )
=> ( ( m1_subset_1(k3_xboole_0(u1_struct_0(X1),u1_struct_0(X2)),k1_zfmisc_1(u1_struct_0(X2)))
& v12_waybel_0(k3_xboole_0(u1_struct_0(X1),u1_struct_0(X2)),X2)
& v1_waybel_0(k3_xboole_0(u1_struct_0(X1),u1_struct_0(X2)),X2)
& ~ v1_xboole_0(k3_xboole_0(u1_struct_0(X1),u1_struct_0(X2))) )
=> r2_hidden(k3_yellow_0(X2),u1_struct_0(X1)) ) ) ),
inference(fof_simplification,[status(thm)],[c_0_4]) ).
fof(c_0_6,plain,
! [X1] :
( ( l1_orders_2(X1)
& v1_yellow_0(X1)
& v4_orders_2(X1)
& ~ v3_struct_0(X1) )
=> ! [X2] :
( ( m1_subset_1(X2,k1_zfmisc_1(u1_struct_0(X1)))
& v12_waybel_0(X2,X1)
& ~ v1_xboole_0(X2) )
=> r2_hidden(k3_yellow_0(X1),X2) ) ),
inference(fof_simplification,[status(thm)],[t10_waybel12]) ).
fof(c_0_7,negated_conjecture,
( ~ r2_hidden(k3_yellow_0(esk2_0),u1_struct_0(esk1_0))
& m1_subset_1(k3_xboole_0(u1_struct_0(esk1_0),u1_struct_0(esk2_0)),k1_zfmisc_1(u1_struct_0(esk2_0)))
& v12_waybel_0(k3_xboole_0(u1_struct_0(esk1_0),u1_struct_0(esk2_0)),esk2_0)
& v1_waybel_0(k3_xboole_0(u1_struct_0(esk1_0),u1_struct_0(esk2_0)),esk2_0)
& ~ v1_xboole_0(k3_xboole_0(u1_struct_0(esk1_0),u1_struct_0(esk2_0)))
& l1_orders_2(esk2_0)
& v1_lattice3(esk2_0)
& v1_yellow_0(esk2_0)
& v4_orders_2(esk2_0)
& v3_orders_2(esk2_0)
& v2_orders_2(esk2_0)
& ~ v3_struct_0(esk2_0)
& l1_orders_2(esk1_0)
& v1_lattice3(esk1_0)
& v1_yellow_0(esk1_0)
& v4_orders_2(esk1_0)
& v3_orders_2(esk1_0)
& v2_orders_2(esk1_0)
& ~ v3_struct_0(esk1_0) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])])]) ).
fof(c_0_8,plain,
! [X135,X136] : k3_xboole_0(X135,X136) = k3_xboole_0(X136,X135),
inference(variable_rename,[status(thm)],[commutativity_k3_xboole_0]) ).
fof(c_0_9,plain,
! [X118,X119,X120,X121,X122,X123,X124,X125] :
( ( X125 = k3_xboole_0(X123,X124)
| r2_hidden(esk11_3(X123,X124,X125),X125)
| r2_hidden(esk11_3(X123,X124,X125),X124) )
& ( X125 = k3_xboole_0(X123,X124)
| r2_hidden(esk11_3(X123,X124,X125),X125)
| r2_hidden(esk11_3(X123,X124,X125),X123) )
& ( X125 = k3_xboole_0(X123,X124)
| ~ r2_hidden(esk11_3(X123,X124,X125),X124)
| ~ r2_hidden(esk11_3(X123,X124,X125),X123)
| ~ r2_hidden(esk11_3(X123,X124,X125),X125) )
& ( X120 != k3_xboole_0(X118,X119)
| r2_hidden(X122,X120)
| ~ r2_hidden(X122,X119)
| ~ r2_hidden(X122,X118) )
& ( X120 != k3_xboole_0(X118,X119)
| ~ r2_hidden(X121,X120)
| r2_hidden(X121,X119) )
& ( X120 != k3_xboole_0(X118,X119)
| ~ r2_hidden(X121,X120)
| r2_hidden(X121,X118) ) ),
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_10,plain,
! [X104,X105] :
( r2_hidden(k3_yellow_0(X104),X105)
| ~ m1_subset_1(X105,k1_zfmisc_1(u1_struct_0(X104)))
| ~ v12_waybel_0(X105,X104)
| v1_xboole_0(X105)
| ~ l1_orders_2(X104)
| ~ v1_yellow_0(X104)
| ~ v4_orders_2(X104)
| v3_struct_0(X104) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])])]) ).
cnf(c_0_11,negated_conjecture,
v12_waybel_0(k3_xboole_0(u1_struct_0(esk1_0),u1_struct_0(esk2_0)),esk2_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_12,plain,
k3_xboole_0(X1,X2) = k3_xboole_0(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,negated_conjecture,
m1_subset_1(k3_xboole_0(u1_struct_0(esk1_0),u1_struct_0(esk2_0)),k1_zfmisc_1(u1_struct_0(esk2_0))),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_14,negated_conjecture,
~ v1_xboole_0(k3_xboole_0(u1_struct_0(esk1_0),u1_struct_0(esk2_0))),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_15,plain,
( X3 != k3_xboole_0(X4,X2)
| ~ r2_hidden(X1,X3)
| r2_hidden(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_16,plain,
( ~ m1_subset_1(X2,k1_zfmisc_1(u1_struct_0(X1)))
| ~ v12_waybel_0(X2,X1)
| ~ l1_orders_2(X1)
| ~ v1_yellow_0(X1)
| ~ v4_orders_2(X1)
| r2_hidden(k3_yellow_0(X1),X2)
| v1_xboole_0(X2)
| v3_struct_0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_17,negated_conjecture,
v12_waybel_0(k3_xboole_0(u1_struct_0(esk2_0),u1_struct_0(esk1_0)),esk2_0),
inference(rw,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_18,negated_conjecture,
v1_yellow_0(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_19,negated_conjecture,
v4_orders_2(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_20,negated_conjecture,
l1_orders_2(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_21,negated_conjecture,
m1_subset_1(k3_xboole_0(u1_struct_0(esk2_0),u1_struct_0(esk1_0)),k1_zfmisc_1(u1_struct_0(esk2_0))),
inference(rw,[status(thm)],[c_0_13,c_0_12]) ).
cnf(c_0_22,negated_conjecture,
~ v3_struct_0(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_23,negated_conjecture,
~ v1_xboole_0(k3_xboole_0(u1_struct_0(esk2_0),u1_struct_0(esk1_0))),
inference(rw,[status(thm)],[c_0_14,c_0_12]) ).
cnf(c_0_24,plain,
( ~ r2_hidden(X1,k3_xboole_0(X3,X2))
| r2_hidden(X1,X2) ),
inference(er,[status(thm)],[c_0_15]) ).
cnf(c_0_25,negated_conjecture,
r2_hidden(k3_yellow_0(esk2_0),k3_xboole_0(u1_struct_0(esk2_0),u1_struct_0(esk1_0))),
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18]),c_0_19]),c_0_20]),c_0_21])]),c_0_22]),c_0_23]) ).
cnf(c_0_26,negated_conjecture,
~ r2_hidden(k3_yellow_0(esk2_0),u1_struct_0(esk1_0)),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_27,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_26]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SEU411+3 : TPTP v9.3.1. Released v3.4.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.36 % Computer : n011.cluster.edu
% 0.09/0.36 % Model : x86_64 x86_64
% 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36 % Memory : 8046.5625MB
% 0.09/0.36 % OS : Linux 6.8.0-71-generic
% 0.09/0.36 % CPULimit : 300
% 0.09/0.37 % WCLimit : 300
% 0.09/0.37 % DateTime : Mon Sep 21 06:22:29 UTC 2026
% 0.09/0.37 % CPUTime :
% 0.09/0.37 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.41 Running first-order theorem proving
% 0.09/0.41 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
% 84.07/13.82 % Version: 3.5.1
% 84.07/13.82 % Preprocessing class: FMLLMMLLSSSNFFN.
% 84.07/13.82 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 84.07/13.82 % Starting new_bool_3 with 900s (3) cores
% 84.07/13.82 % Starting new_bool_1 with 900s (3) cores
% 84.07/13.82 % Starting sh5l with 300s (1) cores
% 84.07/13.82 % Starting G-E--_211_C18_F1_AE_CS_SP_S0Y with 300s (1) cores
% 84.07/13.82 % new_bool_3 with pid 1167816 completed with status 0
% 84.07/13.82 % Result found by new_bool_3
% 84.07/13.82 % Preprocessing class: FMLLMMLLSSSNFFN.
% 84.07/13.82 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 84.07/13.82 % Starting new_bool_3 with 900s (3) cores
% 84.07/13.82 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 84.07/13.82 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 84.07/13.82 % Search class: FGHSM-SMLM32-MFFFFFNN
% 84.07/13.82 % Scheduled 13 strats onto 3 cores with 900 seconds (900 total)
% 84.07/13.82 % Starting SubtermCWHack with 82s (1) cores
% 84.07/13.82 % Starting new_bool_3 with 91s (1) cores
% 84.07/13.82 % Starting C12_02_nc_SAT001_MinMin_p005000_rr with 68s (1) cores
% 84.07/13.82 % new_bool_3 with pid 1167824 completed with status 0
% 84.07/13.82 % Result found by new_bool_3
% 84.07/13.82 % Preprocessing class: FMLLMMLLSSSNFFN.
% 84.07/13.82 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 84.07/13.82 % Starting new_bool_3 with 900s (3) cores
% 84.07/13.82 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 84.07/13.82 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 84.07/13.82 % Search class: FGHSM-SMLM32-MFFFFFNN
% 84.07/13.82 % Scheduled 13 strats onto 3 cores with 900 seconds (900 total)
% 84.07/13.82 % Starting SubtermCWHack with 82s (1) cores
% 84.07/13.82 % Starting new_bool_3 with 91s (1) cores
% 84.07/13.82 % Preprocessing time : 0.148 s
% 84.07/13.82 % Presaturation interreduction done
% 84.07/13.82
% 84.07/13.82 % Proof found!
% 84.07/13.82 % SZS status Theorem
% 84.07/13.82 % SZS output start CNFRefutation
% See solution above
% 84.07/13.82 % Parsed axioms : 19046
% 84.07/13.82 % Removed by relevancy pruning/SinE : 17025
% 84.07/13.82 % Initial clauses : 5051
% 84.07/13.82 % Removed in clause preprocessing : 142
% 84.07/13.82 % Initial clauses in saturation : 4909
% 84.07/13.82 % Processed clauses : 21721
% 84.07/13.82 % ...of these trivial : 281
% 84.07/13.82 % ...subsumed : 11317
% 84.07/13.82 % ...remaining for further processing : 10123
% 84.07/13.82 % Other redundant clauses eliminated : 648
% 84.07/13.82 % Clauses deleted for lack of memory : 0
% 84.07/13.82 % Backward-subsumed : 39
% 84.07/13.82 % Backward-rewritten : 163
% 84.07/13.82 % Generated clauses : 74636
% 84.07/13.82 % ...of the previous two non-redundant : 62487
% 84.07/13.82 % ...aggressively subsumed : 0
% 84.07/13.82 % Contextual simplify-reflections : 364
% 84.07/13.82 % Paramodulations : 73995
% 84.07/13.82 % Factorizations : 3
% 84.07/13.82 % NegExts : 0
% 84.07/13.82 % Equation resolutions : 655
% 84.07/13.82 % Disequality decompositions : 0
% 84.07/13.82 % Total rewrite steps : 24504
% 84.07/13.82 % ...of those cached : 21249
% 84.07/13.82 % Propositional unsat checks : 2
% 84.07/13.82 % Propositional check models : 1
% 84.07/13.82 % Propositional check unsatisfiable : 0
% 84.07/13.82 % Propositional clauses : 0
% 84.07/13.82 % Propositional clauses after purity: 0
% 84.07/13.82 % Propositional unsat core size : 0
% 84.07/13.82 % Propositional preprocessing time : 0.000
% 84.07/13.82 % Propositional encoding time : 0.174
% 84.07/13.82 % Propositional solver time : 0.218
% 84.07/13.82 % Success case prop preproc time : 0.000
% 84.07/13.82 % Success case prop encoding time : 0.000
% 84.07/13.82 % Success case prop solver time : 0.000
% 84.07/13.82 % Current number of processed clauses : 5233
% 84.07/13.82 % Positive orientable unit clauses : 1305
% 84.07/13.82 % Positive unorientable unit clauses: 3
% 84.07/13.82 % Negative unit clauses : 1457
% 84.07/13.82 % Non-unit-clauses : 2468
% 84.07/13.82 % Current number of unprocessed clauses: 49780
% 84.07/13.82 % ...number of literals in the above : 149327
% 84.07/13.82 % Current number of archived formulas : 0
% 84.07/13.82 % Current number of archived clauses : 4599
% 84.07/13.82 % Clause-clause subsumption calls (NU) : 13631254
% 84.07/13.82 % Rec. Clause-clause subsumption calls : 1349795
% 84.07/13.82 % Non-unit clause-clause subsumptions : 2215
% 84.07/13.82 % Unit Clause-clause subsumption calls : 452190
% 84.07/13.82 % Rewrite failures with RHS unbound : 0
% 84.07/13.82 % BW rewrite match attempts : 503
% 84.07/13.82 % BW rewrite match successes : 246
% 84.07/13.82 % Condensation attempts : 0
% 84.07/13.82 % Condensation successes : 0
% 84.07/13.82 % Termbank termtop insertions : 2068498
% 84.07/13.82 % Search garbage collected termcells : 255235
% 84.07/13.82
% 84.07/13.82 % -------------------------------------------------
% 84.07/13.82 % User time : 11.860 s
% 84.07/13.82 % System time : 0.257 s
% 84.07/13.82 % Total time : 12.117 s
% 84.07/13.82 % Maximum resident set size: 46644 pages
% 84.07/13.82
% 84.07/13.82 % -------------------------------------------------
% 84.07/13.82 % User time : 34.699 s
% 84.07/13.82 % System time : 0.721 s
% 84.07/13.82 % Total time : 35.420 s
% 84.07/13.82 % Maximum resident set size: 33024 pages
% 84.07/13.82 % E exiting
%------------------------------------------------------------------------------