%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWV399+1 : TPTP v9.3.1. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n014.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:54:39 PM UTC 2026
% Result : Theorem 0.10s 0.43s
% Output : CNFRefutation 0.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 6
% Syntax : Number of formulae : 32 ( 5 unt; 0 def)
% Number of atoms : 83 ( 0 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 84 ( 33 ~; 31 |; 13 &)
% ( 2 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 71 ( 0 sgn 38 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
fof(l35_co,conjecture,
! [X1] :
( ? [X2,X3] :
( strictly_less_than(X2,X3)
& pair_in_list(X1,X2,X3) )
=> ! [X4] :
? [X5,X6] :
( strictly_less_than(X5,X6)
& pair_in_list(update_slb(X1,X4),X5,X6) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l35_co) ).
fof(l35_li3839,lemma,
! [X1,X2,X3,X4] :
( ( strictly_less_than(X3,X4)
& pair_in_list(X1,X2,X3) )
=> pair_in_list(update_slb(X1,X4),X2,X4) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l35_li3839) ).
fof(stricly_smaller_definition,axiom,
! [X1,X2] :
( strictly_less_than(X1,X2)
<=> ( ~ less_than(X2,X1)
& less_than(X1,X2) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV007+0.ax',stricly_smaller_definition) ).
fof(totality,axiom,
! [X1,X2] :
( less_than(X2,X1)
| less_than(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV007+0.ax',totality) ).
fof(transitivity,axiom,
! [X1,X2,X3] :
( ( less_than(X2,X3)
& less_than(X1,X2) )
=> less_than(X1,X3) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV007+0.ax',transitivity) ).
fof(l35_li3637,lemma,
! [X1,X2,X3,X4] :
( ( less_than(X4,X3)
& pair_in_list(X1,X2,X3) )
=> pair_in_list(update_slb(X1,X4),X2,X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l35_li3637) ).
fof(c_0_6,negated_conjecture,
~ ! [X1] :
( ? [X2,X3] :
( strictly_less_than(X2,X3)
& pair_in_list(X1,X2,X3) )
=> ! [X4] :
? [X5,X6] :
( strictly_less_than(X5,X6)
& pair_in_list(update_slb(X1,X4),X5,X6) ) ),
inference(assume_negation,[status(cth)],[l35_co]) ).
fof(c_0_7,lemma,
! [X19,X20,X21,X22] :
( pair_in_list(update_slb(X19,X22),X20,X22)
| ~ strictly_less_than(X21,X22)
| ~ pair_in_list(X19,X20,X21) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[l35_li3839])])]) ).
fof(c_0_8,negated_conjecture,
! [X11,X12] :
( ( ~ strictly_less_than(X11,X12)
| ~ pair_in_list(update_slb(esk1_0,esk4_0),X11,X12) )
& strictly_less_than(esk2_0,esk3_0)
& pair_in_list(esk1_0,esk2_0,esk3_0) ),
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_6])])])])]) ).
fof(c_0_9,plain,
! [X1,X2] :
( strictly_less_than(X1,X2)
<=> ( ~ less_than(X2,X1)
& less_than(X1,X2) ) ),
inference(fof_simplification,[status(thm)],[stricly_smaller_definition]) ).
cnf(c_0_10,lemma,
( ~ strictly_less_than(X3,X4)
| ~ pair_in_list(X1,X2,X3)
| pair_in_list(update_slb(X1,X4),X2,X4) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_11,negated_conjecture,
pair_in_list(esk1_0,esk2_0,esk3_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_12,plain,
! [X13,X14] :
( ( strictly_less_than(X13,X14)
| less_than(X14,X13)
| ~ less_than(X13,X14) )
& ( ~ strictly_less_than(X13,X14)
| ~ less_than(X14,X13) )
& ( ~ strictly_less_than(X13,X14)
| less_than(X13,X14) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_9])])])]) ).
fof(c_0_13,plain,
! [X42,X43] :
( less_than(X43,X42)
| less_than(X42,X43) ),
inference(variable_rename,[status(thm)],[totality]) ).
cnf(c_0_14,negated_conjecture,
( ~ strictly_less_than(X1,X2)
| ~ pair_in_list(update_slb(esk1_0,esk4_0),X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_15,negated_conjecture,
( ~ strictly_less_than(esk3_0,X1)
| pair_in_list(update_slb(esk1_0,X1),esk2_0,X1) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_16,plain,
( ~ less_than(X1,X2)
| strictly_less_than(X1,X2)
| less_than(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_17,plain,
( less_than(X2,X1)
| less_than(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
fof(c_0_18,plain,
! [X39,X40,X41] :
( less_than(X39,X41)
| ~ less_than(X40,X41)
| ~ less_than(X39,X40) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[transitivity])])]) ).
cnf(c_0_19,plain,
( ~ strictly_less_than(X1,X2)
| less_than(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_20,negated_conjecture,
strictly_less_than(esk2_0,esk3_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_21,lemma,
! [X30,X31,X32,X33] :
( pair_in_list(update_slb(X30,X33),X31,X32)
| ~ less_than(X33,X32)
| ~ pair_in_list(X30,X31,X32) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[l35_li3637])])]) ).
cnf(c_0_22,negated_conjecture,
( ~ strictly_less_than(esk3_0,esk4_0)
| ~ strictly_less_than(esk2_0,esk4_0) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_23,plain,
( less_than(X2,X1)
| strictly_less_than(X1,X2) ),
inference(csr,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_24,plain,
( ~ less_than(X2,X3)
| ~ less_than(X1,X2)
| less_than(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_25,negated_conjecture,
less_than(esk2_0,esk3_0),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_26,lemma,
( ~ less_than(X4,X3)
| ~ pair_in_list(X1,X2,X3)
| pair_in_list(update_slb(X1,X4),X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_27,negated_conjecture,
( ~ strictly_less_than(esk2_0,esk4_0)
| less_than(esk4_0,esk3_0) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_28,negated_conjecture,
( ~ less_than(X1,esk2_0)
| less_than(X1,esk3_0) ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_29,negated_conjecture,
( ~ less_than(esk4_0,X2)
| ~ strictly_less_than(X1,X2)
| ~ pair_in_list(esk1_0,X1,X2) ),
inference(spm,[status(thm)],[c_0_14,c_0_26]) ).
cnf(c_0_30,negated_conjecture,
less_than(esk4_0,esk3_0),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_23]),c_0_28]) ).
cnf(c_0_31,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_20]),c_0_11]),c_0_30])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWV399+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.36 % Computer : n014.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Mon Sep 21 08:44:50 UTC 2026
% 0.10/0.36 % CPUTime :
% 0.10/0.36 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.41 Running first-order theorem proving
% 0.10/0.41 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.10/0.43 % Version: 3.5.1
% 0.10/0.43 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.10/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.43 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.10/0.43 % Starting new_bool_3 with 300s (1) cores
% 0.10/0.43 % Starting new_bool_1 with 300s (1) cores
% 0.10/0.43 % Starting sh5l with 300s (1) cores
% 0.10/0.43 % new_bool_1 with pid 3683112 completed with status 0
% 0.10/0.43 % Result found by new_bool_1
% 0.10/0.43 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.10/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.43 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.10/0.43 % Starting new_bool_3 with 300s (1) cores
% 0.10/0.43 % Starting new_bool_1 with 300s (1) cores
% 0.10/0.43 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.10/0.43 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.10/0.43 % Search class: FGHSS-FFMF22-MFFFFFNN
% 0.10/0.43 % partial match(1): FGHSM-FFMF22-MFFFFFNN
% 0.10/0.43 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.10/0.43 % Starting SubtermCWHack with 31s (1) cores
% 0.10/0.43 % SubtermCWHack with pid 3683115 completed with status 0
% 0.10/0.43 % Result found by SubtermCWHack
% 0.10/0.43 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.10/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.43 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.10/0.43 % Starting new_bool_3 with 300s (1) cores
% 0.10/0.43 % Starting new_bool_1 with 300s (1) cores
% 0.10/0.43 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.10/0.43 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.10/0.43 % Search class: FGHSS-FFMF22-MFFFFFNN
% 0.10/0.43 % partial match(1): FGHSM-FFMF22-MFFFFFNN
% 0.10/0.43 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.10/0.43 % Starting SubtermCWHack with 31s (1) cores
% 0.10/0.43 % Preprocessing time : 0.002 s
% 0.10/0.43
% 0.10/0.43 % Proof found!
% 0.10/0.43 % SZS status Theorem
% 0.10/0.43 % SZS output start CNFRefutation
% See solution above
% 0.10/0.43 % Parsed axioms : 21
% 0.10/0.43 % Removed by relevancy pruning/SinE : 7
% 0.10/0.43 % Initial clauses : 23
% 0.10/0.43 % Removed in clause preprocessing : 0
% 0.10/0.43 % Initial clauses in saturation : 23
% 0.10/0.43 % Processed clauses : 113
% 0.10/0.43 % ...of these trivial : 0
% 0.10/0.43 % ...subsumed : 64
% 0.10/0.43 % ...remaining for further processing : 49
% 0.10/0.43 % Other redundant clauses eliminated : 3
% 0.10/0.43 % Clauses deleted for lack of memory : 0
% 0.10/0.43 % Backward-subsumed : 0
% 0.10/0.43 % Backward-rewritten : 1
% 0.10/0.43 % Generated clauses : 340
% 0.10/0.43 % ...of the previous two non-redundant : 241
% 0.10/0.43 % ...aggressively subsumed : 0
% 0.10/0.43 % Contextual simplify-reflections : 2
% 0.10/0.43 % Paramodulations : 302
% 0.10/0.43 % Factorizations : 36
% 0.10/0.43 % NegExts : 0
% 0.10/0.43 % Equation resolutions : 3
% 0.10/0.43 % Disequality decompositions : 0
% 0.10/0.43 % Total rewrite steps : 101
% 0.10/0.43 % ...of those cached : 80
% 0.10/0.43 % Propositional unsat checks : 0
% 0.10/0.43 % Propositional check models : 0
% 0.10/0.43 % Propositional check unsatisfiable : 0
% 0.10/0.43 % Propositional clauses : 0
% 0.10/0.43 % Propositional clauses after purity: 0
% 0.10/0.43 % Propositional unsat core size : 0
% 0.10/0.43 % Propositional preprocessing time : 0.000
% 0.10/0.43 % Propositional encoding time : 0.000
% 0.10/0.43 % Propositional solver time : 0.000
% 0.10/0.43 % Success case prop preproc time : 0.000
% 0.10/0.43 % Success case prop encoding time : 0.000
% 0.10/0.43 % Success case prop solver time : 0.000
% 0.10/0.43 % Current number of processed clauses : 46
% 0.10/0.43 % Positive orientable unit clauses : 8
% 0.10/0.43 % Positive unorientable unit clauses: 0
% 0.10/0.43 % Negative unit clauses : 3
% 0.10/0.43 % Non-unit-clauses : 35
% 0.10/0.43 % Current number of unprocessed clauses: 151
% 0.10/0.43 % ...number of literals in the above : 697
% 0.10/0.43 % Current number of archived formulas : 0
% 0.10/0.43 % Current number of archived clauses : 1
% 0.10/0.43 % Clause-clause subsumption calls (NU) : 786
% 0.10/0.43 % Rec. Clause-clause subsumption calls : 577
% 0.10/0.43 % Non-unit clause-clause subsumptions : 66
% 0.10/0.43 % Unit Clause-clause subsumption calls : 20
% 0.10/0.43 % Rewrite failures with RHS unbound : 0
% 0.10/0.43 % BW rewrite match attempts : 1
% 0.10/0.43 % BW rewrite match successes : 1
% 0.10/0.43 % Condensation attempts : 0
% 0.10/0.43 % Condensation successes : 0
% 0.10/0.43 % Termbank termtop insertions : 4924
% 0.10/0.43 % Search garbage collected termcells : 344
% 0.10/0.43
% 0.10/0.43 % -------------------------------------------------
% 0.10/0.43 % User time : 0.008 s
% 0.10/0.43 % System time : 0.003 s
% 0.10/0.43 % Total time : 0.011 s
% 0.10/0.43 % Maximum resident set size: 3656 pages
% 0.10/0.43
% 0.10/0.43 % -------------------------------------------------
% 0.10/0.43 % User time : 0.010 s
% 0.10/0.43 % System time : 0.008 s
% 0.10/0.43 % Total time : 0.018 s
% 0.10/0.43 % Maximum resident set size: 4608 pages
% 0.10/0.43 % E exiting
%------------------------------------------------------------------------------