%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : SWX063+1 : TPTP v9.3.1. Released v9.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n008.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 03:14:27 PM UTC 2026
% Result : Theorem 47.44s 7.44s
% Output : CNFRefutation 47.44s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 6
% Syntax : Number of formulae : 32 ( 6 unt; 0 def)
% Number of atoms : 84 ( 51 equ)
% Maximal formula atoms : 15 ( 2 avg)
% Number of connectives : 74 ( 22 ~; 38 |; 6 &)
% ( 0 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 3 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 5 con; 0-2 aty)
% Number of variables : 30 ( 0 sgn 15 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof('theorem-(rev:involution)',conjecture,
! [X74] :
( list_succeeds(X74)
=> rev(rev(X74)) = X74 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','theorem-(rev:involution)') ).
fof('lemma-(rev:app)',axiom,
! [X74,X68] :
( list_succeeds(X74)
=> rev('**'(X74,cons(X68,nil))) = cons(X68,rev(X74)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','lemma-(rev:app)') ).
fof('corollary-(rev:cons)',axiom,
! [X67,X74] :
( list_succeeds(X74)
=> rev(cons(X67,X74)) = '**'(rev(X74),cons(X67,nil)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','corollary-(rev:cons)') ).
fof('corollary-(rev:types)',axiom,
! [X74] :
( list_succeeds(X74)
=> list_succeeds(rev(X74)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','corollary-(rev:types)') ).
fof(induction,axiom,
( ! [X74] :
( ( X74 = nil
| ? [X66,X1] :
( rev(rev(X1)) = X1
& list_succeeds(X1)
& X74 = cons(X66,X1) ) )
=> rev(rev(X74)) = X74 )
=> ! [X74] :
( list_succeeds(X74)
=> rev(rev(X74)) = X74 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',induction) ).
fof('corollary-(rev:nil)',axiom,
rev(nil) = nil,
file('/export/starexec/sandbox/benchmark/theBenchmark.p','corollary-(rev:nil)') ).
fof(c_0_6,negated_conjecture,
~ ! [X74] :
( list_succeeds(X74)
=> rev(rev(X74)) = X74 ),
inference(assume_negation,[status(cth)],['theorem-(rev:involution)']) ).
fof(c_0_7,plain,
! [X1295,X1296] :
( rev('**'(X1295,cons(X1296,nil))) = cons(X1296,rev(X1295))
| ~ list_succeeds(X1295) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],['lemma-(rev:app)'])])]) ).
fof(c_0_8,plain,
! [X1275,X1276] :
( rev(cons(X1275,X1276)) = '**'(rev(X1276),cons(X1275,nil))
| ~ list_succeeds(X1276) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],['corollary-(rev:cons)'])])]) ).
fof(c_0_9,plain,
! [X1274] :
( list_succeeds(rev(X1274))
| ~ list_succeeds(X1274) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],['corollary-(rev:types)'])])]) ).
fof(c_0_10,negated_conjecture,
( rev(rev(esk156_0)) != esk156_0
& list_succeeds(esk156_0) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])])]) ).
fof(c_0_11,plain,
! [X1300] :
( ( rev(rev(X1300)) = X1300
| ~ list_succeeds(X1300)
| rev(rev(esk153_0)) != esk153_0 )
& ( rev(rev(X1300)) = X1300
| ~ list_succeeds(X1300)
| esk153_0 = nil
| rev(rev(esk155_0)) = esk155_0 )
& ( rev(rev(X1300)) = X1300
| ~ list_succeeds(X1300)
| esk153_0 = nil
| list_succeeds(esk155_0) )
& ( rev(rev(X1300)) = X1300
| ~ list_succeeds(X1300)
| esk153_0 = nil
| esk153_0 = cons(esk154_0,esk155_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)],[induction])])])])])]) ).
cnf(c_0_12,plain,
( ~ list_succeeds(X1)
| rev('**'(X1,cons(X2,nil))) = cons(X2,rev(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_13,plain,
( ~ list_succeeds(X1)
| rev(cons(X2,X1)) = '**'(rev(X1),cons(X2,nil)) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_14,plain,
( ~ list_succeeds(X1)
| list_succeeds(rev(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_15,negated_conjecture,
rev(rev(esk156_0)) != esk156_0,
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_16,plain,
( ~ list_succeeds(X1)
| rev(rev(X1)) = X1
| esk153_0 = nil
| esk153_0 = cons(esk154_0,esk155_0) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_17,negated_conjecture,
list_succeeds(esk156_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_18,plain,
( ~ list_succeeds(X1)
| rev(rev(X1)) = X1
| esk153_0 = nil
| list_succeeds(esk155_0) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_19,plain,
( ~ list_succeeds(X2)
| rev(rev(cons(X1,X2))) = cons(X1,rev(rev(X2))) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14]) ).
cnf(c_0_20,negated_conjecture,
( esk153_0 = nil
| cons(esk154_0,esk155_0) = esk153_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17])]) ).
cnf(c_0_21,negated_conjecture,
( list_succeeds(esk155_0)
| esk153_0 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_18]),c_0_17])]) ).
cnf(c_0_22,plain,
( ~ list_succeeds(X1)
| rev(rev(X1)) = X1
| esk153_0 = nil
| rev(rev(esk155_0)) = esk155_0 ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_23,negated_conjecture,
( esk153_0 = nil
| cons(esk154_0,rev(rev(esk155_0))) = rev(rev(esk153_0)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21]) ).
cnf(c_0_24,negated_conjecture,
( esk153_0 = nil
| rev(rev(esk155_0)) = esk155_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_22]),c_0_17])]) ).
cnf(c_0_25,plain,
( ~ list_succeeds(X1)
| rev(rev(esk153_0)) != esk153_0
| rev(rev(X1)) = X1 ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_26,negated_conjecture,
( esk153_0 = nil
| rev(rev(esk153_0)) = cons(esk154_0,esk155_0) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_27,negated_conjecture,
( ~ list_succeeds(X1)
| esk153_0 = nil
| rev(rev(X1)) = X1 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_20]) ).
cnf(c_0_28,negated_conjecture,
esk153_0 = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_27]),c_0_17])]) ).
cnf(c_0_29,plain,
rev(nil) = nil,
inference(split_conjunct,[status(thm)],['corollary-(rev:nil)']) ).
cnf(c_0_30,plain,
( ~ list_succeeds(X1)
| rev(rev(X1)) = X1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_25,c_0_28]),c_0_29]),c_0_29]),c_0_28])]) ).
cnf(c_0_31,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_30]),c_0_17])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWX063+1 : TPTP v9.3.1. Released v9.1.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.36 % Computer : n008.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 10:26:23 UTC 2026
% 0.10/0.36 % CPUTime :
% 0.10/0.36 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.40 Running first-order theorem proving
% 0.10/0.40 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
% 47.44/7.44 % Version: 3.5.1
% 47.44/7.44 % Preprocessing class: FSLSSMSSSSSNFFN.
% 47.44/7.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 47.44/7.44 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 47.44/7.44 % Starting new_bool_3 with 300s (1) cores
% 47.44/7.44 % Starting new_bool_1 with 300s (1) cores
% 47.44/7.44 % Starting sh5l with 300s (1) cores
% 47.44/7.44 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 755859 completed with status 0
% 47.44/7.44 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 47.44/7.44 % Preprocessing class: FSLSSMSSSSSNFFN.
% 47.44/7.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 47.44/7.44 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 47.44/7.44 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 47.44/7.44 % No SInE strategy applied
% 47.44/7.44 % Search class: FGHSM-FSLS32-MFFFFFNN
% 47.44/7.44 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 47.44/7.44 % Starting SubtermCWHack with 136s (1) cores
% 47.44/7.44 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 47.44/7.44 % Starting G-E--_200_C45_F1_SE_CS_SP_PI_CO_S0V with 169s (1) cores
% 47.44/7.44 % Starting new_bool_3 with 169s (1) cores
% 47.44/7.44 % Starting new_bool_1 with 169s (1) cores
% 47.44/7.44 % new_bool_3 with pid 755868 completed with status 0
% 47.44/7.44 % Result found by new_bool_3
% 47.44/7.44 % Preprocessing class: FSLSSMSSSSSNFFN.
% 47.44/7.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 47.44/7.44 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 47.44/7.44 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 47.44/7.44 % No SInE strategy applied
% 47.44/7.44 % Search class: FGHSM-FSLS32-MFFFFFNN
% 47.44/7.44 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 47.44/7.44 % Starting SubtermCWHack with 136s (1) cores
% 47.44/7.44 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 47.44/7.44 % Starting G-E--_200_C45_F1_SE_CS_SP_PI_CO_S0V with 169s (1) cores
% 47.44/7.44 % Starting new_bool_3 with 169s (1) cores
% 47.44/7.44 % Preprocessing time : 0.011 s
% 47.44/7.44 % Presaturation interreduction done
% 47.44/7.44
% 47.44/7.44 % Proof found!
% 47.44/7.44 % SZS status Theorem
% 47.44/7.44 % SZS output start CNFRefutation
% See solution above
% 47.44/7.44 % Parsed axioms : 355
% 47.44/7.44 % Removed by relevancy pruning/SinE : 0
% 47.44/7.44 % Initial clauses : 739
% 47.44/7.44 % Removed in clause preprocessing : 49
% 47.44/7.44 % Initial clauses in saturation : 690
% 47.44/7.44 % Processed clauses : 27147
% 47.44/7.44 % ...of these trivial : 100
% 47.44/7.44 % ...subsumed : 19369
% 47.44/7.44 % ...remaining for further processing : 7678
% 47.44/7.44 % Other redundant clauses eliminated : 2504
% 47.44/7.44 % Clauses deleted for lack of memory : 0
% 47.44/7.44 % Backward-subsumed : 326
% 47.44/7.44 % Backward-rewritten : 1850
% 47.44/7.44 % Generated clauses : 165904
% 47.44/7.44 % ...of the previous two non-redundant : 150923
% 47.44/7.44 % ...aggressively subsumed : 0
% 47.44/7.44 % Contextual simplify-reflections : 831
% 47.44/7.44 % Paramodulations : 163406
% 47.44/7.44 % Factorizations : 12
% 47.44/7.44 % NegExts : 0
% 47.44/7.44 % Equation resolutions : 2524
% 47.44/7.44 % Disequality decompositions : 0
% 47.44/7.44 % Total rewrite steps : 29637
% 47.44/7.44 % ...of those cached : 27876
% 47.44/7.44 % Propositional unsat checks : 1
% 47.44/7.44 % Propositional check models : 0
% 47.44/7.44 % Propositional check unsatisfiable : 0
% 47.44/7.44 % Propositional clauses : 0
% 47.44/7.44 % Propositional clauses after purity: 0
% 47.44/7.44 % Propositional unsat core size : 0
% 47.44/7.44 % Propositional preprocessing time : 0.000
% 47.44/7.44 % Propositional encoding time : 0.055
% 47.44/7.44 % Propositional solver time : 0.058
% 47.44/7.44 % Success case prop preproc time : 0.000
% 47.44/7.44 % Success case prop encoding time : 0.000
% 47.44/7.44 % Success case prop solver time : 0.000
% 47.44/7.44 % Current number of processed clauses : 4756
% 47.44/7.44 % Positive orientable unit clauses : 318
% 47.44/7.44 % Positive unorientable unit clauses: 0
% 47.44/7.44 % Negative unit clauses : 135
% 47.44/7.44 % Non-unit-clauses : 4303
% 47.44/7.44 % Current number of unprocessed clauses: 124358
% 47.44/7.44 % ...number of literals in the above : 502316
% 47.44/7.44 % Current number of archived formulas : 0
% 47.44/7.44 % Current number of archived clauses : 2831
% 47.44/7.44 % Clause-clause subsumption calls (NU) : 6962038
% 47.44/7.44 % Rec. Clause-clause subsumption calls : 5109047
% 47.44/7.44 % Non-unit clause-clause subsumptions : 16585
% 47.44/7.44 % Unit Clause-clause subsumption calls : 34729
% 47.44/7.44 % Rewrite failures with RHS unbound : 0
% 47.44/7.44 % BW rewrite match attempts : 329
% 47.44/7.44 % BW rewrite match successes : 61
% 47.44/7.44 % Condensation attempts : 0
% 47.44/7.44 % Condensation successes : 0
% 47.44/7.44 % Termbank termtop insertions : 1947658
% 47.44/7.44 % Search garbage collected termcells : 12560
% 47.44/7.44
% 47.44/7.44 % -------------------------------------------------
% 47.44/7.44 % User time : 6.347 s
% 47.44/7.44 % System time : 0.156 s
% 47.44/7.44 % Total time : 6.503 s
% 47.44/7.44 % Maximum resident set size: 6084 pages
% 47.44/7.44
% 47.44/7.44 % -------------------------------------------------
% 47.44/7.44 % User time : 32.783 s
% 47.44/7.44 % System time : 0.866 s
% 47.44/7.44 % Total time : 33.650 s
% 47.44/7.44 % Maximum resident set size: 5376 pages
% 47.44/7.44 % E exiting
%------------------------------------------------------------------------------