%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SWV373+1 : TPTP v9.3.1. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% Computer : n013.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.20s 13.19s
% Output : CNFRefutation 3.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 9
% Syntax : Number of formulae : 48 ( 20 unt; 3 def)
% Number of atoms : 101 ( 25 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 67 ( 33 ~; 21 |; 7 &)
% ( 1 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 9 ( 7 usr; 4 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 4 con; 0-3 aty)
% Number of variables : 73 ( 1 sgn 70 !; 3 ?; 19 :)
% Comments :
%------------------------------------------------------------------------------
fof(f8,axiom,
! [X0] : ~ contains_slb(create_slb,X0),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV007+2.ax',ax20) ).
fof(f27,axiom,
! [X0,X1,X2,X3] :
( contains_cpq(triple(X0,X1,X2),X3)
<=> contains_slb(X1,X3) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV007+3.ax',ax39) ).
fof(f39,axiom,
! [X0,X1,X2,X3] :
( X1 != create_slb
=> findmin_cpq_res(triple(X0,X1,X2)) = findmin_pqp_res(X0) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV007+3.ax',ax51) ).
fof(f41,axiom,
! [X0] : removemin_cpq_res(X0) = findmin_cpq_res(X0),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV007+3.ax',ax53) ).
fof(f42,axiom,
! [X0,X1,X2] :
( ok(findmin_cpq_eff(triple(X0,X1,X2)))
=> ( less_than(lookup_slb(X1,findmin_pqp_res(X0)),findmin_pqp_res(X0))
& contains_slb(X1,findmin_pqp_res(X0))
& X1 != create_slb ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l9_l10) ).
fof(f43,conjecture,
! [X0,X1,X2] :
( ~ contains_cpq(triple(X0,X1,X2),findmin_cpq_res(triple(X0,X1,X2)))
=> ~ ok(findmin_cpq_eff(triple(X0,X1,X2))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l9_co) ).
fof(f44,negated_conjecture,
~ ! [X0,X1,X2] :
( ~ contains_cpq(triple(X0,X1,X2),findmin_cpq_res(triple(X0,X1,X2)))
=> ~ ok(findmin_cpq_eff(triple(X0,X1,X2))) ),
inference(negated_conjecture,[status(cth)],[f43]) ).
fof(f52,plain,
! [X0,X1,X2] :
( X1 != create_slb
=> findmin_cpq_res(triple(X0,X1,X2)) = findmin_pqp_res(X0) ),
inference(rectify,[],[f39]) ).
fof(f82,plain,
! [X0,X1,X2] :
( create_slb = X1
| findmin_cpq_res(triple(X0,X1,X2)) = findmin_pqp_res(X0) ),
inference(ennf_transformation,[],[f52]) ).
fof(f83,plain,
! [X0,X1,X2] :
( ~ ok(findmin_cpq_eff(triple(X0,X1,X2)))
| ( less_than(lookup_slb(X1,findmin_pqp_res(X0)),findmin_pqp_res(X0))
& contains_slb(X1,findmin_pqp_res(X0))
& X1 != create_slb ) ),
inference(ennf_transformation,[],[f42]) ).
fof(f84,plain,
? [X0,X1,X2] :
( ~ contains_cpq(triple(X0,X1,X2),findmin_cpq_res(triple(X0,X1,X2)))
& ok(findmin_cpq_eff(triple(X0,X1,X2))) ),
inference(ennf_transformation,[],[f44]) ).
fof(f90,plain,
! [X0,X1,X2,X3] :
( ( ~ contains_cpq(triple(X0,X1,X2),X3)
| contains_slb(X1,X3) )
& ( ~ contains_slb(X1,X3)
| contains_cpq(triple(X0,X1,X2),X3) ) ),
inference(nnf_transformation,[],[f27]) ).
fof(f91,plain,
( ~ contains_cpq(triple(sK0,sK1,sK2),findmin_cpq_res(triple(sK0,sK1,sK2)))
& ok(findmin_cpq_eff(triple(sK0,sK1,sK2))) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2)],[f84]) ).
fof(f99,plain,
! [X0] : ~ contains_slb(create_slb,X0),
inference(cnf_transformation,[],[f8]) ).
fof(f124,plain,
! [X2,X3,X0,X1] :
( ~ contains_cpq(triple(X0,X1,X2),X3)
| contains_slb(X1,X3) ),
inference(cnf_transformation,[],[f90]) ).
fof(f125,plain,
! [X2,X3,X0,X1] :
( ~ contains_slb(X1,X3)
| contains_cpq(triple(X0,X1,X2),X3) ),
inference(cnf_transformation,[],[f90]) ).
fof(f137,plain,
! [X2,X0,X1] :
( create_slb = X1
| findmin_pqp_res(X0) = findmin_cpq_res(triple(X0,X1,X2)) ),
inference(cnf_transformation,[],[f82]) ).
fof(f139,plain,
! [X0] : findmin_cpq_res(X0) = removemin_cpq_res(X0),
inference(cnf_transformation,[],[f41]) ).
fof(f141,plain,
! [X2,X0,X1] :
( ~ ok(findmin_cpq_eff(triple(X0,X1,X2)))
| contains_slb(X1,findmin_pqp_res(X0)) ),
inference(cnf_transformation,[],[f83]) ).
fof(f143,plain,
~ contains_cpq(triple(sK0,sK1,sK2),findmin_cpq_res(triple(sK0,sK1,sK2))),
inference(cnf_transformation,[],[f91]) ).
fof(f144,plain,
ok(findmin_cpq_eff(triple(sK0,sK1,sK2))),
inference(cnf_transformation,[],[f91]) ).
fof(f148,plain,
! [X2,X0,X1] :
( create_slb = X1
| findmin_pqp_res(X0) = removemin_cpq_res(triple(X0,X1,X2)) ),
inference(definition_unfolding,[],[f137,f139]) ).
fof(f149,plain,
~ contains_cpq(triple(sK0,sK1,sK2),removemin_cpq_res(triple(sK0,sK1,sK2))),
inference(definition_unfolding,[],[f143,f139]) ).
tcf(c_56,plain,
! [X0: $i] : ~ contains_slb(create_slb,X0),
inference(cnf_transformation,[],[f99]) ).
tcf(c_81,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( contains_cpq(triple(X2,X0,X3),X1)
| ~ contains_slb(X0,X1) ),
inference(cnf_transformation,[],[f125]) ).
tcf(c_82,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( contains_slb(X1,X3)
| ~ contains_cpq(triple(X0,X1,X2),X3) ),
inference(cnf_transformation,[],[f124]) ).
tcf(c_94,plain,
! [X0: $i,X1: $i,X2: $i] :
( ( X1 = create_slb )
| ( removemin_cpq_res(triple(X0,X1,X2)) = findmin_pqp_res(X0) ) ),
inference(cnf_transformation,[],[f148]) ).
tcf(c_96,plain,
! [X0: $i,X1: $i,X2: $i] :
( contains_slb(X1,findmin_pqp_res(X0))
| ~ ok(findmin_cpq_eff(triple(X0,X1,X2))) ),
inference(cnf_transformation,[],[f141]) ).
tcf(c_98,negated_conjecture,
ok(findmin_cpq_eff(triple(sK0,sK1,sK2))),
inference(cnf_transformation,[],[f144]) ).
tcf(c_99,negated_conjecture,
~ contains_cpq(triple(sK0,sK1,sK2),removemin_cpq_res(triple(sK0,sK1,sK2))),
inference(cnf_transformation,[],[f149]) ).
tcf(c_1042,definition,
iPr_def_10 = triple(sK0,sK1,sK2),
introduced(definition,[new_symbols(definition,[iPr_def_10])],[]) ).
tcf(c_1043,definition,
iPr_def_11 = removemin_cpq_res(iPr_def_10),
introduced(definition,[new_symbols(definition,[iPr_def_11])],[]) ).
tcf(c_1044,definition,
iPr_def_12 = findmin_cpq_eff(iPr_def_10),
introduced(definition,[new_symbols(definition,[iPr_def_12])],[]) ).
tcf(c_1045,negated_conjecture,
~ contains_cpq(iPr_def_10,iPr_def_11),
inference(demodulation,[status(thm)],[c_99,c_1043,c_1042]) ).
tcf(c_1046,negated_conjecture,
ok(iPr_def_12),
inference(demodulation,[status(thm)],[c_98,c_1044]) ).
tcf(c_1649,plain,
! [X0: $i] :
( contains_cpq(iPr_def_10,X0)
| ~ contains_slb(sK1,X0) ),
inference(superposition,[status(thm)],[c_1042,c_81]) ).
tcf(c_1668,plain,
! [X0: $i] :
( contains_slb(sK1,X0)
| ~ contains_cpq(iPr_def_10,X0) ),
inference(superposition,[status(thm)],[c_1042,c_82]) ).
tcf(c_1741,plain,
( contains_slb(sK1,findmin_pqp_res(sK0))
| ~ ok(findmin_cpq_eff(iPr_def_10)) ),
inference(superposition,[status(thm)],[c_1042,c_96]) ).
tcf(c_1742,plain,
( contains_slb(sK1,findmin_pqp_res(sK0))
| ~ ok(iPr_def_12) ),
inference(light_normalisation,[status(thm)],[c_1741,c_1044]) ).
tcf(c_1743,plain,
contains_slb(sK1,findmin_pqp_res(sK0)),
inference(forward_subsumption_resolution,[status(thm)],[c_1742,c_1046]) ).
tcf(c_1747,plain,
contains_cpq(iPr_def_10,findmin_pqp_res(sK0)),
inference(superposition,[status(thm)],[c_1743,c_1649]) ).
tcf(c_1821,plain,
( ( create_slb = sK1 )
| ( removemin_cpq_res(iPr_def_10) = findmin_pqp_res(sK0) ) ),
inference(superposition,[status(thm)],[c_1042,c_94]) ).
tcf(c_1823,plain,
( ( create_slb = sK1 )
| ( findmin_pqp_res(sK0) = iPr_def_11 ) ),
inference(light_normalisation,[status(thm)],[c_1821,c_1043]) ).
tcf(c_1885,plain,
( contains_cpq(iPr_def_10,iPr_def_11)
| ( create_slb = sK1 ) ),
inference(superposition,[status(thm)],[c_1823,c_1747]) ).
tcf(c_1889,plain,
create_slb = sK1,
inference(forward_subsumption_resolution,[status(thm)],[c_1885,c_1045]) ).
tcf(c_1892,plain,
! [X0: $i] :
( contains_slb(create_slb,X0)
| ~ contains_cpq(iPr_def_10,X0) ),
inference(demodulation,[status(thm)],[c_1668,c_1889]) ).
tcf(c_1895,plain,
! [X0: $i] : ~ contains_cpq(iPr_def_10,X0),
inference(forward_subsumption_resolution,[status(thm)],[c_1892,c_56]) ).
tcf(c_1896,plain,
$false,
inference(backward_subsumption_resolution,[status(thm)],[c_1747,c_1895]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWV373+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.05 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.13/12.27 % Computer : n013.cluster.edu
% 0.13/12.27 % Model : x86_64 x86_64
% 0.13/12.27 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/12.27 % Memory : 8046.5625MB
% 0.13/12.27 % OS : Linux 6.8.0-71-generic
% 0.13/12.27 % CPULimit : 300
% 0.13/12.27 % WCLimit : 300
% 0.13/12.27 % DateTime : Thu Sep 24 19:23:59 UTC 2026
% 0.13/12.27 % CPUTime :
% 0.13/12.27 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.16/12.31 Running first-order theorem proving
% 0.16/12.31 Running: /export/starexec/sandbox2/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s fof_schedule -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.16/12.32
% 0.16/12.32 % ======== iProver multi-core TPTP/SMT =========
% 0.16/12.32
% 0.16/12.33 % Detected problem language: tptp
% 0.16/12.34 % Proving...
% 3.20/13.19 % SZS status Started for theBenchmark.p
% 3.20/13.19 % SZS status Theorem for theBenchmark.p
% 3.20/13.19
% 3.20/13.19 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 3.20/13.19
% 3.20/13.19 % ------ iProver source info
% 3.20/13.19
% 3.20/13.19 % git: date: 2026-07-19 20:42:38 +0200
% 3.20/13.19 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 3.20/13.19 % git: non_committed_changes: false
% 3.20/13.19
% 3.20/13.19 % ------ Parsing...
% 3.20/13.19 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 3.20/13.19
% 3.20/13.19 % ------ Preprocessing... sup_sim: 2 sf_s rm: 7 0s sf_e pe_s pe:1:0s pe:2:0s pe_e sup_sim: 0 sf_s rm: 4 0s sf_e pe_s pe_e %
% 3.20/13.19
% 3.20/13.19 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 3.20/13.19
% 3.20/13.19 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 3.20/13.19 % ------ Proving...
% 3.20/13.19 % ------ Problem Properties
% 3.20/13.19
% 3.20/13.19 %
% 3.20/13.19 % clauses 46
% 3.20/13.19 % conjectures 2
% 3.20/13.19 % EPR 8
% 3.20/13.19 % Horn 32
% 3.20/13.19 % unary 20
% 3.20/13.19 % binary 14
% 3.20/13.19 % lits 85
% 3.20/13.19 % lits eq 31
% 3.20/13.19 % fd_pure 0
% 3.20/13.19 % fd_pseudo 0
% 3.20/13.19 % fd_cond 5
% 3.20/13.19 % fd_pseudo_cond 5
% 3.20/13.19 % AC symbols 0
% 3.20/13.19
% 3.20/13.19 % ------ Schedule dynamic 5 is on
% 3.20/13.19
% 3.20/13.19 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.20/13.19
% 3.20/13.19
% 3.20/13.19 % ------
% 3.20/13.19 % Current options:
% 3.20/13.19 % ------
% 3.20/13.19
% 3.20/13.19
% 3.20/13.19 %
% 3.20/13.19
% 3.20/13.19 % ------ Proving...
% 3.20/13.19 %
% 3.20/13.19
% 3.20/13.19 % SZS status Theorem for theBenchmark.p
% 3.20/13.19
% 3.20/13.19 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.20/13.19
% 3.20/13.19
%------------------------------------------------------------------------------