%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : SWV381+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 : n007.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 03:01:27 PM UTC 2026
% Result : Theorem 0.28s 0.49s
% Output : CNFRefutation 0.28s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 10
% Syntax : Number of formulae : 46 ( 14 unt; 0 def)
% Number of atoms : 101 ( 18 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 89 ( 34 ~; 34 |; 10 &)
% ( 4 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 6 con; 0-3 aty)
% Number of variables : 100 ( 9 sgn 63 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(stricly_smaller_definition,axiom,
! [X1,X2] :
( strictly_less_than(X1,X2)
<=> ( ~ less_than(X2,X1)
& less_than(X1,X2) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV007+0.ax',stricly_smaller_definition) ).
fof(l17_l18,lemma,
! [X1,X2,X3] :
( ? [X4] :
( strictly_less_than(X4,findmin_cpq_res(triple(X1,X2,X3)))
& contains_cpq(triple(X1,X2,X3),X4) )
=> ~ phi(findmin_cpq_eff(triple(X1,X2,X3))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l17_l18) ).
fof(totality,axiom,
! [X1,X2] :
( less_than(X2,X1)
| less_than(X1,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV007+0.ax',totality) ).
fof(l17_co,conjecture,
! [X1,X2,X3] :
( phi(findmin_cpq_eff(triple(X1,X2,X3)))
=> issmallestelement_pq(i(triple(X1,X2,X3)),findmin_cpq_res(triple(X1,X2,X3))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l17_co) ).
fof(ax10,axiom,
! [X1,X2] :
( issmallestelement_pq(X1,X2)
<=> ! [X3] :
( contains_pq(X1,X3)
=> less_than(X2,X3) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV007+1.ax',ax10) ).
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(l17_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',l17_li56) ).
fof(bottom_smallest,axiom,
! [X1] : less_than(bottom,X1),
file('/export/starexec/sandbox/benchmark/Axioms/SWV007+0.ax',bottom_smallest) ).
fof(ax54,axiom,
! [X1,X2] : i(triple(X1,create_slb,X2)) = create_pq,
file('/export/starexec/sandbox/benchmark/Axioms/SWV007+4.ax',ax54) ).
fof(ax50,axiom,
! [X1,X2] : findmin_cpq_res(triple(X1,create_slb,X2)) = bottom,
file('/export/starexec/sandbox/benchmark/Axioms/SWV007+3.ax',ax50) ).
fof(c_0_10,plain,
! [X1,X2] :
( strictly_less_than(X1,X2)
<=> ( ~ less_than(X2,X1)
& less_than(X1,X2) ) ),
inference(fof_simplification,[status(thm)],[stricly_smaller_definition]) ).
fof(c_0_11,lemma,
! [X1,X2,X3] :
( ? [X4] :
( strictly_less_than(X4,findmin_cpq_res(triple(X1,X2,X3)))
& contains_cpq(triple(X1,X2,X3),X4) )
=> ~ phi(findmin_cpq_eff(triple(X1,X2,X3))) ),
inference(fof_simplification,[status(thm)],[l17_l18]) ).
fof(c_0_12,plain,
! [X12,X13] :
( ( strictly_less_than(X12,X13)
| less_than(X13,X12)
| ~ less_than(X12,X13) )
& ( ~ strictly_less_than(X12,X13)
| ~ less_than(X13,X12) )
& ( ~ strictly_less_than(X12,X13)
| less_than(X12,X13) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_10])])])]) ).
fof(c_0_13,plain,
! [X9,X10] :
( less_than(X10,X9)
| less_than(X9,X10) ),
inference(variable_rename,[status(thm)],[totality]) ).
fof(c_0_14,lemma,
! [X178,X179,X180,X181] :
( ~ phi(findmin_cpq_eff(triple(X178,X179,X180)))
| ~ strictly_less_than(X181,findmin_cpq_res(triple(X178,X179,X180)))
| ~ contains_cpq(triple(X178,X179,X180),X181) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_11])])])]) ).
cnf(c_0_15,plain,
( ~ less_than(X1,X2)
| strictly_less_than(X1,X2)
| less_than(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_16,plain,
( less_than(X2,X1)
| less_than(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
fof(c_0_17,negated_conjecture,
~ ! [X1,X2,X3] :
( phi(findmin_cpq_eff(triple(X1,X2,X3)))
=> issmallestelement_pq(i(triple(X1,X2,X3)),findmin_cpq_res(triple(X1,X2,X3))) ),
inference(assume_negation,[status(cth)],[l17_co]) ).
cnf(c_0_18,lemma,
( ~ phi(findmin_cpq_eff(triple(X1,X2,X3)))
| ~ strictly_less_than(X4,findmin_cpq_res(triple(X1,X2,X3)))
| ~ contains_cpq(triple(X1,X2,X3),X4) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_19,plain,
( less_than(X2,X1)
| strictly_less_than(X1,X2) ),
inference(csr,[status(thm)],[c_0_15,c_0_16]) ).
fof(c_0_20,negated_conjecture,
( ~ issmallestelement_pq(i(triple(esk5_0,esk6_0,esk7_0)),findmin_cpq_res(triple(esk5_0,esk6_0,esk7_0)))
& phi(findmin_cpq_eff(triple(esk5_0,esk6_0,esk7_0))) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_17])])])]) ).
fof(c_0_21,plain,
! [X21,X22,X23,X24,X25] :
( ( issmallestelement_pq(X24,X25)
| ~ less_than(X25,esk1_2(X24,X25)) )
& ( issmallestelement_pq(X24,X25)
| contains_pq(X24,esk1_2(X24,X25)) )
& ( less_than(X22,X23)
| ~ contains_pq(X21,X23)
| ~ issmallestelement_pq(X21,X22) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[ax10])])])])])])]) ).
cnf(c_0_22,lemma,
( ~ contains_cpq(triple(X1,X2,X3),X4)
| ~ phi(findmin_cpq_eff(triple(X1,X2,X3)))
| less_than(findmin_cpq_res(triple(X1,X2,X3)),X4) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_23,negated_conjecture,
phi(findmin_cpq_eff(triple(esk5_0,esk6_0,esk7_0))),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
fof(c_0_24,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_25,plain,
( ~ less_than(X1,esk1_2(X2,X1))
| issmallestelement_pq(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_26,negated_conjecture,
( ~ contains_cpq(triple(esk5_0,esk6_0,esk7_0),X1)
| less_than(findmin_cpq_res(triple(esk5_0,esk6_0,esk7_0)),X1) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
fof(c_0_27,plain,
! [X142,X143,X144] :
( findmin_cpq_res(triple(X142,X143,X144)) = findmin_pqp_res(X142)
| X143 = create_slb ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[c_0_24])])]) ).
cnf(c_0_28,negated_conjecture,
( ~ contains_cpq(triple(esk5_0,esk6_0,esk7_0),esk1_2(X1,findmin_cpq_res(triple(esk5_0,esk6_0,esk7_0))))
| issmallestelement_pq(X1,findmin_cpq_res(triple(esk5_0,esk6_0,esk7_0))) ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
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_27]) ).
fof(c_0_30,lemma,
! [X174,X175,X176,X177] :
( ( contains_cpq(triple(X174,X175,X176),X177)
| ~ contains_pq(i(triple(X174,X175,X176)),X177) )
& ( contains_pq(i(triple(X174,X175,X176)),X177)
| ~ contains_cpq(triple(X174,X175,X176),X177) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[l17_li56])])]) ).
cnf(c_0_31,negated_conjecture,
( ~ contains_cpq(triple(esk5_0,esk6_0,esk7_0),esk1_2(X1,findmin_pqp_res(esk5_0)))
| issmallestelement_pq(X1,findmin_pqp_res(esk5_0))
| esk6_0 = create_slb ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_32,lemma,
( ~ contains_pq(i(triple(X1,X2,X3)),X4)
| contains_cpq(triple(X1,X2,X3),X4) ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_33,negated_conjecture,
~ issmallestelement_pq(i(triple(esk5_0,esk6_0,esk7_0)),findmin_cpq_res(triple(esk5_0,esk6_0,esk7_0))),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
fof(c_0_34,plain,
! [X14] : less_than(bottom,X14),
inference(variable_rename,[status(thm)],[bottom_smallest]) ).
cnf(c_0_35,lemma,
( ~ contains_pq(i(triple(esk5_0,esk6_0,esk7_0)),esk1_2(X1,findmin_pqp_res(esk5_0)))
| issmallestelement_pq(X1,findmin_pqp_res(esk5_0))
| esk6_0 = create_slb ),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_36,plain,
( issmallestelement_pq(X1,X2)
| contains_pq(X1,esk1_2(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_37,negated_conjecture,
( ~ issmallestelement_pq(i(triple(esk5_0,esk6_0,esk7_0)),findmin_pqp_res(esk5_0))
| esk6_0 = create_slb ),
inference(spm,[status(thm)],[c_0_33,c_0_29]) ).
fof(c_0_38,plain,
! [X147,X148] : i(triple(X147,create_slb,X148)) = create_pq,
inference(variable_rename,[status(thm)],[ax54]) ).
fof(c_0_39,plain,
! [X140,X141] : findmin_cpq_res(triple(X140,create_slb,X141)) = bottom,
inference(variable_rename,[status(thm)],[ax50]) ).
cnf(c_0_40,plain,
less_than(bottom,X1),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
cnf(c_0_41,lemma,
esk6_0 = create_slb,
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_37]) ).
cnf(c_0_42,plain,
i(triple(X1,create_slb,X2)) = create_pq,
inference(split_conjunct,[status(thm)],[c_0_38]) ).
cnf(c_0_43,plain,
findmin_cpq_res(triple(X1,create_slb,X2)) = bottom,
inference(split_conjunct,[status(thm)],[c_0_39]) ).
cnf(c_0_44,plain,
issmallestelement_pq(X1,bottom),
inference(spm,[status(thm)],[c_0_25,c_0_40]) ).
cnf(c_0_45,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_41]),c_0_42]),c_0_43]),c_0_44])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWV381+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 : n007.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:41:50 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.42 Running first-order theorem proving
% 0.11/0.42 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.28/0.49 % Version: 3.5.1
% 0.28/0.49 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.28/0.49 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.28/0.49 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.28/0.49 % Starting new_bool_3 with 300s (1) cores
% 0.28/0.49 % Starting new_bool_1 with 300s (1) cores
% 0.28/0.49 % Starting sh5l with 300s (1) cores
% 0.28/0.49 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 689961 completed with status 0
% 0.28/0.49 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.28/0.49 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.28/0.49 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.28/0.49 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.28/0.49 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.28/0.49 % No SInE strategy applied
% 0.28/0.49 % Search class: FGHSM-FFMF31-MFFFFFNN
% 0.28/0.49 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.28/0.49 % Starting SubtermCWHack with 136s (1) cores
% 0.28/0.49 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.28/0.49 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04AN with 136s (1) cores
% 0.28/0.49 % Starting new_bool_3 with 136s (1) cores
% 0.28/0.49 % Starting new_bool_1 with 136s (1) cores
% 0.28/0.49 % G-E--_301_C18_F1_URBAN_S5PRR_RG_S04AN with pid 689970 completed with status 0
% 0.28/0.49 % Result found by G-E--_301_C18_F1_URBAN_S5PRR_RG_S04AN
% 0.28/0.49 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.28/0.49 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.28/0.49 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.28/0.49 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.28/0.49 % No SInE strategy applied
% 0.28/0.49 % Search class: FGHSM-FFMF31-MFFFFFNN
% 0.28/0.49 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.28/0.49 % Starting SubtermCWHack with 136s (1) cores
% 0.28/0.49 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.28/0.49 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04AN with 136s (1) cores
% 0.28/0.49 % Preprocessing time : 0.006 s
% 0.28/0.49
% 0.28/0.49 % Proof found!
% 0.28/0.49 % SZS status Theorem
% 0.28/0.49 % SZS output start CNFRefutation
% See solution above
% 0.28/0.49 % Parsed axioms : 65
% 0.28/0.49 % Removed by relevancy pruning/SinE : 0
% 0.28/0.49 % Initial clauses : 93
% 0.28/0.49 % Removed in clause preprocessing : 4
% 0.28/0.49 % Initial clauses in saturation : 89
% 0.28/0.49 % Processed clauses : 260
% 0.28/0.49 % ...of these trivial : 3
% 0.28/0.49 % ...subsumed : 56
% 0.28/0.49 % ...remaining for further processing : 201
% 0.28/0.49 % Other redundant clauses eliminated : 4
% 0.28/0.49 % Clauses deleted for lack of memory : 0
% 0.28/0.49 % Backward-subsumed : 6
% 0.28/0.49 % Backward-rewritten : 16
% 0.28/0.49 % Generated clauses : 639
% 0.28/0.49 % ...of the previous two non-redundant : 542
% 0.28/0.49 % ...aggressively subsumed : 0
% 0.28/0.49 % Contextual simplify-reflections : 4
% 0.28/0.49 % Paramodulations : 628
% 0.28/0.49 % Factorizations : 8
% 0.28/0.49 % NegExts : 0
% 0.28/0.49 % Equation resolutions : 4
% 0.28/0.49 % Disequality decompositions : 0
% 0.28/0.49 % Total rewrite steps : 128
% 0.28/0.49 % ...of those cached : 72
% 0.28/0.49 % Propositional unsat checks : 0
% 0.28/0.49 % Propositional check models : 0
% 0.28/0.49 % Propositional check unsatisfiable : 0
% 0.28/0.49 % Propositional clauses : 0
% 0.28/0.49 % Propositional clauses after purity: 0
% 0.28/0.49 % Propositional unsat core size : 0
% 0.28/0.49 % Propositional preprocessing time : 0.000
% 0.28/0.49 % Propositional encoding time : 0.000
% 0.28/0.49 % Propositional solver time : 0.000
% 0.28/0.49 % Success case prop preproc time : 0.000
% 0.28/0.49 % Success case prop encoding time : 0.000
% 0.28/0.49 % Success case prop solver time : 0.000
% 0.28/0.49 % Current number of processed clauses : 176
% 0.28/0.49 % Positive orientable unit clauses : 25
% 0.28/0.49 % Positive unorientable unit clauses: 3
% 0.28/0.49 % Negative unit clauses : 17
% 0.28/0.49 % Non-unit-clauses : 131
% 0.28/0.49 % Current number of unprocessed clauses: 365
% 0.28/0.49 % ...number of literals in the above : 1232
% 0.28/0.49 % Current number of archived formulas : 0
% 0.28/0.49 % Current number of archived clauses : 24
% 0.28/0.49 % Clause-clause subsumption calls (NU) : 7489
% 0.28/0.49 % Rec. Clause-clause subsumption calls : 5282
% 0.28/0.49 % Non-unit clause-clause subsumptions : 32
% 0.28/0.49 % Unit Clause-clause subsumption calls : 501
% 0.28/0.49 % Rewrite failures with RHS unbound : 0
% 0.28/0.49 % BW rewrite match attempts : 11
% 0.28/0.49 % BW rewrite match successes : 3
% 0.28/0.49 % Condensation attempts : 0
% 0.28/0.49 % Condensation successes : 0
% 0.28/0.49 % Termbank termtop insertions : 15859
% 0.28/0.49 % Search garbage collected termcells : 1074
% 0.28/0.49
% 0.28/0.49 % -------------------------------------------------
% 0.28/0.49 % User time : 0.038 s
% 0.28/0.49 % System time : 0.010 s
% 0.28/0.49 % Total time : 0.048 s
% 0.28/0.49 % Maximum resident set size: 3668 pages
% 0.28/0.49
% 0.28/0.49 % -------------------------------------------------
% 0.28/0.49 % User time : 0.172 s
% 0.28/0.49 % System time : 0.034 s
% 0.28/0.49 % Total time : 0.206 s
% 0.28/0.49 % Maximum resident set size: 4608 pages
% 0.28/0.49 % E exiting
%------------------------------------------------------------------------------