%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWV408+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 : n014.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:40 PM UTC 2026
% Result : Theorem 0.14s 0.43s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 4
% Syntax : Number of formulae : 24 ( 10 unt; 0 def)
% Number of atoms : 60 ( 10 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 60 ( 24 ~; 21 |; 10 &)
% ( 0 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-3 aty)
% Number of functors : 10 ( 10 usr; 5 con; 0-3 aty)
% Number of variables : 43 ( 4 sgn 29 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
fof(l44_co,conjecture,
! [X1,X2,X3,X4] :
( ( strictly_less_than(X4,findmin_cpq_res(triple(X1,X2,X3)))
& contains_slb(X2,X4) )
=> ( ? [X5] :
( less_than(findmin_pqp_res(X1),X5)
& pair_in_list(update_slb(X2,findmin_pqp_res(X1)),X4,X5) )
| pair_in_list(update_slb(X2,findmin_pqp_res(X1)),X4,findmin_pqp_res(X1)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l44_co) ).
fof(ax51,axiom,
! [X1,X2,X3,X4] :
( X2 != create_slb
=> findmin_cpq_res(triple(X1,X2,X3)) = findmin_pqp_res(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV007+3.ax',ax51) ).
fof(l44_l45,lemma,
! [X1,X2,X3] :
( ( strictly_less_than(X2,X3)
& contains_slb(X1,X2) )
=> ( ? [X4] :
( less_than(X3,X4)
& pair_in_list(update_slb(X1,X3),X2,X4) )
| pair_in_list(update_slb(X1,X3),X2,X3) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l44_l45) ).
fof(ax20,axiom,
! [X1] : ~ contains_slb(create_slb,X1),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV007+2.ax',ax20) ).
fof(c_0_4,negated_conjecture,
~ ! [X1,X2,X3,X4] :
( ( strictly_less_than(X4,findmin_cpq_res(triple(X1,X2,X3)))
& contains_slb(X2,X4) )
=> ( ? [X5] :
( less_than(findmin_pqp_res(X1),X5)
& pair_in_list(update_slb(X2,findmin_pqp_res(X1)),X4,X5) )
| pair_in_list(update_slb(X2,findmin_pqp_res(X1)),X4,findmin_pqp_res(X1)) ) ),
inference(assume_negation,[status(cth)],[l44_co]) ).
fof(c_0_5,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_6,negated_conjecture,
! [X10] :
( ( ~ less_than(findmin_pqp_res(esk1_0),X10)
| ~ pair_in_list(update_slb(esk2_0,findmin_pqp_res(esk1_0)),esk4_0,X10) )
& ~ pair_in_list(update_slb(esk2_0,findmin_pqp_res(esk1_0)),esk4_0,findmin_pqp_res(esk1_0))
& strictly_less_than(esk4_0,findmin_cpq_res(triple(esk1_0,esk2_0,esk3_0)))
& contains_slb(esk2_0,esk4_0) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])])])]) ).
fof(c_0_7,lemma,
! [X40,X41,X42] :
( ( ~ strictly_less_than(X41,X42)
| ~ contains_slb(X40,X41)
| pair_in_list(update_slb(X40,X42),X41,X42)
| less_than(X42,esk5_3(X40,X41,X42)) )
& ( ~ strictly_less_than(X41,X42)
| ~ contains_slb(X40,X41)
| pair_in_list(update_slb(X40,X42),X41,X42)
| pair_in_list(update_slb(X40,X42),X41,esk5_3(X40,X41,X42)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[l44_l45])])])])]) ).
fof(c_0_8,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_5])])]) ).
cnf(c_0_9,negated_conjecture,
( ~ less_than(findmin_pqp_res(esk1_0),X1)
| ~ pair_in_list(update_slb(esk2_0,findmin_pqp_res(esk1_0)),esk4_0,X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,lemma,
( ~ strictly_less_than(X3,X2)
| ~ contains_slb(X1,X3)
| pair_in_list(update_slb(X1,X2),X3,X2)
| pair_in_list(update_slb(X1,X2),X3,esk5_3(X1,X3,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_11,negated_conjecture,
contains_slb(esk2_0,esk4_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_12,negated_conjecture,
~ pair_in_list(update_slb(esk2_0,findmin_pqp_res(esk1_0)),esk4_0,findmin_pqp_res(esk1_0)),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_13,negated_conjecture,
strictly_less_than(esk4_0,findmin_cpq_res(triple(esk1_0,esk2_0,esk3_0))),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_14,plain,
( findmin_cpq_res(triple(X2,X1,X3)) = findmin_pqp_res(X2)
| X1 = create_slb ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_15,negated_conjecture,
( ~ less_than(findmin_pqp_res(esk1_0),esk5_3(esk2_0,esk4_0,findmin_pqp_res(esk1_0)))
| ~ strictly_less_than(esk4_0,findmin_pqp_res(esk1_0)) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_11])]),c_0_12]) ).
cnf(c_0_16,lemma,
( ~ strictly_less_than(X3,X1)
| ~ contains_slb(X2,X3)
| pair_in_list(update_slb(X2,X1),X3,X1)
| less_than(X1,esk5_3(X2,X3,X1)) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
fof(c_0_17,plain,
! [X1] : ~ contains_slb(create_slb,X1),
inference(fof_simplification,[status(thm)],[ax20]) ).
cnf(c_0_18,negated_conjecture,
( strictly_less_than(esk4_0,findmin_pqp_res(esk1_0))
| esk2_0 = create_slb ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_19,lemma,
~ strictly_less_than(esk4_0,findmin_pqp_res(esk1_0)),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_11])]),c_0_12]) ).
fof(c_0_20,plain,
! [X51] : ~ contains_slb(create_slb,X51),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_17])]) ).
cnf(c_0_21,negated_conjecture,
esk2_0 = create_slb,
inference(sr,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_22,plain,
~ contains_slb(create_slb,X1),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_23,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_11,c_0_21]),c_0_22]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWV408+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.36 % Computer : n014.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Mon Sep 21 08:45:04 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.40 Running first-order theorem proving
% 0.10/0.40 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.14/0.43 % Version: 3.5.1
% 0.14/0.43 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.43 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/0.43 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.43 % Starting new_bool_1 with 300s (1) cores
% 0.14/0.43 % Starting sh5l with 300s (1) cores
% 0.14/0.43 % new_bool_3 with pid 3683862 completed with status 0
% 0.14/0.43 % Result found by new_bool_3
% 0.14/0.43 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.43 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/0.43 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.43 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.14/0.43 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.14/0.43 % Search class: FGHSM-FFMF31-MFFFFFNN
% 0.14/0.43 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.14/0.43 % Starting SubtermCWHack with 31s (1) cores
% 0.14/0.43 % SubtermCWHack with pid 3683866 completed with status 0
% 0.14/0.43 % Result found by SubtermCWHack
% 0.14/0.43 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.43 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/0.43 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.43 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.14/0.43 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.14/0.43 % Search class: FGHSM-FFMF31-MFFFFFNN
% 0.14/0.43 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.14/0.43 % Starting SubtermCWHack with 31s (1) cores
% 0.14/0.43 % Preprocessing time : 0.002 s
% 0.14/0.43
% 0.14/0.43 % Proof found!
% 0.14/0.43 % SZS status Theorem
% 0.14/0.43 % SZS output start CNFRefutation
% See solution above
% 0.14/0.43 % Parsed axioms : 43
% 0.14/0.43 % Removed by relevancy pruning/SinE : 19
% 0.14/0.43 % Initial clauses : 35
% 0.14/0.43 % Removed in clause preprocessing : 0
% 0.14/0.43 % Initial clauses in saturation : 35
% 0.14/0.43 % Processed clauses : 141
% 0.14/0.43 % ...of these trivial : 0
% 0.14/0.43 % ...subsumed : 73
% 0.14/0.43 % ...remaining for further processing : 68
% 0.14/0.43 % Other redundant clauses eliminated : 3
% 0.14/0.43 % Clauses deleted for lack of memory : 0
% 0.14/0.43 % Backward-subsumed : 1
% 0.14/0.43 % Backward-rewritten : 9
% 0.14/0.43 % Generated clauses : 381
% 0.14/0.43 % ...of the previous two non-redundant : 314
% 0.14/0.43 % ...aggressively subsumed : 0
% 0.14/0.43 % Contextual simplify-reflections : 1
% 0.14/0.43 % Paramodulations : 334
% 0.14/0.43 % Factorizations : 44
% 0.14/0.43 % NegExts : 0
% 0.14/0.43 % Equation resolutions : 3
% 0.14/0.43 % Disequality decompositions : 0
% 0.14/0.43 % Total rewrite steps : 69
% 0.14/0.43 % ...of those cached : 39
% 0.14/0.43 % Propositional unsat checks : 0
% 0.14/0.43 % Propositional check models : 0
% 0.14/0.43 % Propositional check unsatisfiable : 0
% 0.14/0.43 % Propositional clauses : 0
% 0.14/0.43 % Propositional clauses after purity: 0
% 0.14/0.43 % Propositional unsat core size : 0
% 0.14/0.43 % Propositional preprocessing time : 0.000
% 0.14/0.43 % Propositional encoding time : 0.000
% 0.14/0.43 % Propositional solver time : 0.000
% 0.14/0.43 % Success case prop preproc time : 0.000
% 0.14/0.43 % Success case prop encoding time : 0.000
% 0.14/0.43 % Success case prop solver time : 0.000
% 0.14/0.43 % Current number of processed clauses : 55
% 0.14/0.43 % Positive orientable unit clauses : 11
% 0.14/0.43 % Positive unorientable unit clauses: 0
% 0.14/0.43 % Negative unit clauses : 5
% 0.14/0.43 % Non-unit-clauses : 39
% 0.14/0.43 % Current number of unprocessed clauses: 208
% 0.14/0.43 % ...number of literals in the above : 1016
% 0.14/0.43 % Current number of archived formulas : 0
% 0.14/0.43 % Current number of archived clauses : 11
% 0.14/0.43 % Clause-clause subsumption calls (NU) : 640
% 0.14/0.43 % Rec. Clause-clause subsumption calls : 458
% 0.14/0.43 % Non-unit clause-clause subsumptions : 73
% 0.14/0.43 % Unit Clause-clause subsumption calls : 4
% 0.14/0.43 % Rewrite failures with RHS unbound : 0
% 0.14/0.43 % BW rewrite match attempts : 2
% 0.14/0.43 % BW rewrite match successes : 1
% 0.14/0.43 % Condensation attempts : 0
% 0.14/0.43 % Condensation successes : 0
% 0.14/0.43 % Termbank termtop insertions : 7086
% 0.14/0.43 % Search garbage collected termcells : 589
% 0.14/0.43
% 0.14/0.43 % -------------------------------------------------
% 0.14/0.43 % User time : 0.015 s
% 0.14/0.43 % System time : 0.001 s
% 0.14/0.43 % Total time : 0.017 s
% 0.14/0.43 % Maximum resident set size: 3636 pages
% 0.14/0.43
% 0.14/0.43 % -------------------------------------------------
% 0.14/0.43 % User time : 0.019 s
% 0.14/0.43 % System time : 0.005 s
% 0.14/0.43 % Total time : 0.024 s
% 0.14/0.43 % Maximum resident set size: 4608 pages
% 0.14/0.43 % E exiting
%------------------------------------------------------------------------------