%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWV373+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 : n018.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.27s 0.57s
% Output : CNFRefutation 0.27s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 5
% Syntax : Number of formulae : 25 ( 10 unt; 0 def)
% Number of atoms : 50 ( 12 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 52 ( 27 ~; 9 |; 8 &)
% ( 1 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 4 con; 0-3 aty)
% Number of variables : 51 ( 7 sgn 40 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(l9_co,conjecture,
! [X1,X2,X3] :
( ~ contains_cpq(triple(X1,X2,X3),findmin_cpq_res(triple(X1,X2,X3)))
=> ~ ok(findmin_cpq_eff(triple(X1,X2,X3))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l9_co) ).
fof(l9_l10,lemma,
! [X1,X2,X3] :
( ok(findmin_cpq_eff(triple(X1,X2,X3)))
=> ( less_than(lookup_slb(X2,findmin_pqp_res(X1)),findmin_pqp_res(X1))
& contains_slb(X2,findmin_pqp_res(X1))
& X2 != create_slb ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l9_l10) ).
fof(ax39,axiom,
! [X1,X2,X3,X4] :
( contains_cpq(triple(X1,X2,X3),X4)
<=> contains_slb(X2,X4) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV007+3.ax',ax39) ).
fof(ax51,axiom,
! [X1,X2,X3,X4] :
( X2 != create_slb
=> findmin_cpq_res(triple(X1,X2,X3)) = findmin_pqp_res(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV007+3.ax',ax51) ).
fof(ax20,axiom,
! [X1] : ~ contains_slb(create_slb,X1),
file('/export/starexec/sandbox/benchmark/Axioms/SWV007+2.ax',ax20) ).
fof(c_0_5,negated_conjecture,
~ ! [X1,X2,X3] :
( ~ contains_cpq(triple(X1,X2,X3),findmin_cpq_res(triple(X1,X2,X3)))
=> ~ ok(findmin_cpq_eff(triple(X1,X2,X3))) ),
inference(assume_negation,[status(cth)],[l9_co]) ).
fof(c_0_6,negated_conjecture,
~ ! [X1,X2,X3] :
( ~ contains_cpq(triple(X1,X2,X3),findmin_cpq_res(triple(X1,X2,X3)))
=> ~ ok(findmin_cpq_eff(triple(X1,X2,X3))) ),
inference(fof_simplification,[status(thm)],[c_0_5]) ).
fof(c_0_7,lemma,
! [X1,X2,X3] :
( ok(findmin_cpq_eff(triple(X1,X2,X3)))
=> ( less_than(lookup_slb(X2,findmin_pqp_res(X1)),findmin_pqp_res(X1))
& contains_slb(X2,findmin_pqp_res(X1))
& X2 != create_slb ) ),
inference(fof_simplification,[status(thm)],[l9_l10]) ).
fof(c_0_8,negated_conjecture,
( ok(findmin_cpq_eff(triple(esk1_0,esk2_0,esk3_0)))
& ~ contains_cpq(triple(esk1_0,esk2_0,esk3_0),findmin_cpq_res(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_6])])])]) ).
fof(c_0_9,plain,
! [X19,X20,X21,X22] :
( ( contains_cpq(triple(X19,X20,X21),X22)
| ~ contains_slb(X20,X22) )
& ( contains_slb(X20,X22)
| ~ contains_cpq(triple(X19,X20,X21),X22) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax39])])]) ).
fof(c_0_10,plain,
! [X1,X2,X3,X4] :
( X2 != create_slb
=> findmin_cpq_res(triple(X1,X2,X3)) = findmin_pqp_res(X1) ),
inference(fof_simplification,[status(thm)],[ax51]) ).
fof(c_0_11,lemma,
! [X14,X15,X16] :
( ( ~ ok(findmin_cpq_eff(triple(X14,X15,X16)))
| less_than(lookup_slb(X15,findmin_pqp_res(X14)),findmin_pqp_res(X14)) )
& ( ~ ok(findmin_cpq_eff(triple(X14,X15,X16)))
| contains_slb(X15,findmin_pqp_res(X14)) )
& ( ~ ok(findmin_cpq_eff(triple(X14,X15,X16)))
| X15 != create_slb ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])])]) ).
cnf(c_0_12,negated_conjecture,
~ contains_cpq(triple(esk1_0,esk2_0,esk3_0),findmin_cpq_res(triple(esk1_0,esk2_0,esk3_0))),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,plain,
( ~ contains_slb(X1,X2)
| contains_cpq(triple(X3,X1,X4),X2) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_14,plain,
! [X23,X24,X25] :
( findmin_cpq_res(triple(X23,X24,X25)) = findmin_pqp_res(X23)
| X24 = create_slb ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[c_0_10])])]) ).
cnf(c_0_15,lemma,
( ~ ok(findmin_cpq_eff(triple(X2,X1,X3)))
| contains_slb(X1,findmin_pqp_res(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_16,negated_conjecture,
ok(findmin_cpq_eff(triple(esk1_0,esk2_0,esk3_0))),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_17,plain,
! [X1] : ~ contains_slb(create_slb,X1),
inference(fof_simplification,[status(thm)],[ax20]) ).
cnf(c_0_18,negated_conjecture,
~ contains_slb(esk2_0,findmin_cpq_res(triple(esk1_0,esk2_0,esk3_0))),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_19,plain,
( findmin_cpq_res(triple(X2,X1,X3)) = findmin_pqp_res(X2)
| X1 = create_slb ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_20,negated_conjecture,
contains_slb(esk2_0,findmin_pqp_res(esk1_0)),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
fof(c_0_21,plain,
! [X52] : ~ contains_slb(create_slb,X52),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_17])]) ).
cnf(c_0_22,negated_conjecture,
esk2_0 = create_slb,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20])]) ).
cnf(c_0_23,plain,
~ contains_slb(create_slb,X1),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_24,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_20,c_0_22]),c_0_23]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : SWV373+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.07 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.17/0.42 % Computer : n018.cluster.edu
% 0.17/0.42 % Model : x86_64 x86_64
% 0.17/0.42 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.42 % Memory : 8046.5625MB
% 0.17/0.42 % OS : Linux 6.8.0-71-generic
% 0.17/0.43 % CPULimit : 300
% 0.17/0.43 % WCLimit : 300
% 0.17/0.43 % DateTime : Mon Sep 21 08:45:43 UTC 2026
% 0.17/0.43 % CPUTime :
% 0.17/0.43 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.17/0.50 Running first-order theorem proving
% 0.17/0.50 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.27/0.57 % Version: 3.5.1
% 0.27/0.57 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.27/0.57 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.27/0.57 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.27/0.57 % Starting new_bool_3 with 300s (1) cores
% 0.27/0.57 % Starting new_bool_1 with 300s (1) cores
% 0.27/0.57 % Starting sh5l with 300s (1) cores
% 0.27/0.57 % new_bool_1 with pid 1493751 completed with status 0
% 0.27/0.57 % Result found by new_bool_1
% 0.27/0.57 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.27/0.57 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.27/0.57 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.27/0.57 % Starting new_bool_3 with 300s (1) cores
% 0.27/0.57 % Starting new_bool_1 with 300s (1) cores
% 0.27/0.57 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.27/0.57 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.27/0.57 % Search class: FGHSM-FFMF31-MFFFFFNN
% 0.27/0.57 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.27/0.57 % Starting SubtermCWHack with 31s (1) cores
% 0.27/0.57 % SubtermCWHack with pid 1493757 completed with status 0
% 0.27/0.57 % Result found by SubtermCWHack
% 0.27/0.57 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.27/0.57 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.27/0.57 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.27/0.57 % Starting new_bool_3 with 300s (1) cores
% 0.27/0.57 % Starting new_bool_1 with 300s (1) cores
% 0.27/0.57 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.27/0.57 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.27/0.57 % Search class: FGHSM-FFMF31-MFFFFFNN
% 0.27/0.57 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.27/0.57 % Starting SubtermCWHack with 31s (1) cores
% 0.27/0.57 % Preprocessing time : 0.002 s
% 0.27/0.57
% 0.27/0.57 % Proof found!
% 0.27/0.57 % SZS status Theorem
% 0.27/0.57 % SZS output start CNFRefutation
% See solution above
% 0.27/0.57 % Parsed axioms : 43
% 0.27/0.57 % Removed by relevancy pruning/SinE : 20
% 0.27/0.57 % Initial clauses : 32
% 0.27/0.57 % Removed in clause preprocessing : 1
% 0.27/0.57 % Initial clauses in saturation : 31
% 0.27/0.57 % Processed clauses : 35
% 0.27/0.57 % ...of these trivial : 0
% 0.27/0.57 % ...subsumed : 6
% 0.27/0.57 % ...remaining for further processing : 29
% 0.27/0.57 % Other redundant clauses eliminated : 2
% 0.27/0.57 % Clauses deleted for lack of memory : 0
% 0.27/0.57 % Backward-subsumed : 0
% 0.27/0.57 % Backward-rewritten : 3
% 0.27/0.57 % Generated clauses : 32
% 0.27/0.57 % ...of the previous two non-redundant : 20
% 0.27/0.57 % ...aggressively subsumed : 0
% 0.27/0.57 % Contextual simplify-reflections : 1
% 0.27/0.57 % Paramodulations : 22
% 0.27/0.57 % Factorizations : 8
% 0.27/0.57 % NegExts : 0
% 0.27/0.57 % Equation resolutions : 2
% 0.27/0.57 % Disequality decompositions : 0
% 0.27/0.57 % Total rewrite steps : 11
% 0.27/0.57 % ...of those cached : 1
% 0.27/0.57 % Propositional unsat checks : 0
% 0.27/0.57 % Propositional check models : 0
% 0.27/0.57 % Propositional check unsatisfiable : 0
% 0.27/0.57 % Propositional clauses : 0
% 0.27/0.57 % Propositional clauses after purity: 0
% 0.27/0.57 % Propositional unsat core size : 0
% 0.27/0.57 % Propositional preprocessing time : 0.000
% 0.27/0.57 % Propositional encoding time : 0.000
% 0.27/0.57 % Propositional solver time : 0.000
% 0.27/0.57 % Success case prop preproc time : 0.000
% 0.27/0.57 % Success case prop encoding time : 0.000
% 0.27/0.57 % Success case prop solver time : 0.000
% 0.27/0.57 % Current number of processed clauses : 24
% 0.27/0.57 % Positive orientable unit clauses : 7
% 0.27/0.57 % Positive unorientable unit clauses: 0
% 0.27/0.57 % Negative unit clauses : 3
% 0.27/0.57 % Non-unit-clauses : 14
% 0.27/0.57 % Current number of unprocessed clauses: 16
% 0.27/0.57 % ...number of literals in the above : 51
% 0.27/0.57 % Current number of archived formulas : 0
% 0.27/0.57 % Current number of archived clauses : 3
% 0.27/0.57 % Clause-clause subsumption calls (NU) : 39
% 0.27/0.57 % Rec. Clause-clause subsumption calls : 36
% 0.27/0.57 % Non-unit clause-clause subsumptions : 5
% 0.27/0.57 % Unit Clause-clause subsumption calls : 4
% 0.27/0.57 % Rewrite failures with RHS unbound : 0
% 0.27/0.57 % BW rewrite match attempts : 2
% 0.27/0.57 % BW rewrite match successes : 2
% 0.27/0.57 % Condensation attempts : 0
% 0.27/0.57 % Condensation successes : 0
% 0.27/0.57 % Termbank termtop insertions : 2780
% 0.27/0.57 % Search garbage collected termcells : 521
% 0.27/0.57
% 0.27/0.57 % -------------------------------------------------
% 0.27/0.57 % User time : 0.010 s
% 0.27/0.57 % System time : 0.006 s
% 0.27/0.57 % Total time : 0.015 s
% 0.27/0.57 % Maximum resident set size: 3688 pages
% 0.27/0.57
% 0.27/0.57 % -------------------------------------------------
% 0.27/0.57 % User time : 0.013 s
% 0.27/0.57 % System time : 0.014 s
% 0.27/0.57 % Total time : 0.027 s
% 0.27/0.57 % Maximum resident set size: 4608 pages
% 0.27/0.57 % E exiting
%------------------------------------------------------------------------------