%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWV372+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 : n008.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.21s 0.57s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 8
% Syntax : Number of formulae : 37 ( 11 unt; 0 def)
% Number of atoms : 74 ( 22 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 68 ( 31 ~; 20 |; 6 &)
% ( 3 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 8 ( 5 usr; 2 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 5 con; 0-3 aty)
% Number of variables : 89 ( 16 sgn 61 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(l8_co,conjecture,
! [X1,X2,X3] :
( phi(findmin_cpq_eff(triple(X1,X2,X3)))
=> contains_pq(i(triple(X1,X2,X3)),findmin_cpq_res(triple(X1,X2,X3))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l8_co) ).
fof(ax40,axiom,
! [X1,X2] :
( ok(triple(X1,X2,bad))
<=> ~ $true ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV007+3.ax',ax40) ).
fof(l8_lX,lemma,
! [X1,X2,X3] :
( ~ ok(triple(X1,X2,X3))
=> ~ phi(triple(X1,X2,X3)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l8_lX) ).
fof(l8_li56,lemma,
! [X1,X2,X3,X4] :
( contains_cpq(triple(X1,X2,X3),X4)
<=> contains_pq(i(triple(X1,X2,X3)),X4) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l8_li56) ).
fof(ax47,axiom,
! [X1,X2,X3,X4] :
( ( ~ contains_slb(X2,findmin_pqp_res(X1))
& X2 != create_slb )
=> findmin_cpq_eff(triple(X1,X2,X3)) = triple(X1,update_slb(X2,findmin_pqp_res(X1)),bad) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV007+3.ax',ax47) ).
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(ax46,axiom,
! [X1,X2] : findmin_cpq_eff(triple(X1,create_slb,X2)) = triple(X1,create_slb,bad),
file('/export/starexec/sandbox/benchmark/Axioms/SWV007+3.ax',ax46) ).
fof(c_0_8,negated_conjecture,
~ ! [X1,X2,X3] :
( phi(findmin_cpq_eff(triple(X1,X2,X3)))
=> contains_pq(i(triple(X1,X2,X3)),findmin_cpq_res(triple(X1,X2,X3))) ),
inference(assume_negation,[status(cth)],[l8_co]) ).
fof(c_0_9,plain,
! [X37,X38] :
( ( ok(triple(X37,X38,bad))
| $true )
& ( ~ $true
| ~ ok(triple(X37,X38,bad)) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax40])])]) ).
fof(c_0_10,lemma,
! [X1,X2,X3] :
( ~ ok(triple(X1,X2,X3))
=> ~ phi(triple(X1,X2,X3)) ),
inference(fof_simplification,[status(thm)],[l8_lX]) ).
fof(c_0_11,negated_conjecture,
( ~ contains_pq(i(triple(esk1_0,esk2_0,esk3_0)),findmin_cpq_res(triple(esk1_0,esk2_0,esk3_0)))
& phi(findmin_cpq_eff(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_8])])])]) ).
fof(c_0_12,lemma,
! [X24,X25,X26,X27] :
( ( contains_cpq(triple(X24,X25,X26),X27)
| ~ contains_pq(i(triple(X24,X25,X26)),X27) )
& ( contains_pq(i(triple(X24,X25,X26)),X27)
| ~ contains_cpq(triple(X24,X25,X26),X27) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[l8_li56])])]) ).
cnf(c_0_13,plain,
( $false
| ~ ok(triple(X1,X2,bad)) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_14,lemma,
! [X59,X60,X61] :
( ~ phi(triple(X59,X60,X61))
| ok(triple(X59,X60,X61)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_10])])]) ).
fof(c_0_15,plain,
! [X1,X2,X3,X4] :
( ( ~ contains_slb(X2,findmin_pqp_res(X1))
& X2 != create_slb )
=> findmin_cpq_eff(triple(X1,X2,X3)) = triple(X1,update_slb(X2,findmin_pqp_res(X1)),bad) ),
inference(fof_simplification,[status(thm)],[ax47]) ).
cnf(c_0_16,negated_conjecture,
~ contains_pq(i(triple(esk1_0,esk2_0,esk3_0)),findmin_cpq_res(triple(esk1_0,esk2_0,esk3_0))),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_17,lemma,
( ~ contains_cpq(triple(X1,X2,X3),X4)
| contains_pq(i(triple(X1,X2,X3)),X4) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_18,plain,
! [X112,X113,X114,X115] :
( ( contains_cpq(triple(X112,X113,X114),X115)
| ~ contains_slb(X113,X115) )
& ( contains_slb(X113,X115)
| ~ contains_cpq(triple(X112,X113,X114),X115) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax39])])]) ).
fof(c_0_19,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]) ).
cnf(c_0_20,plain,
~ ok(triple(X1,X2,bad)),
inference(cn,[status(thm)],[c_0_13]) ).
cnf(c_0_21,lemma,
( ~ phi(triple(X1,X2,X3))
| ok(triple(X1,X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
fof(c_0_22,plain,
! [X64,X65,X66] :
( findmin_cpq_eff(triple(X64,X65,X66)) = triple(X64,update_slb(X65,findmin_pqp_res(X64)),bad)
| contains_slb(X65,findmin_pqp_res(X64))
| X65 = create_slb ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[c_0_15])])]) ).
cnf(c_0_23,negated_conjecture,
~ contains_cpq(triple(esk1_0,esk2_0,esk3_0),findmin_cpq_res(triple(esk1_0,esk2_0,esk3_0))),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_24,plain,
( ~ contains_slb(X1,X2)
| contains_cpq(triple(X3,X1,X4),X2) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
fof(c_0_25,plain,
! [X30,X31,X32] :
( findmin_cpq_res(triple(X30,X31,X32)) = findmin_pqp_res(X30)
| X31 = create_slb ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[c_0_19])])]) ).
cnf(c_0_26,lemma,
~ phi(triple(X1,X2,bad)),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_27,plain,
( findmin_cpq_eff(triple(X2,X1,X3)) = triple(X2,update_slb(X1,findmin_pqp_res(X2)),bad)
| contains_slb(X1,findmin_pqp_res(X2))
| X1 = create_slb ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_28,negated_conjecture,
~ contains_slb(esk2_0,findmin_cpq_res(triple(esk1_0,esk2_0,esk3_0))),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_29,plain,
( findmin_cpq_res(triple(X2,X1,X3)) = findmin_pqp_res(X2)
| X1 = create_slb ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_30,lemma,
( ~ phi(findmin_cpq_eff(triple(X2,X1,X3)))
| contains_slb(X1,findmin_pqp_res(X2))
| X1 = create_slb ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_31,negated_conjecture,
phi(findmin_cpq_eff(triple(esk1_0,esk2_0,esk3_0))),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_32,negated_conjecture,
( ~ contains_slb(esk2_0,findmin_pqp_res(esk1_0))
| esk2_0 = create_slb ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
fof(c_0_33,plain,
! [X46,X47] : findmin_cpq_eff(triple(X46,create_slb,X47)) = triple(X46,create_slb,bad),
inference(variable_rename,[status(thm)],[ax46]) ).
cnf(c_0_34,negated_conjecture,
esk2_0 = create_slb,
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_32]) ).
cnf(c_0_35,plain,
findmin_cpq_eff(triple(X1,create_slb,X2)) = triple(X1,create_slb,bad),
inference(split_conjunct,[status(thm)],[c_0_33]) ).
cnf(c_0_36,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_34]),c_0_35]),c_0_26]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWV372+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.11/0.37 % Computer : n008.cluster.edu
% 0.11/0.37 % Model : x86_64 x86_64
% 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37 % Memory : 8046.5625MB
% 0.11/0.37 % OS : Linux 6.8.0-71-generic
% 0.11/0.37 % CPULimit : 300
% 0.11/0.37 % WCLimit : 300
% 0.11/0.37 % DateTime : Mon Sep 21 08:44:24 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.12/0.44 Running first-order theorem proving
% 0.12/0.44 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.21/0.57 % Version: 3.5.1
% 0.21/0.57 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.21/0.57 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.57 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.21/0.57 % Starting new_bool_3 with 300s (1) cores
% 0.21/0.57 % Starting new_bool_1 with 300s (1) cores
% 0.21/0.57 % Starting sh5l with 300s (1) cores
% 0.21/0.57 % sh5l with pid 619621 completed with status 0
% 0.21/0.57 % Result found by sh5l
% 0.21/0.57 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.21/0.57 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.57 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.21/0.57 % Starting new_bool_3 with 300s (1) cores
% 0.21/0.57 % Starting new_bool_1 with 300s (1) cores
% 0.21/0.57 % Starting sh5l with 300s (1) cores
% 0.21/0.57 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.21/0.57 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.21/0.57 % Search class: FGHSM-FFMF31-MFFFFFNN
% 0.21/0.57 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.57 % Starting SubtermCWHack with 31s (1) cores
% 0.21/0.57 % SubtermCWHack with pid 619624 completed with status 0
% 0.21/0.57 % Result found by SubtermCWHack
% 0.21/0.57 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.21/0.57 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.57 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.21/0.57 % Starting new_bool_3 with 300s (1) cores
% 0.21/0.57 % Starting new_bool_1 with 300s (1) cores
% 0.21/0.57 % Starting sh5l with 300s (1) cores
% 0.21/0.57 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.21/0.57 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.21/0.57 % Search class: FGHSM-FFMF31-MFFFFFNN
% 0.21/0.57 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.57 % Starting SubtermCWHack with 31s (1) cores
% 0.21/0.57 % Preprocessing time : 0.002 s
% 0.21/0.57
% 0.21/0.57 % Proof found!
% 0.21/0.57 % SZS status Theorem
% 0.21/0.57 % SZS output start CNFRefutation
% See solution above
% 0.21/0.57 % Parsed axioms : 66
% 0.21/0.57 % Removed by relevancy pruning/SinE : 11
% 0.21/0.57 % Initial clauses : 76
% 0.21/0.57 % Removed in clause preprocessing : 2
% 0.21/0.57 % Initial clauses in saturation : 74
% 0.21/0.57 % Processed clauses : 249
% 0.21/0.57 % ...of these trivial : 6
% 0.21/0.57 % ...subsumed : 81
% 0.21/0.57 % ...remaining for further processing : 162
% 0.21/0.57 % Other redundant clauses eliminated : 2
% 0.21/0.57 % Clauses deleted for lack of memory : 0
% 0.21/0.57 % Backward-subsumed : 0
% 0.21/0.57 % Backward-rewritten : 4
% 0.21/0.57 % Generated clauses : 518
% 0.21/0.57 % ...of the previous two non-redundant : 422
% 0.21/0.57 % ...aggressively subsumed : 0
% 0.21/0.57 % Contextual simplify-reflections : 9
% 0.21/0.57 % Paramodulations : 496
% 0.21/0.57 % Factorizations : 20
% 0.21/0.57 % NegExts : 0
% 0.21/0.57 % Equation resolutions : 2
% 0.21/0.57 % Disequality decompositions : 0
% 0.21/0.57 % Total rewrite steps : 106
% 0.21/0.57 % ...of those cached : 42
% 0.21/0.57 % Propositional unsat checks : 0
% 0.21/0.57 % Propositional check models : 0
% 0.21/0.57 % Propositional check unsatisfiable : 0
% 0.21/0.57 % Propositional clauses : 0
% 0.21/0.57 % Propositional clauses after purity: 0
% 0.21/0.57 % Propositional unsat core size : 0
% 0.21/0.57 % Propositional preprocessing time : 0.000
% 0.21/0.57 % Propositional encoding time : 0.000
% 0.21/0.57 % Propositional solver time : 0.000
% 0.21/0.57 % Success case prop preproc time : 0.000
% 0.21/0.57 % Success case prop encoding time : 0.000
% 0.21/0.57 % Success case prop solver time : 0.000
% 0.21/0.57 % Current number of processed clauses : 156
% 0.21/0.57 % Positive orientable unit clauses : 27
% 0.21/0.57 % Positive unorientable unit clauses: 1
% 0.21/0.57 % Negative unit clauses : 17
% 0.21/0.57 % Non-unit-clauses : 111
% 0.21/0.57 % Current number of unprocessed clauses: 246
% 0.21/0.57 % ...number of literals in the above : 902
% 0.21/0.57 % Current number of archived formulas : 0
% 0.21/0.57 % Current number of archived clauses : 4
% 0.21/0.57 % Clause-clause subsumption calls (NU) : 4290
% 0.21/0.57 % Rec. Clause-clause subsumption calls : 3336
% 0.21/0.57 % Non-unit clause-clause subsumptions : 71
% 0.21/0.57 % Unit Clause-clause subsumption calls : 146
% 0.21/0.57 % Rewrite failures with RHS unbound : 0
% 0.21/0.57 % BW rewrite match attempts : 9
% 0.21/0.57 % BW rewrite match successes : 1
% 0.21/0.57 % Condensation attempts : 0
% 0.21/0.57 % Condensation successes : 0
% 0.21/0.57 % Termbank termtop insertions : 11713
% 0.21/0.57 % Search garbage collected termcells : 965
% 0.21/0.57
% 0.21/0.57 % -------------------------------------------------
% 0.21/0.57 % User time : 0.026 s
% 0.21/0.57 % System time : 0.003 s
% 0.21/0.57 % Total time : 0.029 s
% 0.21/0.57 % Maximum resident set size: 3916 pages
% 0.21/0.57
% 0.21/0.57 % -------------------------------------------------
% 0.21/0.57 % User time : 0.028 s
% 0.21/0.57 % System time : 0.008 s
% 0.21/0.57 % Total time : 0.037 s
% 0.21/0.57 % Maximum resident set size: 4608 pages
% 0.21/0.57 % E exiting
%------------------------------------------------------------------------------