%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SEU408+1 : 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 : n003.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:25:00 PM UTC 2026
% Result : Theorem 0.23s 0.60s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 6
% Syntax : Number of formulae : 29 ( 10 unt; 0 def)
% Number of atoms : 152 ( 24 equ)
% Maximal formula atoms : 20 ( 5 avg)
% Number of connectives : 183 ( 60 ~; 51 |; 55 &)
% ( 3 <=>; 14 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 6 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 11 ( 9 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 3 con; 0-6 aty)
% Number of variables : 59 ( 2 sgn 39 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t11_latsum_1,conjecture,
! [X1] :
( ( l1_orders_2(X1)
& v1_lattice3(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)
& v4_orders_2(X2)
& v3_orders_2(X2)
& v2_orders_2(X2)
& ~ v3_struct_0(X2) )
=> ! [X3] :
( r2_hidden(X3,u1_struct_0(X2))
=> m1_subset_1(X3,u1_struct_0(k1_latsum_1(X1,X2))) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t11_latsum_1) ).
fof(t1_subset,axiom,
! [X1,X2] :
( r2_hidden(X1,X2)
=> m1_subset_1(X1,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t1_subset) ).
fof(d2_latsum_1,axiom,
! [X1] :
( l1_orders_2(X1)
=> ! [X2] :
( l1_orders_2(X2)
=> ! [X3] :
( ( l1_orders_2(X3)
& v1_orders_2(X3) )
=> ( X3 = k1_latsum_1(X1,X2)
<=> ( u1_orders_2(X3) = k2_xboole_0(k2_xboole_0(u1_orders_2(X1),u1_orders_2(X2)),k7_relset_1(u1_struct_0(X1),u1_struct_0(X1),u1_struct_0(X2),u1_struct_0(X2),u1_orders_2(X1),u1_orders_2(X2)))
& u1_struct_0(X3) = k2_xboole_0(u1_struct_0(X1),u1_struct_0(X2)) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d2_latsum_1) ).
fof(dt_k1_latsum_1,axiom,
! [X1,X2] :
( ( l1_orders_2(X2)
& l1_orders_2(X1) )
=> ( l1_orders_2(k1_latsum_1(X1,X2))
& v1_orders_2(k1_latsum_1(X1,X2)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',dt_k1_latsum_1) ).
fof(commutativity_k2_xboole_0,axiom,
! [X1,X2] : k2_xboole_0(X1,X2) = k2_xboole_0(X2,X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',commutativity_k2_xboole_0) ).
fof(d2_xboole_0,axiom,
! [X1,X2,X3] :
( X3 = k2_xboole_0(X1,X2)
<=> ! [X4] :
( r2_hidden(X4,X3)
<=> ( r2_hidden(X4,X2)
| r2_hidden(X4,X1) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d2_xboole_0) ).
fof(c_0_6,negated_conjecture,
~ ! [X1] :
( ( l1_orders_2(X1)
& v1_lattice3(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)
& v4_orders_2(X2)
& v3_orders_2(X2)
& v2_orders_2(X2)
& ~ v3_struct_0(X2) )
=> ! [X3] :
( r2_hidden(X3,u1_struct_0(X2))
=> m1_subset_1(X3,u1_struct_0(k1_latsum_1(X1,X2))) ) ) ),
inference(assume_negation,[status(cth)],[t11_latsum_1]) ).
fof(c_0_7,negated_conjecture,
~ ! [X1] :
( ( l1_orders_2(X1)
& v1_lattice3(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)
& v4_orders_2(X2)
& v3_orders_2(X2)
& v2_orders_2(X2)
& ~ v3_struct_0(X2) )
=> ! [X3] :
( r2_hidden(X3,u1_struct_0(X2))
=> m1_subset_1(X3,u1_struct_0(k1_latsum_1(X1,X2))) ) ) ),
inference(fof_simplification,[status(thm)],[c_0_6]) ).
fof(c_0_8,negated_conjecture,
( ~ m1_subset_1(esk3_0,u1_struct_0(k1_latsum_1(esk1_0,esk2_0)))
& r2_hidden(esk3_0,u1_struct_0(esk2_0))
& l1_orders_2(esk2_0)
& v1_lattice3(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)
& 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_7])])])]) ).
fof(c_0_9,plain,
! [X87,X88] :
( m1_subset_1(X87,X88)
| ~ r2_hidden(X87,X88) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t1_subset])])]) ).
fof(c_0_10,plain,
! [X18,X19,X20] :
( ( ~ l1_orders_2(X18)
| ~ l1_orders_2(X19)
| ~ l1_orders_2(X20)
| ~ v1_orders_2(X20)
| X20 = k1_latsum_1(X18,X19)
| u1_orders_2(X20) != k2_xboole_0(k2_xboole_0(u1_orders_2(X18),u1_orders_2(X19)),k7_relset_1(u1_struct_0(X18),u1_struct_0(X18),u1_struct_0(X19),u1_struct_0(X19),u1_orders_2(X18),u1_orders_2(X19)))
| u1_struct_0(X20) != k2_xboole_0(u1_struct_0(X18),u1_struct_0(X19)) )
& ( ~ l1_orders_2(X18)
| ~ l1_orders_2(X19)
| ~ l1_orders_2(X20)
| ~ v1_orders_2(X20)
| X20 != k1_latsum_1(X18,X19)
| u1_orders_2(X20) = k2_xboole_0(k2_xboole_0(u1_orders_2(X18),u1_orders_2(X19)),k7_relset_1(u1_struct_0(X18),u1_struct_0(X18),u1_struct_0(X19),u1_struct_0(X19),u1_orders_2(X18),u1_orders_2(X19))) )
& ( ~ l1_orders_2(X18)
| ~ l1_orders_2(X19)
| ~ l1_orders_2(X20)
| ~ v1_orders_2(X20)
| X20 != k1_latsum_1(X18,X19)
| u1_struct_0(X20) = k2_xboole_0(u1_struct_0(X18),u1_struct_0(X19)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d2_latsum_1])])])])]) ).
fof(c_0_11,plain,
! [X32,X33] :
( ( ~ l1_orders_2(X33)
| ~ l1_orders_2(X32)
| l1_orders_2(k1_latsum_1(X32,X33)) )
& ( ~ l1_orders_2(X33)
| ~ l1_orders_2(X32)
| v1_orders_2(k1_latsum_1(X32,X33)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[dt_k1_latsum_1])])])]) ).
cnf(c_0_12,negated_conjecture,
~ m1_subset_1(esk3_0,u1_struct_0(k1_latsum_1(esk1_0,esk2_0))),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,plain,
( ~ r2_hidden(X1,X2)
| m1_subset_1(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_14,plain,
( ~ l1_orders_2(X2)
| ~ l1_orders_2(X3)
| ~ l1_orders_2(X1)
| ~ v1_orders_2(X1)
| X1 != k1_latsum_1(X2,X3)
| u1_struct_0(X1) = k2_xboole_0(u1_struct_0(X2),u1_struct_0(X3)) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_15,plain,
( ~ l1_orders_2(X2)
| ~ l1_orders_2(X1)
| l1_orders_2(k1_latsum_1(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_16,plain,
( ~ l1_orders_2(X2)
| ~ l1_orders_2(X1)
| v1_orders_2(k1_latsum_1(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_17,plain,
! [X16,X17] : k2_xboole_0(X16,X17) = k2_xboole_0(X17,X16),
inference(variable_rename,[status(thm)],[commutativity_k2_xboole_0]) ).
fof(c_0_18,plain,
! [X21,X22,X23,X24,X25,X26,X27,X28] :
( ( X28 = k2_xboole_0(X26,X27)
| r2_hidden(esk4_3(X26,X27,X28),X27)
| r2_hidden(esk4_3(X26,X27,X28),X26)
| r2_hidden(esk4_3(X26,X27,X28),X28) )
& ( X28 = k2_xboole_0(X26,X27)
| ~ r2_hidden(esk4_3(X26,X27,X28),X28)
| ~ r2_hidden(esk4_3(X26,X27,X28),X27) )
& ( X28 = k2_xboole_0(X26,X27)
| ~ r2_hidden(esk4_3(X26,X27,X28),X28)
| ~ r2_hidden(esk4_3(X26,X27,X28),X26) )
& ( X23 != k2_xboole_0(X21,X22)
| r2_hidden(X25,X23)
| ~ r2_hidden(X25,X22) )
& ( X23 != k2_xboole_0(X21,X22)
| r2_hidden(X25,X23)
| ~ r2_hidden(X25,X21) )
& ( X23 != k2_xboole_0(X21,X22)
| r2_hidden(X24,X22)
| r2_hidden(X24,X21)
| ~ r2_hidden(X24,X23) ) ),
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)],[d2_xboole_0])])])])])])]) ).
cnf(c_0_19,negated_conjecture,
~ r2_hidden(esk3_0,u1_struct_0(k1_latsum_1(esk1_0,esk2_0))),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_20,plain,
( ~ l1_orders_2(X1)
| ~ l1_orders_2(X2)
| u1_struct_0(k1_latsum_1(X1,X2)) = k2_xboole_0(u1_struct_0(X1),u1_struct_0(X2)) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_14]),c_0_15]),c_0_16]) ).
cnf(c_0_21,negated_conjecture,
l1_orders_2(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_22,negated_conjecture,
l1_orders_2(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_23,plain,
k2_xboole_0(X1,X2) = k2_xboole_0(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_24,plain,
( X3 != k2_xboole_0(X2,X4)
| ~ r2_hidden(X1,X2)
| r2_hidden(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_25,negated_conjecture,
~ r2_hidden(esk3_0,k2_xboole_0(u1_struct_0(esk2_0),u1_struct_0(esk1_0))),
inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21]),c_0_22])]),c_0_23]) ).
cnf(c_0_26,plain,
( ~ r2_hidden(X1,X2)
| r2_hidden(X1,k2_xboole_0(X2,X3)) ),
inference(er,[status(thm)],[c_0_24]) ).
cnf(c_0_27,negated_conjecture,
r2_hidden(esk3_0,u1_struct_0(esk2_0)),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_28,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_27])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : SEU408+1 : TPTP v9.3.1. Released v3.4.0.
% 0.00/0.08 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.19/0.44 % Computer : n003.cluster.edu
% 0.19/0.44 % Model : x86_64 x86_64
% 0.19/0.44 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.19/0.44 % Memory : 8046.5625MB
% 0.19/0.44 % OS : Linux 6.8.0-71-generic
% 0.19/0.44 % CPULimit : 300
% 0.19/0.44 % WCLimit : 300
% 0.19/0.44 % DateTime : Mon Sep 21 06:22:46 UTC 2026
% 0.19/0.45 % CPUTime :
% 0.19/0.45 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.23/0.52 Running first-order theorem proving
% 0.23/0.52 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.23/0.60 % Version: 3.5.1
% 0.23/0.60 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.23/0.60 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.60 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.23/0.60 % Starting new_bool_3 with 300s (1) cores
% 0.23/0.60 % Starting new_bool_1 with 300s (1) cores
% 0.23/0.60 % Starting sh5l with 300s (1) cores
% 0.23/0.60 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 3597918 completed with status 0
% 0.23/0.60 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.23/0.60 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.23/0.60 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.60 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.23/0.60 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.23/0.60 % No SInE strategy applied
% 0.23/0.60 % Search class: FGHSM-FFMM32-MFFFFFNN
% 0.23/0.60 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.23/0.60 % Starting SubtermCWHack with 136s (1) cores
% 0.23/0.60 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.23/0.60 % Starting G-E--_300_C18_F1_URBAN_S0Y with 369s (1) cores
% 0.23/0.60 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04AN with 136s (1) cores
% 0.23/0.60 % Starting G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_S04BN with 136s (1) cores
% 0.23/0.60 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 3597926 completed with status 0
% 0.23/0.60 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.23/0.60 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.23/0.60 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.60 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.23/0.60 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.23/0.60 % No SInE strategy applied
% 0.23/0.60 % Search class: FGHSM-FFMM32-MFFFFFNN
% 0.23/0.60 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.23/0.60 % Starting SubtermCWHack with 136s (1) cores
% 0.23/0.60 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.23/0.60 % Preprocessing time : 0.002 s
% 0.23/0.60 % Presaturation interreduction done
% 0.23/0.60
% 0.23/0.60 % Proof found!
% 0.23/0.60 % SZS status Theorem
% 0.23/0.60 % SZS output start CNFRefutation
% See solution above
% 0.23/0.60 % Parsed axioms : 51
% 0.23/0.60 % Removed by relevancy pruning/SinE : 0
% 0.23/0.60 % Initial clauses : 80
% 0.23/0.60 % Removed in clause preprocessing : 8
% 0.23/0.60 % Initial clauses in saturation : 72
% 0.23/0.60 % Processed clauses : 178
% 0.23/0.60 % ...of these trivial : 1
% 0.23/0.60 % ...subsumed : 11
% 0.23/0.60 % ...remaining for further processing : 166
% 0.23/0.60 % Other redundant clauses eliminated : 5
% 0.23/0.60 % Clauses deleted for lack of memory : 0
% 0.23/0.60 % Backward-subsumed : 0
% 0.23/0.60 % Backward-rewritten : 1
% 0.23/0.60 % Generated clauses : 152
% 0.23/0.60 % ...of the previous two non-redundant : 124
% 0.23/0.60 % ...aggressively subsumed : 0
% 0.23/0.60 % Contextual simplify-reflections : 4
% 0.23/0.60 % Paramodulations : 141
% 0.23/0.60 % Factorizations : 6
% 0.23/0.60 % NegExts : 0
% 0.23/0.60 % Equation resolutions : 5
% 0.23/0.60 % Disequality decompositions : 0
% 0.23/0.60 % Total rewrite steps : 25
% 0.23/0.60 % ...of those cached : 11
% 0.23/0.60 % Propositional unsat checks : 0
% 0.23/0.60 % Propositional check models : 0
% 0.23/0.60 % Propositional check unsatisfiable : 0
% 0.23/0.60 % Propositional clauses : 0
% 0.23/0.60 % Propositional clauses after purity: 0
% 0.23/0.60 % Propositional unsat core size : 0
% 0.23/0.60 % Propositional preprocessing time : 0.000
% 0.23/0.60 % Propositional encoding time : 0.000
% 0.23/0.60 % Propositional solver time : 0.000
% 0.23/0.60 % Success case prop preproc time : 0.000
% 0.23/0.60 % Success case prop encoding time : 0.000
% 0.23/0.60 % Success case prop solver time : 0.000
% 0.23/0.60 % Current number of processed clauses : 90
% 0.23/0.60 % Positive orientable unit clauses : 26
% 0.23/0.60 % Positive unorientable unit clauses: 1
% 0.23/0.60 % Negative unit clauses : 11
% 0.23/0.60 % Non-unit-clauses : 52
% 0.23/0.60 % Current number of unprocessed clauses: 87
% 0.23/0.60 % ...number of literals in the above : 299
% 0.23/0.60 % Current number of archived formulas : 0
% 0.23/0.60 % Current number of archived clauses : 71
% 0.23/0.60 % Clause-clause subsumption calls (NU) : 973
% 0.23/0.60 % Rec. Clause-clause subsumption calls : 550
% 0.23/0.60 % Non-unit clause-clause subsumptions : 14
% 0.23/0.60 % Unit Clause-clause subsumption calls : 44
% 0.23/0.60 % Rewrite failures with RHS unbound : 0
% 0.23/0.60 % BW rewrite match attempts : 19
% 0.23/0.60 % BW rewrite match successes : 17
% 0.23/0.60 % Condensation attempts : 0
% 0.23/0.60 % Condensation successes : 0
% 0.23/0.60 % Termbank termtop insertions : 6726
% 0.23/0.60 % Search garbage collected termcells : 945
% 0.23/0.60
% 0.23/0.60 % -------------------------------------------------
% 0.23/0.60 % User time : 0.017 s
% 0.23/0.60 % System time : 0.002 s
% 0.23/0.60 % Total time : 0.019 s
% 0.23/0.60 % Maximum resident set size: 3940 pages
% 0.23/0.60
% 0.23/0.60 % -------------------------------------------------
% 0.23/0.60 % User time : 0.056 s
% 0.23/0.60 % System time : 0.020 s
% 0.23/0.60 % Total time : 0.076 s
% 0.23/0.60 % Maximum resident set size: 4864 pages
% 0.23/0.60 % E exiting
%------------------------------------------------------------------------------