%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SWV371+1 : TPTP v9.3.1. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% Computer : n005.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 : Fri Sep 25 03:17:29 PM UTC 2026
% Result : Theorem 3.55s 1.32s
% Output : CNFRefutation 3.55s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 9
% Syntax : Number of formulae : 42 ( 15 unt; 4 def)
% Number of atoms : 103 ( 8 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 69 ( 34 ~; 25 |; 4 &)
% ( 1 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 3 ( 2 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 10 ( 8 usr; 5 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 3 con; 0-3 aty)
% Number of variables : 55 ( 0 sgn 52 !; 3 ?; 10 :)
% Comments :
%------------------------------------------------------------------------------
fof(f53,axiom,
! [X0] : removemin_cpq_res(X0) = findmin_cpq_res(X0),
file('/export/starexec/sandbox/benchmark/Axioms/SWV007+3.ax',ax53) ).
fof(f58,axiom,
! [X0,X1] :
( pi_sharp_find_min(X0,X1)
<=> ( issmallestelement_pq(X0,X1)
& contains_pq(X0,X1) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV007+4.ax',ax58) ).
fof(f63,axiom,
! [X0,X1,X2] :
( phi(findmin_cpq_eff(triple(X0,X1,X2)))
=> contains_pq(i(triple(X0,X1,X2)),findmin_cpq_res(triple(X0,X1,X2))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l7_l8) ).
fof(f64,axiom,
! [X0,X1,X2] :
( phi(findmin_cpq_eff(triple(X0,X1,X2)))
=> issmallestelement_pq(i(triple(X0,X1,X2)),findmin_cpq_res(triple(X0,X1,X2))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l7_lX) ).
fof(f65,conjecture,
! [X0,X1,X2] :
( phi(findmin_cpq_eff(triple(X0,X1,X2)))
=> pi_sharp_find_min(i(triple(X0,X1,X2)),findmin_cpq_res(triple(X0,X1,X2))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l7_co) ).
fof(f66,negated_conjecture,
~ ! [X0,X1,X2] :
( phi(findmin_cpq_eff(triple(X0,X1,X2)))
=> pi_sharp_find_min(i(triple(X0,X1,X2)),findmin_cpq_res(triple(X0,X1,X2))) ),
inference(negated_conjecture,[status(cth)],[f65]) ).
fof(f75,plain,
! [X0,X1] :
( ( issmallestelement_pq(X0,X1)
& contains_pq(X0,X1) )
=> pi_sharp_find_min(X0,X1) ),
inference(unused_predicate_definition_removal,[],[f58]) ).
fof(f117,plain,
! [X0,X1] :
( ~ issmallestelement_pq(X0,X1)
| ~ contains_pq(X0,X1)
| pi_sharp_find_min(X0,X1) ),
inference(ennf_transformation,[],[f75]) ).
fof(f118,plain,
! [X0,X1] :
( ~ issmallestelement_pq(X0,X1)
| ~ contains_pq(X0,X1)
| pi_sharp_find_min(X0,X1) ),
inference(flattening,[],[f117]) ).
fof(f119,plain,
! [X0,X1,X2] :
( ~ phi(findmin_cpq_eff(triple(X0,X1,X2)))
| contains_pq(i(triple(X0,X1,X2)),findmin_cpq_res(triple(X0,X1,X2))) ),
inference(ennf_transformation,[],[f63]) ).
fof(f120,plain,
! [X0,X1,X2] :
( ~ phi(findmin_cpq_eff(triple(X0,X1,X2)))
| issmallestelement_pq(i(triple(X0,X1,X2)),findmin_cpq_res(triple(X0,X1,X2))) ),
inference(ennf_transformation,[],[f64]) ).
fof(f121,plain,
? [X0,X1,X2] :
( phi(findmin_cpq_eff(triple(X0,X1,X2)))
& ~ pi_sharp_find_min(i(triple(X0,X1,X2)),findmin_cpq_res(triple(X0,X1,X2))) ),
inference(ennf_transformation,[],[f66]) ).
fof(f136,plain,
( phi(findmin_cpq_eff(triple(sK2,sK3,sK4)))
& ~ pi_sharp_find_min(i(triple(sK2,sK3,sK4)),findmin_cpq_res(triple(sK2,sK3,sK4))) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK2,sK3,sK4]),skolemize(X0,sK2),skolemize(X1,sK3),skolemize(X2,sK4)],[f121]) ).
fof(f200,plain,
! [X0] : findmin_cpq_res(X0) = removemin_cpq_res(X0),
inference(cnf_transformation,[],[f53]) ).
fof(f203,plain,
! [X0,X1] :
( ~ issmallestelement_pq(X0,X1)
| ~ contains_pq(X0,X1)
| pi_sharp_find_min(X0,X1) ),
inference(cnf_transformation,[],[f118]) ).
fof(f208,plain,
! [X2,X0,X1] :
( ~ phi(findmin_cpq_eff(triple(X0,X1,X2)))
| contains_pq(i(triple(X0,X1,X2)),findmin_cpq_res(triple(X0,X1,X2))) ),
inference(cnf_transformation,[],[f119]) ).
fof(f209,plain,
! [X2,X0,X1] :
( ~ phi(findmin_cpq_eff(triple(X0,X1,X2)))
| issmallestelement_pq(i(triple(X0,X1,X2)),findmin_cpq_res(triple(X0,X1,X2))) ),
inference(cnf_transformation,[],[f120]) ).
fof(f210,plain,
phi(findmin_cpq_eff(triple(sK2,sK3,sK4))),
inference(cnf_transformation,[],[f136]) ).
fof(f211,plain,
~ pi_sharp_find_min(i(triple(sK2,sK3,sK4)),findmin_cpq_res(triple(sK2,sK3,sK4))),
inference(cnf_transformation,[],[f136]) ).
fof(f216,plain,
! [X2,X0,X1] :
( ~ phi(findmin_cpq_eff(triple(X0,X1,X2)))
| contains_pq(i(triple(X0,X1,X2)),removemin_cpq_res(triple(X0,X1,X2))) ),
inference(definition_unfolding,[],[f208,f200]) ).
fof(f217,plain,
! [X2,X0,X1] :
( ~ phi(findmin_cpq_eff(triple(X0,X1,X2)))
| issmallestelement_pq(i(triple(X0,X1,X2)),removemin_cpq_res(triple(X0,X1,X2))) ),
inference(definition_unfolding,[],[f209,f200]) ).
fof(f218,plain,
~ pi_sharp_find_min(i(triple(sK2,sK3,sK4)),removemin_cpq_res(triple(sK2,sK3,sK4))),
inference(definition_unfolding,[],[f211,f200]) ).
tcf(c_113,plain,
! [X0: $i,X1: $i] :
( pi_sharp_find_min(X0,X1)
| ~ issmallestelement_pq(X0,X1)
| ~ contains_pq(X0,X1) ),
inference(cnf_transformation,[],[f203]) ).
tcf(c_118,plain,
! [X0: $i,X1: $i,X2: $i] :
( contains_pq(i(triple(X0,X1,X2)),removemin_cpq_res(triple(X0,X1,X2)))
| ~ phi(findmin_cpq_eff(triple(X0,X1,X2))) ),
inference(cnf_transformation,[],[f216]) ).
tcf(c_119,plain,
! [X0: $i,X1: $i,X2: $i] :
( issmallestelement_pq(i(triple(X0,X1,X2)),removemin_cpq_res(triple(X0,X1,X2)))
| ~ phi(findmin_cpq_eff(triple(X0,X1,X2))) ),
inference(cnf_transformation,[],[f217]) ).
tcf(c_120,negated_conjecture,
~ pi_sharp_find_min(i(triple(sK2,sK3,sK4)),removemin_cpq_res(triple(sK2,sK3,sK4))),
inference(cnf_transformation,[],[f218]) ).
tcf(c_121,negated_conjecture,
phi(findmin_cpq_eff(triple(sK2,sK3,sK4))),
inference(cnf_transformation,[],[f210]) ).
tcf(c_754,plain,
! [X0: $i,X1: $i] :
( ~ issmallestelement_pq(X0,X1)
| ~ contains_pq(X0,X1)
| ( i(triple(sK2,sK3,sK4)) != X0 )
| ( removemin_cpq_res(triple(sK2,sK3,sK4)) != X1 ) ),
inference(resolution_lifted,[status(thm)],[c_113,c_120]) ).
tcf(c_755,plain,
( ~ issmallestelement_pq(i(triple(sK2,sK3,sK4)),removemin_cpq_res(triple(sK2,sK3,sK4)))
| ~ contains_pq(i(triple(sK2,sK3,sK4)),removemin_cpq_res(triple(sK2,sK3,sK4))) ),
inference(unflattening,[status(thm)],[c_754]) ).
tcf(c_2211,definition,
iPr_def_10 = triple(sK2,sK3,sK4),
introduced(definition,[new_symbols(definition,[iPr_def_10])],[]) ).
tcf(c_2212,definition,
iPr_def_11 = i(iPr_def_10),
introduced(definition,[new_symbols(definition,[iPr_def_11])],[]) ).
tcf(c_2213,definition,
iPr_def_12 = removemin_cpq_res(iPr_def_10),
introduced(definition,[new_symbols(definition,[iPr_def_12])],[]) ).
tcf(c_2214,definition,
iPr_def_13 = findmin_cpq_eff(iPr_def_10),
introduced(definition,[new_symbols(definition,[iPr_def_13])],[]) ).
tcf(c_2215,plain,
( ~ issmallestelement_pq(iPr_def_11,iPr_def_12)
| ~ contains_pq(iPr_def_11,iPr_def_12) ),
inference(demodulation,[status(thm)],[c_755,c_2213,c_2211,c_2212]) ).
tcf(c_2216,negated_conjecture,
phi(iPr_def_13),
inference(demodulation,[status(thm)],[c_121,c_2214]) ).
tcf(c_3913,plain,
( contains_pq(i(iPr_def_10),removemin_cpq_res(iPr_def_10))
| ~ phi(findmin_cpq_eff(triple(sK2,sK3,sK4))) ),
inference(superposition,[status(thm)],[c_2211,c_118]) ).
tcf(c_3915,plain,
( contains_pq(iPr_def_11,iPr_def_12)
| ~ phi(iPr_def_13) ),
inference(light_normalisation,[status(thm)],[c_3913,c_2211,c_2212,c_2213,c_2214]) ).
tcf(c_3916,plain,
contains_pq(iPr_def_11,iPr_def_12),
inference(forward_subsumption_resolution,[status(thm)],[c_3915,c_2216]) ).
tcf(c_3962,plain,
( issmallestelement_pq(i(iPr_def_10),removemin_cpq_res(iPr_def_10))
| ~ phi(findmin_cpq_eff(triple(sK2,sK3,sK4))) ),
inference(superposition,[status(thm)],[c_2211,c_119]) ).
tcf(c_3967,plain,
( issmallestelement_pq(iPr_def_11,iPr_def_12)
| ~ phi(iPr_def_13) ),
inference(light_normalisation,[status(thm)],[c_3962,c_2211,c_2212,c_2213,c_2214]) ).
tcf(c_3968,plain,
issmallestelement_pq(iPr_def_11,iPr_def_12),
inference(forward_subsumption_resolution,[status(thm)],[c_3967,c_2216]) ).
tcf(c_3992,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_3968,c_3916,c_2215]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWV371+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.13/0.38 % Computer : n005.cluster.edu
% 0.13/0.38 % Model : x86_64 x86_64
% 0.13/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.38 % Memory : 8046.5625MB
% 0.13/0.38 % OS : Linux 6.8.0-71-generic
% 0.13/0.38 % CPULimit : 300
% 0.13/0.38 % WCLimit : 300
% 0.13/0.38 % DateTime : Thu Sep 24 19:23:02 UTC 2026
% 0.13/0.38 % CPUTime :
% 0.13/0.38 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.13/0.42 Running first-order theorem proving
% 0.13/0.42 Running: /export/starexec/sandbox/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s fof_schedule -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.13/0.43
% 0.13/0.43 % ======== iProver multi-core TPTP/SMT =========
% 0.13/0.43
% 0.13/0.44 % Detected problem language: tptp
% 0.13/0.45 % Proving...
% 3.55/1.32 % SZS status Started for theBenchmark.p
% 3.55/1.32 % SZS status Theorem for theBenchmark.p
% 3.55/1.32
% 3.55/1.32 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 3.55/1.32
% 3.55/1.32 % ------ iProver source info
% 3.55/1.32
% 3.55/1.32 % git: date: 2026-07-19 20:42:38 +0200
% 3.55/1.32 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 3.55/1.32 % git: non_committed_changes: false
% 3.55/1.32
% 3.55/1.32 % ------ Parsing...
% 3.55/1.32 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 3.55/1.32
% 3.55/1.32 % ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe:1:0s pe:2:0s pe:4:0s pe_e sup_sim: 0 sf_s rm: 5 0s sf_e pe_s pe_e %
% 3.55/1.32
% 3.55/1.32 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 3.55/1.32
% 3.55/1.32 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 3.55/1.32 % ------ Proving...
% 3.55/1.32 % ------ Problem Properties
% 3.55/1.32
% 3.55/1.32 %
% 3.55/1.32 % clauses 73
% 3.55/1.32 % conjectures 1
% 3.55/1.32 % EPR 12
% 3.55/1.32 % Horn 56
% 3.55/1.32 % unary 28
% 3.55/1.32 % binary 25
% 3.55/1.32 % lits 140
% 3.55/1.32 % lits eq 44
% 3.55/1.32 % fd_pure 0
% 3.55/1.32 % fd_pseudo 0
% 3.55/1.32 % fd_cond 5
% 3.55/1.32 % fd_pseudo_cond 7
% 3.55/1.32 % AC symbols 0
% 3.55/1.32
% 3.55/1.32 % ------ Schedule dynamic 5 is on
% 3.55/1.32
% 3.55/1.32 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.55/1.32
% 3.55/1.32
% 3.55/1.32 % ------
% 3.55/1.32 % Current options:
% 3.55/1.32 % ------
% 3.55/1.32
% 3.55/1.32
% 3.55/1.32 %
% 3.55/1.32
% 3.55/1.32 % ------ Proving...
% 3.55/1.32 %
% 3.55/1.32
% 3.55/1.32 % SZS status Theorem for theBenchmark.p
% 3.55/1.32
% 3.55/1.32 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.55/1.32
% 3.55/1.32
%------------------------------------------------------------------------------