%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SEU413+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 : n013.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:02 PM UTC 2026
% Result : Theorem 0.27s 0.63s
% Output : CNFRefutation 0.27s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 4
% Syntax : Number of formulae : 24 ( 10 unt; 0 def)
% Number of atoms : 105 ( 0 equ)
% Maximal formula atoms : 10 ( 4 avg)
% Number of connectives : 126 ( 45 ~; 42 |; 21 &)
% ( 1 <=>; 17 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 6 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 7 ( 6 usr; 1 prp; 0-3 aty)
% Number of functors : 10 ( 10 usr; 4 con; 0-2 aty)
% Number of variables : 41 ( 0 sgn 26 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t21_latsum_1,axiom,
! [X1] :
( l1_orders_2(X1)
=> ! [X2] :
( l1_orders_2(X2)
=> ! [X3,X4] :
( ( r2_hidden(X4,u1_struct_0(X1))
& r2_hidden(k4_tarski(X3,X4),u1_orders_2(k1_latsum_1(X1,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) )
=> r2_hidden(X3,u1_struct_0(X1)) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t21_latsum_1) ).
fof(d9_orders_2,axiom,
! [X1] :
( l1_orders_2(X1)
=> ! [X2] :
( m1_subset_1(X2,u1_struct_0(X1))
=> ! [X3] :
( m1_subset_1(X3,u1_struct_0(X1))
=> ( r1_orders_2(X1,X2,X3)
<=> r2_hidden(k4_tarski(X2,X3),u1_orders_2(X1)) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d9_orders_2) ).
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(t23_latsum_1,conjecture,
! [X1] :
( l1_orders_2(X1)
=> ! [X2] :
( l1_orders_2(X2)
=> ! [X3] :
( m1_subset_1(X3,u1_struct_0(k1_latsum_1(X1,X2)))
=> ! [X4] :
( m1_subset_1(X4,u1_struct_0(k1_latsum_1(X1,X2)))
=> ( ( r2_hidden(X4,u1_struct_0(X1))
& r1_orders_2(k1_latsum_1(X1,X2),X3,X4)
& 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) )
=> r2_hidden(X3,u1_struct_0(X1)) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t23_latsum_1) ).
fof(c_0_4,plain,
! [X52,X53,X54,X55] :
( r2_hidden(X54,u1_struct_0(X52))
| ~ r2_hidden(X55,u1_struct_0(X52))
| ~ r2_hidden(k4_tarski(X54,X55),u1_orders_2(k1_latsum_1(X52,X53)))
| ~ m1_subset_1(k3_xboole_0(u1_struct_0(X52),u1_struct_0(X53)),k1_zfmisc_1(u1_struct_0(X53)))
| ~ v12_waybel_0(k3_xboole_0(u1_struct_0(X52),u1_struct_0(X53)),X53)
| ~ l1_orders_2(X53)
| ~ l1_orders_2(X52) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t21_latsum_1])])])]) ).
fof(c_0_5,plain,
! [X17,X18,X19] :
( ( ~ l1_orders_2(X17)
| ~ m1_subset_1(X18,u1_struct_0(X17))
| ~ m1_subset_1(X19,u1_struct_0(X17))
| r1_orders_2(X17,X18,X19)
| ~ r2_hidden(k4_tarski(X18,X19),u1_orders_2(X17)) )
& ( ~ l1_orders_2(X17)
| ~ m1_subset_1(X18,u1_struct_0(X17))
| ~ m1_subset_1(X19,u1_struct_0(X17))
| r2_hidden(k4_tarski(X18,X19),u1_orders_2(X17))
| ~ r1_orders_2(X17,X18,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)],[d9_orders_2])])])])]) ).
fof(c_0_6,plain,
! [X22,X23] :
( ( ~ l1_orders_2(X23)
| ~ l1_orders_2(X22)
| l1_orders_2(k1_latsum_1(X22,X23)) )
& ( ~ l1_orders_2(X23)
| ~ l1_orders_2(X22)
| v1_orders_2(k1_latsum_1(X22,X23)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[dt_k1_latsum_1])])])]) ).
fof(c_0_7,negated_conjecture,
~ ! [X1] :
( l1_orders_2(X1)
=> ! [X2] :
( l1_orders_2(X2)
=> ! [X3] :
( m1_subset_1(X3,u1_struct_0(k1_latsum_1(X1,X2)))
=> ! [X4] :
( m1_subset_1(X4,u1_struct_0(k1_latsum_1(X1,X2)))
=> ( ( r2_hidden(X4,u1_struct_0(X1))
& r1_orders_2(k1_latsum_1(X1,X2),X3,X4)
& 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) )
=> r2_hidden(X3,u1_struct_0(X1)) ) ) ) ) ),
inference(assume_negation,[status(cth)],[t23_latsum_1]) ).
cnf(c_0_8,plain,
( ~ r2_hidden(X4,u1_struct_0(X1))
| ~ r2_hidden(k4_tarski(X3,X4),u1_orders_2(k1_latsum_1(X1,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)
| ~ l1_orders_2(X2)
| ~ l1_orders_2(X1)
| r2_hidden(X3,u1_struct_0(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_9,plain,
( ~ l1_orders_2(X1)
| ~ m1_subset_1(X2,u1_struct_0(X1))
| ~ m1_subset_1(X3,u1_struct_0(X1))
| ~ r1_orders_2(X1,X2,X3)
| r2_hidden(k4_tarski(X2,X3),u1_orders_2(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_10,plain,
( ~ l1_orders_2(X2)
| ~ l1_orders_2(X1)
| l1_orders_2(k1_latsum_1(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
fof(c_0_11,negated_conjecture,
( ~ r2_hidden(esk3_0,u1_struct_0(esk1_0))
& r2_hidden(esk4_0,u1_struct_0(esk1_0))
& r1_orders_2(k1_latsum_1(esk1_0,esk2_0),esk3_0,esk4_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)
& m1_subset_1(esk4_0,u1_struct_0(k1_latsum_1(esk1_0,esk2_0)))
& m1_subset_1(esk3_0,u1_struct_0(k1_latsum_1(esk1_0,esk2_0)))
& l1_orders_2(esk2_0)
& l1_orders_2(esk1_0) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])])]) ).
cnf(c_0_12,plain,
( ~ l1_orders_2(X2)
| ~ l1_orders_2(X4)
| ~ m1_subset_1(X1,u1_struct_0(k1_latsum_1(X2,X4)))
| ~ m1_subset_1(X3,u1_struct_0(k1_latsum_1(X2,X4)))
| ~ m1_subset_1(k3_xboole_0(u1_struct_0(X2),u1_struct_0(X4)),k1_zfmisc_1(u1_struct_0(X4)))
| ~ v12_waybel_0(k3_xboole_0(u1_struct_0(X2),u1_struct_0(X4)),X4)
| ~ r1_orders_2(k1_latsum_1(X2,X4),X1,X3)
| ~ r2_hidden(X3,u1_struct_0(X2))
| r2_hidden(X1,u1_struct_0(X2)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_9]),c_0_10]) ).
cnf(c_0_13,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_11]) ).
cnf(c_0_14,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_11]) ).
cnf(c_0_15,negated_conjecture,
l1_orders_2(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_16,negated_conjecture,
l1_orders_2(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_17,negated_conjecture,
( ~ m1_subset_1(X1,u1_struct_0(k1_latsum_1(esk1_0,esk2_0)))
| ~ m1_subset_1(X2,u1_struct_0(k1_latsum_1(esk1_0,esk2_0)))
| ~ r1_orders_2(k1_latsum_1(esk1_0,esk2_0),X1,X2)
| ~ r2_hidden(X2,u1_struct_0(esk1_0))
| r2_hidden(X1,u1_struct_0(esk1_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14]),c_0_15]),c_0_16])]) ).
cnf(c_0_18,negated_conjecture,
r1_orders_2(k1_latsum_1(esk1_0,esk2_0),esk3_0,esk4_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_19,negated_conjecture,
r2_hidden(esk4_0,u1_struct_0(esk1_0)),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_20,negated_conjecture,
m1_subset_1(esk4_0,u1_struct_0(k1_latsum_1(esk1_0,esk2_0))),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_21,negated_conjecture,
m1_subset_1(esk3_0,u1_struct_0(k1_latsum_1(esk1_0,esk2_0))),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_22,negated_conjecture,
~ r2_hidden(esk3_0,u1_struct_0(esk1_0)),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_23,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_17,c_0_18]),c_0_19]),c_0_20]),c_0_21])]),c_0_22]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU413+1 : TPTP v9.3.1. Released v3.4.0.
% 0.00/0.06 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.17/0.43 % Computer : n013.cluster.edu
% 0.17/0.43 % Model : x86_64 x86_64
% 0.17/0.43 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.43 % Memory : 8046.5625MB
% 0.17/0.43 % OS : Linux 6.8.0-71-generic
% 0.17/0.43 % CPULimit : 300
% 0.17/0.43 % WCLimit : 300
% 0.17/0.43 % DateTime : Mon Sep 21 06:22:06 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.27/0.63 % Version: 3.5.1
% 0.27/0.63 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.27/0.63 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.27/0.63 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.27/0.63 % Starting new_bool_3 with 300s (1) cores
% 0.27/0.63 % Starting new_bool_1 with 300s (1) cores
% 0.27/0.63 % Starting sh5l with 300s (1) cores
% 0.27/0.63 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 118728 completed with status 0
% 0.27/0.63 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.27/0.63 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.27/0.63 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.27/0.63 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.27/0.63 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.27/0.63 % No SInE strategy applied
% 0.27/0.63 % Search class: FGHSM-FFMM21-SFFFFFNN
% 0.27/0.63 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.27/0.63 % Starting SubtermCWHack with 136s (1) cores
% 0.27/0.63 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.27/0.63 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04AN with 136s (1) cores
% 0.27/0.63 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y with 136s (1) cores
% 0.27/0.63 % Starting G-E--_208_C09_12_F1_SE_CS_SP_PS_S5PRR_S04AN with 136s (1) cores
% 0.27/0.63 % G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y with pid 118738 completed with status 0
% 0.27/0.63 % Result found by G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y
% 0.27/0.63 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.27/0.63 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.27/0.63 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.27/0.63 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.27/0.63 % No SInE strategy applied
% 0.27/0.63 % Search class: FGHSM-FFMM21-SFFFFFNN
% 0.27/0.63 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.27/0.63 % Starting SubtermCWHack with 136s (1) cores
% 0.27/0.63 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.27/0.63 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04AN with 136s (1) cores
% 0.27/0.63 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y with 136s (1) cores
% 0.27/0.63 % Preprocessing time : 0.006 s
% 0.27/0.63
% 0.27/0.63 % Proof found!
% 0.27/0.63 % SZS status Theorem
% 0.27/0.63 % SZS output start CNFRefutation
% See solution above
% 0.27/0.63 % Parsed axioms : 42
% 0.27/0.63 % Removed by relevancy pruning/SinE : 0
% 0.27/0.63 % Initial clauses : 56
% 0.27/0.63 % Removed in clause preprocessing : 9
% 0.27/0.63 % Initial clauses in saturation : 47
% 0.27/0.63 % Processed clauses : 181
% 0.27/0.63 % ...of these trivial : 1
% 0.27/0.63 % ...subsumed : 38
% 0.27/0.63 % ...remaining for further processing : 142
% 0.27/0.63 % Other redundant clauses eliminated : 2
% 0.27/0.63 % Clauses deleted for lack of memory : 0
% 0.27/0.63 % Backward-subsumed : 4
% 0.27/0.63 % Backward-rewritten : 1
% 0.27/0.63 % Generated clauses : 291
% 0.27/0.63 % ...of the previous two non-redundant : 242
% 0.27/0.63 % ...aggressively subsumed : 0
% 0.27/0.63 % Contextual simplify-reflections : 2
% 0.27/0.63 % Paramodulations : 277
% 0.27/0.63 % Factorizations : 4
% 0.27/0.63 % NegExts : 0
% 0.27/0.63 % Equation resolutions : 10
% 0.27/0.63 % Disequality decompositions : 0
% 0.27/0.63 % Total rewrite steps : 39
% 0.27/0.63 % ...of those cached : 22
% 0.27/0.63 % Propositional unsat checks : 0
% 0.27/0.63 % Propositional check models : 0
% 0.27/0.63 % Propositional check unsatisfiable : 0
% 0.27/0.63 % Propositional clauses : 0
% 0.27/0.63 % Propositional clauses after purity: 0
% 0.27/0.63 % Propositional unsat core size : 0
% 0.27/0.63 % Propositional preprocessing time : 0.000
% 0.27/0.63 % Propositional encoding time : 0.000
% 0.27/0.63 % Propositional solver time : 0.000
% 0.27/0.63 % Success case prop preproc time : 0.000
% 0.27/0.63 % Success case prop encoding time : 0.000
% 0.27/0.63 % Success case prop solver time : 0.000
% 0.27/0.63 % Current number of processed clauses : 137
% 0.27/0.63 % Positive orientable unit clauses : 30
% 0.27/0.63 % Positive unorientable unit clauses: 1
% 0.27/0.63 % Negative unit clauses : 4
% 0.27/0.63 % Non-unit-clauses : 102
% 0.27/0.63 % Current number of unprocessed clauses: 104
% 0.27/0.63 % ...number of literals in the above : 407
% 0.27/0.63 % Current number of archived formulas : 0
% 0.27/0.63 % Current number of archived clauses : 5
% 0.27/0.63 % Clause-clause subsumption calls (NU) : 1926
% 0.27/0.63 % Rec. Clause-clause subsumption calls : 1002
% 0.27/0.63 % Non-unit clause-clause subsumptions : 44
% 0.27/0.63 % Unit Clause-clause subsumption calls : 135
% 0.27/0.63 % Rewrite failures with RHS unbound : 0
% 0.27/0.63 % BW rewrite match attempts : 14
% 0.27/0.63 % BW rewrite match successes : 7
% 0.27/0.63 % Condensation attempts : 0
% 0.27/0.63 % Condensation successes : 0
% 0.27/0.63 % Termbank termtop insertions : 6854
% 0.27/0.63 % Search garbage collected termcells : 561
% 0.27/0.63
% 0.27/0.63 % -------------------------------------------------
% 0.27/0.63 % User time : 0.034 s
% 0.27/0.63 % System time : 0.008 s
% 0.27/0.63 % Total time : 0.042 s
% 0.27/0.63 % Maximum resident set size: 3668 pages
% 0.27/0.63
% 0.27/0.63 % -------------------------------------------------
% 0.27/0.63 % User time : 0.219 s
% 0.27/0.63 % System time : 0.034 s
% 0.27/0.63 % Total time : 0.253 s
% 0.27/0.63 % Maximum resident set size: 4864 pages
% 0.27/0.63 % E exiting
%------------------------------------------------------------------------------