%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWV376+1 : TPTP v9.3.1. Released v3.3.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:54:35 PM UTC 2026
% Result : Theorem 0.41s 0.63s
% Output : CNFRefutation 0.41s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 5
% Syntax : Number of formulae : 31 ( 10 unt; 0 def)
% Number of atoms : 82 ( 6 equ)
% Maximal formula atoms : 12 ( 2 avg)
% Number of connectives : 97 ( 46 ~; 25 |; 5 &)
% ( 1 <=>; 20 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 2 usr; 2 prp; 0-2 aty)
% Number of functors : 15 ( 15 usr; 13 con; 0-3 aty)
% Number of variables : 98 ( 6 sgn 70 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(l12_co,conjecture,
! [X1,X2,X3] :
( ~ ok(triple(X1,X2,X3))
=> ! [X4,X5,X6] :
( succ_cpq(triple(X1,X2,X3),triple(X4,X5,X6))
=> ~ ok(triple(X4,X5,X6)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l12_co) ).
fof(ax41,axiom,
! [X1,X2,X3] :
( ~ ok(triple(X1,X2,X3))
=> X3 = bad ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV007+3.ax',ax41) ).
fof(l12_induction,axiom,
( ! [X1,X2,X3,X4,X5,X6] :
( succ_cpq(triple(X1,X2,X3),triple(X4,X5,X6))
=> ( ~ ok(triple(X4,X5,X6))
=> ~ ok(im_succ_cpq(triple(X4,X5,X6))) ) )
=> ! [X7,X8,X9] :
( ~ ok(triple(X7,X8,X9))
=> ! [X10,X11,X12] :
( succ_cpq(triple(X7,X8,X9),triple(X10,X11,X12))
=> ~ ok(triple(X10,X11,X12)) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l12_induction) ).
fof(ax40,axiom,
! [X1,X2] :
( ok(triple(X1,X2,bad))
<=> ~ $true ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV007+3.ax',ax40) ).
fof(l12_l13,lemma,
! [X1,X2,X3] :
( ~ ok(triple(X1,X2,X3))
=> ~ ok(im_succ_cpq(triple(X1,X2,X3))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l12_l13) ).
fof(c_0_5,negated_conjecture,
~ ! [X1,X2,X3] :
( ~ ok(triple(X1,X2,X3))
=> ! [X4,X5,X6] :
( succ_cpq(triple(X1,X2,X3),triple(X4,X5,X6))
=> ~ ok(triple(X4,X5,X6)) ) ),
inference(assume_negation,[status(cth)],[l12_co]) ).
fof(c_0_6,negated_conjecture,
~ ! [X1,X2,X3] :
( ~ ok(triple(X1,X2,X3))
=> ! [X4,X5,X6] :
( succ_cpq(triple(X1,X2,X3),triple(X4,X5,X6))
=> ~ ok(triple(X4,X5,X6)) ) ),
inference(fof_simplification,[status(thm)],[c_0_5]) ).
fof(c_0_7,plain,
! [X1,X2,X3] :
( ~ ok(triple(X1,X2,X3))
=> X3 = bad ),
inference(fof_simplification,[status(thm)],[ax41]) ).
fof(c_0_8,negated_conjecture,
( ok(triple(esk10_0,esk11_0,esk12_0))
& succ_cpq(triple(esk7_0,esk8_0,esk9_0),triple(esk10_0,esk11_0,esk12_0))
& ~ ok(triple(esk7_0,esk8_0,esk9_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_9,plain,
! [X89,X90,X91] :
( X91 = bad
| ok(triple(X89,X90,X91)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])]) ).
fof(c_0_10,plain,
( ! [X1,X2,X3,X4,X5,X6] :
( succ_cpq(triple(X1,X2,X3),triple(X4,X5,X6))
=> ( ~ ok(triple(X4,X5,X6))
=> ~ ok(im_succ_cpq(triple(X4,X5,X6))) ) )
=> ! [X7,X8,X9] :
( ~ ok(triple(X7,X8,X9))
=> ! [X10,X11,X12] :
( succ_cpq(triple(X7,X8,X9),triple(X10,X11,X12))
=> ~ ok(triple(X10,X11,X12)) ) ) ),
inference(fof_simplification,[status(thm)],[l12_induction]) ).
cnf(c_0_11,negated_conjecture,
~ ok(triple(esk7_0,esk8_0,esk9_0)),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_12,plain,
( X3 = bad
| ok(triple(X1,X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_13,plain,
! [X87,X88] :
( ( ok(triple(X87,X88,bad))
| $true )
& ( ~ $true
| ~ ok(triple(X87,X88,bad)) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax40])])]) ).
fof(c_0_14,plain,
! [X132,X133,X134,X135,X136,X137] :
( ( ~ ok(triple(X135,X136,X137))
| ~ succ_cpq(triple(X132,X133,X134),triple(X135,X136,X137))
| ok(triple(X132,X133,X134))
| ok(im_succ_cpq(triple(esk4_0,esk5_0,esk6_0))) )
& ( ~ ok(triple(X135,X136,X137))
| ~ succ_cpq(triple(X132,X133,X134),triple(X135,X136,X137))
| ok(triple(X132,X133,X134))
| ~ ok(triple(esk4_0,esk5_0,esk6_0)) )
& ( ~ ok(triple(X135,X136,X137))
| ~ succ_cpq(triple(X132,X133,X134),triple(X135,X136,X137))
| ok(triple(X132,X133,X134))
| succ_cpq(triple(esk1_0,esk2_0,esk3_0),triple(esk4_0,esk5_0,esk6_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)],[c_0_10])])])])])]) ).
cnf(c_0_15,negated_conjecture,
succ_cpq(triple(esk7_0,esk8_0,esk9_0),triple(esk10_0,esk11_0,esk12_0)),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_16,negated_conjecture,
esk9_0 = bad,
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_17,plain,
( $false
| ~ ok(triple(X1,X2,bad)) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_18,plain,
( ~ ok(triple(X4,X5,X6))
| ~ succ_cpq(triple(X1,X2,X3),triple(X4,X5,X6))
| ~ ok(triple(esk4_0,esk5_0,esk6_0))
| ok(triple(X1,X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_19,negated_conjecture,
succ_cpq(triple(esk7_0,esk8_0,bad),triple(esk10_0,esk11_0,esk12_0)),
inference(rw,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_20,negated_conjecture,
ok(triple(esk10_0,esk11_0,esk12_0)),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_21,plain,
~ ok(triple(X1,X2,bad)),
inference(cn,[status(thm)],[c_0_17]) ).
cnf(c_0_22,negated_conjecture,
~ ok(triple(esk4_0,esk5_0,esk6_0)),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20])]),c_0_21]) ).
fof(c_0_23,lemma,
! [X1,X2,X3] :
( ~ ok(triple(X1,X2,X3))
=> ~ ok(im_succ_cpq(triple(X1,X2,X3))) ),
inference(fof_simplification,[status(thm)],[l12_l13]) ).
cnf(c_0_24,plain,
( ~ ok(triple(X4,X5,X6))
| ~ succ_cpq(triple(X1,X2,X3),triple(X4,X5,X6))
| ok(triple(X1,X2,X3))
| ok(im_succ_cpq(triple(esk4_0,esk5_0,esk6_0))) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_25,negated_conjecture,
esk6_0 = bad,
inference(spm,[status(thm)],[c_0_22,c_0_12]) ).
fof(c_0_26,lemma,
! [X138,X139,X140] :
( ~ ok(im_succ_cpq(triple(X138,X139,X140)))
| ok(triple(X138,X139,X140)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_23])])]) ).
cnf(c_0_27,plain,
( ~ succ_cpq(triple(X1,X2,X3),triple(X4,X5,X6))
| ~ ok(triple(X4,X5,X6))
| ok(triple(X1,X2,X3))
| ok(im_succ_cpq(triple(esk4_0,esk5_0,bad))) ),
inference(rw,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_28,lemma,
( ~ ok(im_succ_cpq(triple(X1,X2,X3)))
| ok(triple(X1,X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_29,negated_conjecture,
ok(im_succ_cpq(triple(esk4_0,esk5_0,bad))),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_19]),c_0_20])]),c_0_21]) ).
cnf(c_0_30,lemma,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_21]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : SWV376+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.08 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.19/0.46 % Computer : n011.cluster.edu
% 0.19/0.46 % Model : x86_64 x86_64
% 0.19/0.46 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.19/0.46 % Memory : 8046.5625MB
% 0.19/0.46 % OS : Linux 6.8.0-71-generic
% 0.19/0.46 % CPULimit : 300
% 0.19/0.46 % WCLimit : 300
% 0.19/0.46 % DateTime : Mon Sep 21 08:43:40 UTC 2026
% 0.19/0.47 % CPUTime :
% 0.19/0.47 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.24/0.54 Running first-order theorem proving
% 0.24/0.54 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.41/0.63 % Version: 3.5.1
% 0.41/0.63 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.41/0.63 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.41/0.63 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.41/0.63 % Starting new_bool_3 with 300s (1) cores
% 0.41/0.63 % Starting new_bool_1 with 300s (1) cores
% 0.41/0.63 % Starting sh5l with 300s (1) cores
% 0.41/0.63 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 1499983 completed with status 0
% 0.41/0.63 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.41/0.63 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.41/0.63 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.41/0.63 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.41/0.63 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.41/0.63 % No SInE strategy applied
% 0.41/0.63 % Search class: FGHSM-FFMF31-MFFFFFNN
% 0.41/0.63 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.41/0.63 % Starting SubtermCWHack with 136s (1) cores
% 0.41/0.63 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.41/0.63 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04AN with 136s (1) cores
% 0.41/0.63 % Starting new_bool_3 with 136s (1) cores
% 0.41/0.63 % Starting new_bool_1 with 136s (1) cores
% 0.41/0.63 % SubtermCWHack with pid 1499987 completed with status 0
% 0.41/0.63 % Result found by SubtermCWHack
% 0.41/0.63 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.41/0.63 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.41/0.63 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.41/0.63 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.41/0.63 % No SInE strategy applied
% 0.41/0.63 % Search class: FGHSM-FFMF31-MFFFFFNN
% 0.41/0.63 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.41/0.63 % Starting SubtermCWHack with 136s (1) cores
% 0.41/0.63 % Preprocessing time : 0.003 s
% 0.41/0.63
% 0.41/0.63 % Proof found!
% 0.41/0.63 % SZS status Theorem
% 0.41/0.63 % SZS output start CNFRefutation
% See solution above
% 0.41/0.63 % Parsed axioms : 44
% 0.41/0.63 % Removed by relevancy pruning/SinE : 0
% 0.41/0.63 % Initial clauses : 59
% 0.41/0.63 % Removed in clause preprocessing : 4
% 0.41/0.63 % Initial clauses in saturation : 55
% 0.41/0.63 % Processed clauses : 177
% 0.41/0.63 % ...of these trivial : 1
% 0.41/0.63 % ...subsumed : 62
% 0.41/0.63 % ...remaining for further processing : 114
% 0.41/0.63 % Other redundant clauses eliminated : 3
% 0.41/0.63 % Clauses deleted for lack of memory : 0
% 0.41/0.63 % Backward-subsumed : 5
% 0.41/0.63 % Backward-rewritten : 1
% 0.41/0.63 % Generated clauses : 502
% 0.41/0.63 % ...of the previous two non-redundant : 401
% 0.41/0.63 % ...aggressively subsumed : 0
% 0.41/0.63 % Contextual simplify-reflections : 2
% 0.41/0.63 % Paramodulations : 430
% 0.41/0.63 % Factorizations : 70
% 0.41/0.63 % NegExts : 0
% 0.41/0.63 % Equation resolutions : 3
% 0.41/0.63 % Disequality decompositions : 0
% 0.41/0.63 % Total rewrite steps : 107
% 0.41/0.63 % ...of those cached : 40
% 0.41/0.63 % Propositional unsat checks : 0
% 0.41/0.63 % Propositional check models : 0
% 0.41/0.63 % Propositional check unsatisfiable : 0
% 0.41/0.63 % Propositional clauses : 0
% 0.41/0.63 % Propositional clauses after purity: 0
% 0.41/0.63 % Propositional unsat core size : 0
% 0.41/0.63 % Propositional preprocessing time : 0.000
% 0.41/0.63 % Propositional encoding time : 0.000
% 0.41/0.63 % Propositional solver time : 0.000
% 0.41/0.63 % Success case prop preproc time : 0.000
% 0.41/0.63 % Success case prop encoding time : 0.000
% 0.41/0.63 % Success case prop solver time : 0.000
% 0.41/0.63 % Current number of processed clauses : 106
% 0.41/0.63 % Positive orientable unit clauses : 21
% 0.41/0.63 % Positive unorientable unit clauses: 0
% 0.41/0.63 % Negative unit clauses : 13
% 0.41/0.63 % Non-unit-clauses : 72
% 0.41/0.63 % Current number of unprocessed clauses: 277
% 0.41/0.63 % ...number of literals in the above : 1319
% 0.41/0.63 % Current number of archived formulas : 0
% 0.41/0.63 % Current number of archived clauses : 8
% 0.41/0.63 % Clause-clause subsumption calls (NU) : 978
% 0.41/0.63 % Rec. Clause-clause subsumption calls : 660
% 0.41/0.63 % Non-unit clause-clause subsumptions : 57
% 0.41/0.63 % Unit Clause-clause subsumption calls : 124
% 0.41/0.63 % Rewrite failures with RHS unbound : 0
% 0.41/0.63 % BW rewrite match attempts : 5
% 0.41/0.63 % BW rewrite match successes : 1
% 0.41/0.63 % Condensation attempts : 0
% 0.41/0.63 % Condensation successes : 0
% 0.41/0.63 % Termbank termtop insertions : 11231
% 0.41/0.63 % Search garbage collected termcells : 709
% 0.41/0.63
% 0.41/0.63 % -------------------------------------------------
% 0.41/0.63 % User time : 0.032 s
% 0.41/0.63 % System time : 0.011 s
% 0.41/0.63 % Total time : 0.043 s
% 0.41/0.63 % Maximum resident set size: 3696 pages
% 0.41/0.63
% 0.41/0.63 % -------------------------------------------------
% 0.41/0.63 % User time : 0.096 s
% 0.41/0.63 % System time : 0.031 s
% 0.41/0.63 % Total time : 0.127 s
% 0.41/0.63 % Maximum resident set size: 4608 pages
% 0.41/0.63 % E exiting
%------------------------------------------------------------------------------