%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWV383+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 : n004.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:37 PM UTC 2026
% Result : Theorem 0.13s 0.43s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 2
% Syntax : Number of formulae : 13 ( 5 unt; 0 def)
% Number of atoms : 43 ( 0 equ)
% Maximal formula atoms : 8 ( 3 avg)
% Number of connectives : 60 ( 30 ~; 16 |; 4 &)
% ( 0 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 6 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 6 con; 0-3 aty)
% Number of variables : 42 ( 0 sgn 36 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(l19_co,conjecture,
! [X1,X2,X3] :
( ~ check_cpq(triple(X1,X2,X3))
=> ! [X4,X5,X6] :
( succ_cpq(triple(X1,X2,X3),triple(X4,X5,X6))
=> ( ~ check_cpq(triple(X4,X5,X6))
| ~ ok(triple(X4,X5,X6)) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l19_co) ).
fof(l19_l20,lemma,
! [X1,X2,X3] :
( ( ~ ok(triple(X1,X2,X3))
| ~ check_cpq(triple(X1,X2,X3)) )
=> ! [X4,X5,X6] :
( succ_cpq(triple(X1,X2,X3),triple(X4,X5,X6))
=> ( ~ check_cpq(triple(X4,X5,X6))
| ~ ok(triple(X4,X5,X6)) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l19_l20) ).
fof(c_0_2,negated_conjecture,
~ ! [X1,X2,X3] :
( ~ check_cpq(triple(X1,X2,X3))
=> ! [X4,X5,X6] :
( succ_cpq(triple(X1,X2,X3),triple(X4,X5,X6))
=> ( ~ check_cpq(triple(X4,X5,X6))
| ~ ok(triple(X4,X5,X6)) ) ) ),
inference(assume_negation,[status(cth)],[l19_co]) ).
fof(c_0_3,lemma,
! [X1,X2,X3] :
( ( ~ ok(triple(X1,X2,X3))
| ~ check_cpq(triple(X1,X2,X3)) )
=> ! [X4,X5,X6] :
( succ_cpq(triple(X1,X2,X3),triple(X4,X5,X6))
=> ( ~ check_cpq(triple(X4,X5,X6))
| ~ ok(triple(X4,X5,X6)) ) ) ),
inference(fof_simplification,[status(thm)],[l19_l20]) ).
fof(c_0_4,negated_conjecture,
~ ! [X1,X2,X3] :
( ~ check_cpq(triple(X1,X2,X3))
=> ! [X4,X5,X6] :
( succ_cpq(triple(X1,X2,X3),triple(X4,X5,X6))
=> ( ~ check_cpq(triple(X4,X5,X6))
| ~ ok(triple(X4,X5,X6)) ) ) ),
inference(fof_simplification,[status(thm)],[c_0_2]) ).
fof(c_0_5,lemma,
! [X25,X26,X27,X28,X29,X30] :
( ( ~ check_cpq(triple(X28,X29,X30))
| ~ ok(triple(X28,X29,X30))
| ~ succ_cpq(triple(X25,X26,X27),triple(X28,X29,X30))
| ok(triple(X25,X26,X27)) )
& ( ~ check_cpq(triple(X28,X29,X30))
| ~ ok(triple(X28,X29,X30))
| ~ succ_cpq(triple(X25,X26,X27),triple(X28,X29,X30))
| check_cpq(triple(X25,X26,X27)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])])])]) ).
fof(c_0_6,negated_conjecture,
( check_cpq(triple(esk4_0,esk5_0,esk6_0))
& ok(triple(esk4_0,esk5_0,esk6_0))
& succ_cpq(triple(esk1_0,esk2_0,esk3_0),triple(esk4_0,esk5_0,esk6_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_4])])])]) ).
cnf(c_0_7,lemma,
( ~ check_cpq(triple(X4,X5,X6))
| ~ ok(triple(X4,X5,X6))
| ~ succ_cpq(triple(X1,X2,X3),triple(X4,X5,X6))
| check_cpq(triple(X1,X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_8,negated_conjecture,
succ_cpq(triple(esk1_0,esk2_0,esk3_0),triple(esk4_0,esk5_0,esk6_0)),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_9,negated_conjecture,
ok(triple(esk4_0,esk5_0,esk6_0)),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,negated_conjecture,
check_cpq(triple(esk4_0,esk5_0,esk6_0)),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_11,negated_conjecture,
~ check_cpq(triple(esk1_0,esk2_0,esk3_0)),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_12,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_8]),c_0_9]),c_0_10])]),c_0_11]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWV383+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.35 % Computer : n004.cluster.edu
% 0.10/0.35 % Model : x86_64 x86_64
% 0.10/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.35 % Memory : 8046.5625MB
% 0.10/0.35 % OS : Linux 6.8.0-71-generic
% 0.10/0.35 % CPULimit : 300
% 0.10/0.35 % WCLimit : 300
% 0.10/0.35 % DateTime : Mon Sep 21 08:44:19 UTC 2026
% 0.10/0.36 % CPUTime :
% 0.10/0.36 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.13/0.40 Running first-order theorem proving
% 0.13/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
% 0.13/0.43 % Version: 3.5.1
% 0.13/0.43 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.13/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.43 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.13/0.43 % Starting new_bool_3 with 300s (1) cores
% 0.13/0.43 % Starting new_bool_1 with 300s (1) cores
% 0.13/0.43 % Starting sh5l with 300s (1) cores
% 0.13/0.43 % new_bool_1 with pid 2752420 completed with status 0
% 0.13/0.43 % Result found by new_bool_1
% 0.13/0.43 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.13/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.43 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.13/0.43 % Starting new_bool_3 with 300s (1) cores
% 0.13/0.43 % Starting new_bool_1 with 300s (1) cores
% 0.13/0.43 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.13/0.43 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.13/0.43 % Search class: FGHSM-FFMS31-MFFFFFNN
% 0.13/0.43 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.13/0.43 % Starting SubtermCWHack with 28s (1) cores
% 0.13/0.43 % SubtermCWHack with pid 2752423 completed with status 0
% 0.13/0.43 % Result found by SubtermCWHack
% 0.13/0.43 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.13/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.43 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.13/0.43 % Starting new_bool_3 with 300s (1) cores
% 0.13/0.43 % Starting new_bool_1 with 300s (1) cores
% 0.13/0.43 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.13/0.43 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.13/0.43 % Search class: FGHSM-FFMS31-MFFFFFNN
% 0.13/0.43 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.13/0.43 % Starting SubtermCWHack with 28s (1) cores
% 0.13/0.43 % Preprocessing time : 0.001 s
% 0.13/0.43
% 0.13/0.43 % Proof found!
% 0.13/0.43 % SZS status Theorem
% 0.13/0.43 % SZS output start CNFRefutation
% See solution above
% 0.13/0.43 % Parsed axioms : 43
% 0.13/0.43 % Removed by relevancy pruning/SinE : 16
% 0.13/0.43 % Initial clauses : 38
% 0.13/0.43 % Removed in clause preprocessing : 2
% 0.13/0.43 % Initial clauses in saturation : 36
% 0.13/0.43 % Processed clauses : 110
% 0.13/0.43 % ...of these trivial : 0
% 0.13/0.43 % ...subsumed : 55
% 0.13/0.43 % ...remaining for further processing : 55
% 0.13/0.43 % Other redundant clauses eliminated : 1
% 0.13/0.43 % Clauses deleted for lack of memory : 0
% 0.13/0.43 % Backward-subsumed : 0
% 0.13/0.43 % Backward-rewritten : 0
% 0.13/0.43 % Generated clauses : 258
% 0.13/0.43 % ...of the previous two non-redundant : 201
% 0.13/0.43 % ...aggressively subsumed : 0
% 0.13/0.43 % Contextual simplify-reflections : 2
% 0.13/0.43 % Paramodulations : 187
% 0.13/0.43 % Factorizations : 70
% 0.13/0.43 % NegExts : 0
% 0.13/0.43 % Equation resolutions : 1
% 0.13/0.43 % Disequality decompositions : 0
% 0.13/0.43 % Total rewrite steps : 54
% 0.13/0.43 % ...of those cached : 13
% 0.13/0.43 % Propositional unsat checks : 0
% 0.13/0.43 % Propositional check models : 0
% 0.13/0.43 % Propositional check unsatisfiable : 0
% 0.13/0.43 % Propositional clauses : 0
% 0.13/0.43 % Propositional clauses after purity: 0
% 0.13/0.43 % Propositional unsat core size : 0
% 0.13/0.43 % Propositional preprocessing time : 0.000
% 0.13/0.43 % Propositional encoding time : 0.000
% 0.13/0.43 % Propositional solver time : 0.000
% 0.13/0.43 % Success case prop preproc time : 0.000
% 0.13/0.43 % Success case prop encoding time : 0.000
% 0.13/0.43 % Success case prop solver time : 0.000
% 0.13/0.43 % Current number of processed clauses : 54
% 0.13/0.43 % Positive orientable unit clauses : 11
% 0.13/0.43 % Positive unorientable unit clauses: 0
% 0.13/0.43 % Negative unit clauses : 3
% 0.13/0.43 % Non-unit-clauses : 40
% 0.13/0.43 % Current number of unprocessed clauses: 125
% 0.13/0.43 % ...number of literals in the above : 725
% 0.13/0.43 % Current number of archived formulas : 0
% 0.13/0.43 % Current number of archived clauses : 0
% 0.13/0.43 % Clause-clause subsumption calls (NU) : 382
% 0.13/0.43 % Rec. Clause-clause subsumption calls : 338
% 0.13/0.43 % Non-unit clause-clause subsumptions : 55
% 0.13/0.43 % Unit Clause-clause subsumption calls : 1
% 0.13/0.43 % Rewrite failures with RHS unbound : 0
% 0.13/0.43 % BW rewrite match attempts : 0
% 0.13/0.43 % BW rewrite match successes : 0
% 0.13/0.43 % Condensation attempts : 0
% 0.13/0.43 % Condensation successes : 0
% 0.13/0.43 % Termbank termtop insertions : 6285
% 0.13/0.43 % Search garbage collected termcells : 596
% 0.13/0.43
% 0.13/0.43 % -------------------------------------------------
% 0.13/0.43 % User time : 0.010 s
% 0.13/0.43 % System time : 0.001 s
% 0.13/0.43 % Total time : 0.011 s
% 0.13/0.43 % Maximum resident set size: 3688 pages
% 0.13/0.43
% 0.13/0.43 % -------------------------------------------------
% 0.13/0.43 % User time : 0.012 s
% 0.13/0.43 % System time : 0.006 s
% 0.13/0.43 % Total time : 0.018 s
% 0.13/0.43 % Maximum resident set size: 4608 pages
% 0.13/0.43 % E exiting
%------------------------------------------------------------------------------