%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : SWV385+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 : n002.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:01:28 PM UTC 2026
% Result : Theorem 0.15s 10.45s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 3
% Syntax : Number of formulae : 18 ( 5 unt; 0 def)
% Number of atoms : 43 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 60 ( 35 ~; 16 |; 2 &)
% ( 0 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-1 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-3 aty)
% Number of variables : 33 ( 0 sgn 27 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(l21_co,conjecture,
! [X1,X2,X3] :
( ( ~ ok(triple(X1,X2,X3))
| ~ check_cpq(triple(X1,X2,X3)) )
=> ( ~ ok(im_succ_cpq(triple(X1,X2,X3)))
| ~ check_cpq(im_succ_cpq(triple(X1,X2,X3))) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l21_co) ).
fof(l21_li1316,lemma,
! [X1,X2,X3] :
( ~ ok(triple(X1,X2,X3))
=> ~ ok(im_succ_cpq(triple(X1,X2,X3))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l21_li1316) ).
fof(l21_li2225,lemma,
! [X1,X2,X3] :
( ~ check_cpq(triple(X1,X2,X3))
=> ( ~ ok(im_succ_cpq(triple(X1,X2,X3)))
| ~ check_cpq(im_succ_cpq(triple(X1,X2,X3))) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l21_li2225) ).
fof(c_0_3,negated_conjecture,
~ ! [X1,X2,X3] :
( ( ~ ok(triple(X1,X2,X3))
| ~ check_cpq(triple(X1,X2,X3)) )
=> ( ~ ok(im_succ_cpq(triple(X1,X2,X3)))
| ~ check_cpq(im_succ_cpq(triple(X1,X2,X3))) ) ),
inference(assume_negation,[status(cth)],[l21_co]) ).
fof(c_0_4,lemma,
! [X1,X2,X3] :
( ~ ok(triple(X1,X2,X3))
=> ~ ok(im_succ_cpq(triple(X1,X2,X3))) ),
inference(fof_simplification,[status(thm)],[l21_li1316]) ).
fof(c_0_5,negated_conjecture,
~ ! [X1,X2,X3] :
( ( ~ ok(triple(X1,X2,X3))
| ~ check_cpq(triple(X1,X2,X3)) )
=> ( ~ ok(im_succ_cpq(triple(X1,X2,X3)))
| ~ check_cpq(im_succ_cpq(triple(X1,X2,X3))) ) ),
inference(fof_simplification,[status(thm)],[c_0_3]) ).
fof(c_0_6,lemma,
! [X14,X15,X16] :
( ~ ok(im_succ_cpq(triple(X14,X15,X16)))
| ok(triple(X14,X15,X16)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])]) ).
fof(c_0_7,negated_conjecture,
( ok(im_succ_cpq(triple(esk1_0,esk2_0,esk3_0)))
& check_cpq(im_succ_cpq(triple(esk1_0,esk2_0,esk3_0)))
& ( ~ ok(triple(esk1_0,esk2_0,esk3_0))
| ~ check_cpq(triple(esk1_0,esk2_0,esk3_0)) ) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])])]) ).
fof(c_0_8,lemma,
! [X1,X2,X3] :
( ~ check_cpq(triple(X1,X2,X3))
=> ( ~ ok(im_succ_cpq(triple(X1,X2,X3)))
| ~ check_cpq(im_succ_cpq(triple(X1,X2,X3))) ) ),
inference(fof_simplification,[status(thm)],[l21_li2225]) ).
cnf(c_0_9,lemma,
( ~ ok(im_succ_cpq(triple(X1,X2,X3)))
| ok(triple(X1,X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,negated_conjecture,
ok(im_succ_cpq(triple(esk1_0,esk2_0,esk3_0))),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
fof(c_0_11,lemma,
! [X17,X18,X19] :
( ~ ok(im_succ_cpq(triple(X17,X18,X19)))
| ~ check_cpq(im_succ_cpq(triple(X17,X18,X19)))
| check_cpq(triple(X17,X18,X19)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])])]) ).
cnf(c_0_12,negated_conjecture,
( ~ ok(triple(esk1_0,esk2_0,esk3_0))
| ~ check_cpq(triple(esk1_0,esk2_0,esk3_0)) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_13,negated_conjecture,
ok(triple(esk1_0,esk2_0,esk3_0)),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_14,lemma,
( ~ ok(im_succ_cpq(triple(X1,X2,X3)))
| ~ check_cpq(im_succ_cpq(triple(X1,X2,X3)))
| check_cpq(triple(X1,X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_15,negated_conjecture,
check_cpq(im_succ_cpq(triple(esk1_0,esk2_0,esk3_0))),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_16,negated_conjecture,
~ check_cpq(triple(esk1_0,esk2_0,esk3_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_12,c_0_13])]) ).
cnf(c_0_17,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_10]),c_0_15])]),c_0_16]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWV385+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/10.38 % Computer : n002.cluster.edu
% 0.10/10.38 % Model : x86_64 x86_64
% 0.10/10.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/10.38 % Memory : 8046.5625MB
% 0.10/10.38 % OS : Linux 6.8.0-71-generic
% 0.10/10.38 % CPULimit : 300
% 0.10/10.38 % WCLimit : 300
% 0.10/10.38 % DateTime : Mon Sep 21 08:46:59 UTC 2026
% 0.10/10.38 % CPUTime :
% 0.10/10.38 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.15/10.43 Running first-order theorem proving
% 0.15/10.43 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.15/10.45 % Version: 3.5.1
% 0.15/10.45 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/10.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/10.45 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/10.45 % Starting new_bool_3 with 300s (1) cores
% 0.15/10.45 % Starting new_bool_1 with 300s (1) cores
% 0.15/10.45 % Starting sh5l with 300s (1) cores
% 0.15/10.45 % new_bool_1 with pid 2912011 completed with status 0
% 0.15/10.45 % Result found by new_bool_1
% 0.15/10.45 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/10.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/10.45 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/10.45 % Starting new_bool_3 with 300s (1) cores
% 0.15/10.45 % Starting new_bool_1 with 300s (1) cores
% 0.15/10.45 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.15/10.45 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/10.45 % Search class: FGHSM-FFMF31-MFFFFFNN
% 0.15/10.45 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.15/10.45 % Starting SubtermCWHack with 31s (1) cores
% 0.15/10.45 % SubtermCWHack with pid 2912014 completed with status 0
% 0.15/10.45 % Result found by SubtermCWHack
% 0.15/10.45 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/10.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/10.45 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/10.45 % Starting new_bool_3 with 300s (1) cores
% 0.15/10.45 % Starting new_bool_1 with 300s (1) cores
% 0.15/10.45 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.15/10.45 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/10.45 % Search class: FGHSM-FFMF31-MFFFFFNN
% 0.15/10.45 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.15/10.45 % Starting SubtermCWHack with 31s (1) cores
% 0.15/10.45 % Preprocessing time : 0.001 s
% 0.15/10.45
% 0.15/10.45 % Proof found!
% 0.15/10.45 % SZS status Theorem
% 0.15/10.45 % SZS output start CNFRefutation
% See solution above
% 0.15/10.45 % Parsed axioms : 44
% 0.15/10.45 % Removed by relevancy pruning/SinE : 17
% 0.15/10.45 % Initial clauses : 36
% 0.15/10.45 % Removed in clause preprocessing : 2
% 0.15/10.45 % Initial clauses in saturation : 34
% 0.15/10.45 % Processed clauses : 89
% 0.15/10.45 % ...of these trivial : 0
% 0.15/10.45 % ...subsumed : 40
% 0.15/10.45 % ...remaining for further processing : 49
% 0.15/10.45 % Other redundant clauses eliminated : 1
% 0.15/10.45 % Clauses deleted for lack of memory : 0
% 0.15/10.45 % Backward-subsumed : 1
% 0.15/10.45 % Backward-rewritten : 1
% 0.15/10.45 % Generated clauses : 154
% 0.15/10.45 % ...of the previous two non-redundant : 118
% 0.15/10.45 % ...aggressively subsumed : 0
% 0.15/10.45 % Contextual simplify-reflections : 2
% 0.15/10.45 % Paramodulations : 113
% 0.15/10.45 % Factorizations : 40
% 0.15/10.45 % NegExts : 0
% 0.15/10.45 % Equation resolutions : 1
% 0.15/10.45 % Disequality decompositions : 0
% 0.15/10.45 % Total rewrite steps : 36
% 0.15/10.45 % ...of those cached : 7
% 0.15/10.45 % Propositional unsat checks : 0
% 0.15/10.45 % Propositional check models : 0
% 0.15/10.45 % Propositional check unsatisfiable : 0
% 0.15/10.45 % Propositional clauses : 0
% 0.15/10.45 % Propositional clauses after purity: 0
% 0.15/10.45 % Propositional unsat core size : 0
% 0.15/10.45 % Propositional preprocessing time : 0.000
% 0.15/10.45 % Propositional encoding time : 0.000
% 0.15/10.45 % Propositional solver time : 0.000
% 0.15/10.45 % Success case prop preproc time : 0.000
% 0.15/10.45 % Success case prop encoding time : 0.000
% 0.15/10.45 % Success case prop solver time : 0.000
% 0.15/10.45 % Current number of processed clauses : 46
% 0.15/10.45 % Positive orientable unit clauses : 9
% 0.15/10.45 % Positive unorientable unit clauses: 0
% 0.15/10.45 % Negative unit clauses : 3
% 0.15/10.45 % Non-unit-clauses : 34
% 0.15/10.45 % Current number of unprocessed clauses: 62
% 0.15/10.45 % ...number of literals in the above : 317
% 0.15/10.45 % Current number of archived formulas : 0
% 0.15/10.45 % Current number of archived clauses : 2
% 0.15/10.45 % Clause-clause subsumption calls (NU) : 380
% 0.15/10.45 % Rec. Clause-clause subsumption calls : 294
% 0.15/10.45 % Non-unit clause-clause subsumptions : 41
% 0.15/10.45 % Unit Clause-clause subsumption calls : 1
% 0.15/10.45 % Rewrite failures with RHS unbound : 0
% 0.15/10.45 % BW rewrite match attempts : 1
% 0.15/10.45 % BW rewrite match successes : 1
% 0.15/10.45 % Condensation attempts : 0
% 0.15/10.45 % Condensation successes : 0
% 0.15/10.45 % Termbank termtop insertions : 4808
% 0.15/10.45 % Search garbage collected termcells : 563
% 0.15/10.45
% 0.15/10.45 % -------------------------------------------------
% 0.15/10.45 % User time : 0.007 s
% 0.15/10.45 % System time : 0.003 s
% 0.15/10.45 % Total time : 0.010 s
% 0.15/10.45 % Maximum resident set size: 3688 pages
% 0.15/10.45
% 0.15/10.45 % -------------------------------------------------
% 0.15/10.45 % User time : 0.009 s
% 0.15/10.45 % System time : 0.007 s
% 0.15/10.45 % Total time : 0.016 s
% 0.15/10.45 % Maximum resident set size: 4608 pages
% 0.15/10.45 % E exiting
%------------------------------------------------------------------------------