%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWV389+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 : n026.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.14s 0.42s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 2
% Syntax : Number of formulae : 11 ( 4 unt; 0 def)
% Number of atoms : 25 ( 0 equ)
% Maximal formula atoms : 3 ( 2 avg)
% Number of connectives : 31 ( 17 ~; 7 |; 3 &)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 3 ( 2 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 : 18 ( 0 sgn 15 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(l25_co,conjecture,
! [X1,X2,X3] :
( ~ check_cpq(triple(X1,X2,X3))
=> ( ~ ok(removemin_cpq_eff(triple(X1,X2,X3)))
| ~ check_cpq(removemin_cpq_eff(triple(X1,X2,X3))) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l25_co) ).
fof(l25_l40,lemma,
! [X1,X2,X3] :
( ( ok(removemin_cpq_eff(triple(X1,X2,X3)))
& check_cpq(removemin_cpq_eff(triple(X1,X2,X3))) )
=> check_cpq(triple(X1,X2,X3)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l25_l40) ).
fof(c_0_2,negated_conjecture,
~ ! [X1,X2,X3] :
( ~ check_cpq(triple(X1,X2,X3))
=> ( ~ ok(removemin_cpq_eff(triple(X1,X2,X3)))
| ~ check_cpq(removemin_cpq_eff(triple(X1,X2,X3))) ) ),
inference(assume_negation,[status(cth)],[l25_co]) ).
fof(c_0_3,negated_conjecture,
~ ! [X1,X2,X3] :
( ~ check_cpq(triple(X1,X2,X3))
=> ( ~ ok(removemin_cpq_eff(triple(X1,X2,X3)))
| ~ check_cpq(removemin_cpq_eff(triple(X1,X2,X3))) ) ),
inference(fof_simplification,[status(thm)],[c_0_2]) ).
fof(c_0_4,lemma,
! [X14,X15,X16] :
( check_cpq(triple(X14,X15,X16))
| ~ ok(removemin_cpq_eff(triple(X14,X15,X16)))
| ~ check_cpq(removemin_cpq_eff(triple(X14,X15,X16))) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[l25_l40])])]) ).
fof(c_0_5,negated_conjecture,
( ok(removemin_cpq_eff(triple(esk1_0,esk2_0,esk3_0)))
& check_cpq(removemin_cpq_eff(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_3])])])]) ).
cnf(c_0_6,lemma,
( ~ ok(removemin_cpq_eff(triple(X1,X2,X3)))
| ~ check_cpq(removemin_cpq_eff(triple(X1,X2,X3)))
| check_cpq(triple(X1,X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,negated_conjecture,
ok(removemin_cpq_eff(triple(esk1_0,esk2_0,esk3_0))),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_8,negated_conjecture,
check_cpq(removemin_cpq_eff(triple(esk1_0,esk2_0,esk3_0))),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,negated_conjecture,
~ check_cpq(triple(esk1_0,esk2_0,esk3_0)),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_10,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_7]),c_0_8])]),c_0_9]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWV389+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.35 % Computer : n026.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:47:06 UTC 2026
% 0.10/0.35 % CPUTime :
% 0.10/0.35 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.14/0.39 Running first-order theorem proving
% 0.14/0.39 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.14/0.42 % Version: 3.5.1
% 0.14/0.42 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/0.42 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.42 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/0.42 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.42 % Starting new_bool_1 with 300s (1) cores
% 0.14/0.42 % Starting sh5l with 300s (1) cores
% 0.14/0.42 % new_bool_1 with pid 1880314 completed with status 0
% 0.14/0.42 % Result found by new_bool_1
% 0.14/0.42 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/0.42 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.42 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/0.42 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.42 % Starting new_bool_1 with 300s (1) cores
% 0.14/0.42 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.14/0.42 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.14/0.42 % Search class: FGHSM-FFMF31-MFFFFFNN
% 0.14/0.42 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.14/0.42 % Starting SubtermCWHack with 31s (1) cores
% 0.14/0.42 % SubtermCWHack with pid 1880316 completed with status 0
% 0.14/0.42 % Result found by SubtermCWHack
% 0.14/0.42 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/0.42 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.42 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/0.42 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.42 % Starting new_bool_1 with 300s (1) cores
% 0.14/0.42 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.14/0.42 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.14/0.42 % Search class: FGHSM-FFMF31-MFFFFFNN
% 0.14/0.42 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.14/0.42 % Starting SubtermCWHack with 31s (1) cores
% 0.14/0.42 % Preprocessing time : 0.002 s
% 0.14/0.42
% 0.14/0.42 % Proof found!
% 0.14/0.42 % SZS status Theorem
% 0.14/0.42 % SZS output start CNFRefutation
% See solution above
% 0.14/0.42 % Parsed axioms : 43
% 0.14/0.42 % Removed by relevancy pruning/SinE : 12
% 0.14/0.42 % Initial clauses : 40
% 0.14/0.42 % Removed in clause preprocessing : 2
% 0.14/0.42 % Initial clauses in saturation : 38
% 0.14/0.42 % Processed clauses : 121
% 0.14/0.42 % ...of these trivial : 2
% 0.14/0.42 % ...subsumed : 53
% 0.14/0.42 % ...remaining for further processing : 66
% 0.14/0.42 % Other redundant clauses eliminated : 1
% 0.14/0.42 % Clauses deleted for lack of memory : 0
% 0.14/0.42 % Backward-subsumed : 1
% 0.14/0.42 % Backward-rewritten : 7
% 0.14/0.42 % Generated clauses : 242
% 0.14/0.42 % ...of the previous two non-redundant : 172
% 0.14/0.42 % ...aggressively subsumed : 0
% 0.14/0.42 % Contextual simplify-reflections : 2
% 0.14/0.42 % Paramodulations : 201
% 0.14/0.42 % Factorizations : 40
% 0.14/0.42 % NegExts : 0
% 0.14/0.42 % Equation resolutions : 1
% 0.14/0.42 % Disequality decompositions : 0
% 0.14/0.42 % Total rewrite steps : 89
% 0.14/0.42 % ...of those cached : 38
% 0.14/0.42 % Propositional unsat checks : 0
% 0.14/0.42 % Propositional check models : 0
% 0.14/0.42 % Propositional check unsatisfiable : 0
% 0.14/0.42 % Propositional clauses : 0
% 0.14/0.42 % Propositional clauses after purity: 0
% 0.14/0.42 % Propositional unsat core size : 0
% 0.14/0.42 % Propositional preprocessing time : 0.000
% 0.14/0.42 % Propositional encoding time : 0.000
% 0.14/0.42 % Propositional solver time : 0.000
% 0.14/0.42 % Success case prop preproc time : 0.000
% 0.14/0.42 % Success case prop encoding time : 0.000
% 0.14/0.42 % Success case prop solver time : 0.000
% 0.14/0.42 % Current number of processed clauses : 57
% 0.14/0.42 % Positive orientable unit clauses : 16
% 0.14/0.42 % Positive unorientable unit clauses: 0
% 0.14/0.42 % Negative unit clauses : 3
% 0.14/0.42 % Non-unit-clauses : 38
% 0.14/0.42 % Current number of unprocessed clauses: 84
% 0.14/0.42 % ...number of literals in the above : 428
% 0.14/0.42 % Current number of archived formulas : 0
% 0.14/0.42 % Current number of archived clauses : 8
% 0.14/0.42 % Clause-clause subsumption calls (NU) : 415
% 0.14/0.42 % Rec. Clause-clause subsumption calls : 334
% 0.14/0.42 % Non-unit clause-clause subsumptions : 48
% 0.14/0.42 % Unit Clause-clause subsumption calls : 10
% 0.14/0.42 % Rewrite failures with RHS unbound : 24
% 0.14/0.42 % BW rewrite match attempts : 10
% 0.14/0.42 % BW rewrite match successes : 9
% 0.14/0.42 % Condensation attempts : 0
% 0.14/0.42 % Condensation successes : 0
% 0.14/0.42 % Termbank termtop insertions : 5962
% 0.14/0.42 % Search garbage collected termcells : 539
% 0.14/0.42
% 0.14/0.42 % -------------------------------------------------
% 0.14/0.42 % User time : 0.012 s
% 0.14/0.42 % System time : 0.001 s
% 0.14/0.42 % Total time : 0.013 s
% 0.14/0.42 % Maximum resident set size: 3636 pages
% 0.14/0.42
% 0.14/0.42 % -------------------------------------------------
% 0.14/0.42 % User time : 0.015 s
% 0.14/0.42 % System time : 0.005 s
% 0.14/0.42 % Total time : 0.019 s
% 0.14/0.42 % Maximum resident set size: 4608 pages
% 0.14/0.42 % E exiting
%------------------------------------------------------------------------------