%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWV417+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 : n019.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:42 PM UTC 2026
% Result : Theorem 0.13s 0.43s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 4
% Syntax : Number of formulae : 17 ( 2 unt; 0 def)
% Number of atoms : 47 ( 8 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 49 ( 19 ~; 15 |; 8 &)
% ( 1 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 3 con; 0-3 aty)
% Number of variables : 34 ( 0 sgn 21 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co4,conjecture,
! [X1,X2,X3] :
( pi_find_min(triple(X1,X2,X3))
=> ( phi(findmin_cpq_eff(triple(X1,X2,X3)))
=> ? [X4] :
( findmin_cpq_res(triple(X1,X2,X3)) = findmin_pq_res(i(triple(X1,X2,X3)),X4)
& pi_sharp_find_min(i(triple(X1,X2,X3)),X4) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co4) ).
fof(ax14,axiom,
! [X1,X2] :
( ( issmallestelement_pq(X1,X2)
& contains_pq(X1,X2) )
=> findmin_pq_res(X1,X2) = X2 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV007+1.ax',ax14) ).
fof(ax58,axiom,
! [X1,X2] :
( pi_sharp_find_min(X1,X2)
<=> ( issmallestelement_pq(X1,X2)
& contains_pq(X1,X2) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV007+4.ax',ax58) ).
fof(main4_l7,lemma,
! [X1,X2,X3] :
( phi(findmin_cpq_eff(triple(X1,X2,X3)))
=> pi_sharp_find_min(i(triple(X1,X2,X3)),findmin_cpq_res(triple(X1,X2,X3))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',main4_l7) ).
fof(c_0_4,negated_conjecture,
~ ! [X1,X2,X3] :
( pi_find_min(triple(X1,X2,X3))
=> ( phi(findmin_cpq_eff(triple(X1,X2,X3)))
=> ? [X4] :
( findmin_cpq_res(triple(X1,X2,X3)) = findmin_pq_res(i(triple(X1,X2,X3)),X4)
& pi_sharp_find_min(i(triple(X1,X2,X3)),X4) ) ) ),
inference(assume_negation,[status(cth)],[co4]) ).
fof(c_0_5,negated_conjecture,
! [X180] :
( ( findmin_cpq_res(triple(esk5_0,esk6_0,esk7_0)) != findmin_pq_res(i(triple(esk5_0,esk6_0,esk7_0)),X180)
| ~ pi_sharp_find_min(i(triple(esk5_0,esk6_0,esk7_0)),X180) )
& phi(findmin_cpq_eff(triple(esk5_0,esk6_0,esk7_0)))
& pi_find_min(triple(esk5_0,esk6_0,esk7_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_6,plain,
! [X34,X35] :
( findmin_pq_res(X34,X35) = X35
| ~ issmallestelement_pq(X34,X35)
| ~ contains_pq(X34,X35) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax14])])]) ).
fof(c_0_7,plain,
! [X158,X159] :
( ( pi_sharp_find_min(X158,X159)
| ~ issmallestelement_pq(X158,X159)
| ~ contains_pq(X158,X159) )
& ( ~ pi_sharp_find_min(X158,X159)
| issmallestelement_pq(X158,X159) )
& ( ~ pi_sharp_find_min(X158,X159)
| contains_pq(X158,X159) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax58])])])]) ).
cnf(c_0_8,negated_conjecture,
( findmin_cpq_res(triple(esk5_0,esk6_0,esk7_0)) != findmin_pq_res(i(triple(esk5_0,esk6_0,esk7_0)),X1)
| ~ pi_sharp_find_min(i(triple(esk5_0,esk6_0,esk7_0)),X1) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,plain,
( ~ issmallestelement_pq(X1,X2)
| ~ contains_pq(X1,X2)
| findmin_pq_res(X1,X2) = X2 ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,plain,
( ~ pi_sharp_find_min(X1,X2)
| contains_pq(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_11,plain,
( ~ pi_sharp_find_min(X1,X2)
| issmallestelement_pq(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
fof(c_0_12,lemma,
! [X174,X175,X176] :
( pi_sharp_find_min(i(triple(X174,X175,X176)),findmin_cpq_res(triple(X174,X175,X176)))
| ~ phi(findmin_cpq_eff(triple(X174,X175,X176))) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[main4_l7])])]) ).
cnf(c_0_13,negated_conjecture,
( ~ pi_sharp_find_min(i(triple(esk5_0,esk6_0,esk7_0)),X1)
| X1 != findmin_cpq_res(triple(esk5_0,esk6_0,esk7_0)) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_9]),c_0_10]),c_0_11]) ).
cnf(c_0_14,lemma,
( ~ phi(findmin_cpq_eff(triple(X1,X2,X3)))
| pi_sharp_find_min(i(triple(X1,X2,X3)),findmin_cpq_res(triple(X1,X2,X3))) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_15,negated_conjecture,
phi(findmin_cpq_eff(triple(esk5_0,esk6_0,esk7_0))),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_16,lemma,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_15])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWV417+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.35 % Computer : n019.cluster.edu
% 0.09/0.35 % Model : x86_64 x86_64
% 0.09/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.35 % Memory : 8046.5625MB
% 0.09/0.35 % OS : Linux 6.8.0-71-generic
% 0.09/0.35 % CPULimit : 300
% 0.09/0.35 % WCLimit : 300
% 0.09/0.35 % DateTime : Mon Sep 21 08:45:36 UTC 2026
% 0.09/0.35 % CPUTime :
% 0.09/0.35 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.13/0.39 Running first-order theorem proving
% 0.13/0.39 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.13/0.43 % Version: 3.5.1
% 0.13/0.43 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.13/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.43 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.13/0.43 % Starting new_bool_3 with 300s (1) cores
% 0.13/0.43 % Starting new_bool_1 with 300s (1) cores
% 0.13/0.43 % Starting sh5l with 300s (1) cores
% 0.13/0.43 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 2186845 completed with status 0
% 0.13/0.43 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.13/0.43 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.13/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.43 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.13/0.43 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.13/0.43 % No SInE strategy applied
% 0.13/0.43 % Search class: FGHSM-FFMF31-MFFFFFNN
% 0.13/0.43 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.13/0.43 % Starting SubtermCWHack with 136s (1) cores
% 0.13/0.43 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.13/0.43 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04AN with 136s (1) cores
% 0.13/0.43 % Starting new_bool_3 with 136s (1) cores
% 0.13/0.43 % Starting new_bool_1 with 136s (1) cores
% 0.13/0.43 % G-E--_301_C18_F1_URBAN_S5PRR_RG_S04AN with pid 2186854 completed with status 0
% 0.13/0.43 % Result found by G-E--_301_C18_F1_URBAN_S5PRR_RG_S04AN
% 0.13/0.43 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.13/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.43 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.13/0.43 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.13/0.43 % No SInE strategy applied
% 0.13/0.43 % Search class: FGHSM-FFMF31-MFFFFFNN
% 0.13/0.43 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.13/0.43 % Starting SubtermCWHack with 136s (1) cores
% 0.13/0.43 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.13/0.43 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04AN with 136s (1) cores
% 0.13/0.43 % Preprocessing time : 0.004 s
% 0.13/0.43
% 0.13/0.43 % Proof found!
% 0.13/0.43 % SZS status Theorem
% 0.13/0.43 % SZS output start CNFRefutation
% See solution above
% 0.13/0.43 % Parsed axioms : 64
% 0.13/0.43 % Removed by relevancy pruning/SinE : 0
% 0.13/0.43 % Initial clauses : 92
% 0.13/0.43 % Removed in clause preprocessing : 4
% 0.13/0.43 % Initial clauses in saturation : 88
% 0.13/0.43 % Processed clauses : 94
% 0.13/0.43 % ...of these trivial : 0
% 0.13/0.43 % ...subsumed : 2
% 0.13/0.43 % ...remaining for further processing : 92
% 0.13/0.43 % Other redundant clauses eliminated : 4
% 0.13/0.43 % Clauses deleted for lack of memory : 0
% 0.13/0.43 % Backward-subsumed : 0
% 0.13/0.43 % Backward-rewritten : 0
% 0.13/0.43 % Generated clauses : 177
% 0.13/0.43 % ...of the previous two non-redundant : 153
% 0.13/0.43 % ...aggressively subsumed : 0
% 0.13/0.43 % Contextual simplify-reflections : 3
% 0.13/0.43 % Paramodulations : 172
% 0.13/0.43 % Factorizations : 2
% 0.13/0.43 % NegExts : 0
% 0.13/0.43 % Equation resolutions : 4
% 0.13/0.43 % Disequality decompositions : 0
% 0.13/0.43 % Total rewrite steps : 19
% 0.13/0.43 % ...of those cached : 3
% 0.13/0.43 % Propositional unsat checks : 0
% 0.13/0.43 % Propositional check models : 0
% 0.13/0.43 % Propositional check unsatisfiable : 0
% 0.13/0.43 % Propositional clauses : 0
% 0.13/0.43 % Propositional clauses after purity: 0
% 0.13/0.43 % Propositional unsat core size : 0
% 0.13/0.43 % Propositional preprocessing time : 0.000
% 0.13/0.43 % Propositional encoding time : 0.000
% 0.13/0.43 % Propositional solver time : 0.000
% 0.13/0.43 % Success case prop preproc time : 0.000
% 0.13/0.43 % Success case prop encoding time : 0.000
% 0.13/0.43 % Success case prop solver time : 0.000
% 0.13/0.43 % Current number of processed clauses : 89
% 0.13/0.43 % Positive orientable unit clauses : 18
% 0.13/0.43 % Positive unorientable unit clauses: 2
% 0.13/0.43 % Negative unit clauses : 6
% 0.13/0.43 % Non-unit-clauses : 63
% 0.13/0.43 % Current number of unprocessed clauses: 144
% 0.13/0.43 % ...number of literals in the above : 382
% 0.13/0.43 % Current number of archived formulas : 0
% 0.13/0.43 % Current number of archived clauses : 2
% 0.13/0.43 % Clause-clause subsumption calls (NU) : 832
% 0.13/0.43 % Rec. Clause-clause subsumption calls : 678
% 0.13/0.43 % Non-unit clause-clause subsumptions : 5
% 0.13/0.43 % Unit Clause-clause subsumption calls : 67
% 0.13/0.43 % Rewrite failures with RHS unbound : 0
% 0.13/0.43 % BW rewrite match attempts : 2
% 0.13/0.43 % BW rewrite match successes : 0
% 0.13/0.43 % Condensation attempts : 0
% 0.13/0.43 % Condensation successes : 0
% 0.13/0.43 % Termbank termtop insertions : 8374
% 0.13/0.43 % Search garbage collected termcells : 1063
% 0.13/0.43
% 0.13/0.43 % -------------------------------------------------
% 0.13/0.43 % User time : 0.019 s
% 0.13/0.43 % System time : 0.004 s
% 0.13/0.43 % Total time : 0.023 s
% 0.13/0.43 % Maximum resident set size: 3968 pages
% 0.13/0.43
% 0.13/0.43 % -------------------------------------------------
% 0.13/0.43 % User time : 0.069 s
% 0.13/0.43 % System time : 0.016 s
% 0.13/0.43 % Total time : 0.085 s
% 0.13/0.43 % Maximum resident set size: 4608 pages
% 0.13/0.43 % E exiting
%------------------------------------------------------------------------------