%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SWV372+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 : n011.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.71s 1.29s
% Output : CNFRefutation 3.71s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 8
% Syntax : Number of formulae : 52 ( 18 unt; 0 def)
% Number of atoms : 97 ( 34 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 78 ( 33 ~; 29 |; 6 &)
% ( 3 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 5 con; 0-3 aty)
% Number of variables : 110 ( 2 sgn 107 !; 3 ?; 27 :)
% Comments :
%------------------------------------------------------------------------------
fof(f39,axiom,
! [X0,X1,X2,X3] :
( contains_cpq(triple(X0,X1,X2),X3)
<=> contains_slb(X1,X3) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV007+3.ax',ax39) ).
fof(f40,axiom,
! [X0,X1] :
( ok(triple(X0,X1,bad))
<=> $false ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV007+3.ax',ax40) ).
fof(f46,axiom,
! [X0,X1] : findmin_cpq_eff(triple(X0,create_slb,X1)) = triple(X0,create_slb,bad),
file('/export/starexec/sandbox/benchmark/Axioms/SWV007+3.ax',ax46) ).
fof(f47,axiom,
! [X0,X1,X2,X3] :
( ( ~ contains_slb(X1,findmin_pqp_res(X0))
& X1 != create_slb )
=> findmin_cpq_eff(triple(X0,X1,X2)) = triple(X0,update_slb(X1,findmin_pqp_res(X0)),bad) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV007+3.ax',ax47) ).
fof(f51,axiom,
! [X0,X1,X2,X3] :
( X1 != create_slb
=> findmin_cpq_res(triple(X0,X1,X2)) = findmin_pqp_res(X0) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV007+3.ax',ax51) ).
fof(f63,axiom,
! [X0,X1,X2,X3] :
( contains_cpq(triple(X0,X1,X2),X3)
<=> contains_pq(i(triple(X0,X1,X2)),X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l8_li56) ).
fof(f65,axiom,
! [X0,X1,X2] :
( ~ ok(triple(X0,X1,X2))
=> ~ phi(triple(X0,X1,X2)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l8_lX) ).
fof(f66,conjecture,
! [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',l8_co) ).
fof(f67,negated_conjecture,
~ ! [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(negated_conjecture,[status(cth)],[f66]) ).
fof(f68,plain,
! [X0,X1] : ~ ok(triple(X0,X1,bad)),
inference(true_and_false_elimination,[],[f40]) ).
fof(f69,plain,
! [X0,X1] : ~ ok(triple(X0,X1,bad)),
inference(flattening,[],[f68]) ).
fof(f70,plain,
! [X0,X1,X2] :
( X1 != create_slb
=> findmin_cpq_res(triple(X0,X1,X2)) = findmin_pqp_res(X0) ),
inference(rectify,[],[f51]) ).
fof(f73,plain,
! [X0,X1,X2] :
( ( ~ contains_slb(X1,findmin_pqp_res(X0))
& X1 != create_slb )
=> findmin_cpq_eff(triple(X0,X1,X2)) = triple(X0,update_slb(X1,findmin_pqp_res(X0)),bad) ),
inference(rectify,[],[f47]) ).
fof(f78,plain,
! [X0,X1,X2] :
( ok(triple(X0,X1,X2))
| ~ phi(triple(X0,X1,X2)) ),
inference(ennf_transformation,[],[f65]) ).
fof(f79,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,[],[f67]) ).
fof(f82,plain,
! [X0,X1,X2] :
( create_slb = X1
| findmin_cpq_res(triple(X0,X1,X2)) = findmin_pqp_res(X0) ),
inference(ennf_transformation,[],[f70]) ).
fof(f89,plain,
! [X0,X1,X2] :
( contains_slb(X1,findmin_pqp_res(X0))
| create_slb = X1
| findmin_cpq_eff(triple(X0,X1,X2)) = triple(X0,update_slb(X1,findmin_pqp_res(X0)),bad) ),
inference(ennf_transformation,[],[f73]) ).
fof(f90,plain,
! [X0,X1,X2] :
( contains_slb(X1,findmin_pqp_res(X0))
| create_slb = X1
| findmin_cpq_eff(triple(X0,X1,X2)) = triple(X0,update_slb(X1,findmin_pqp_res(X0)),bad) ),
inference(flattening,[],[f89]) ).
fof(f101,plain,
! [X0,X1,X2,X3] :
( ( ~ contains_cpq(triple(X0,X1,X2),X3)
| contains_pq(i(triple(X0,X1,X2)),X3) )
& ( ~ contains_pq(i(triple(X0,X1,X2)),X3)
| contains_cpq(triple(X0,X1,X2),X3) ) ),
inference(nnf_transformation,[],[f63]) ).
fof(f102,plain,
( phi(findmin_cpq_eff(triple(sK0,sK1,sK2)))
& ~ contains_pq(i(triple(sK0,sK1,sK2)),findmin_cpq_res(triple(sK0,sK1,sK2))) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2)],[f79]) ).
fof(f103,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,[],[f39]) ).
fof(f112,plain,
! [X2,X3,X0,X1] :
( ~ contains_cpq(triple(X0,X1,X2),X3)
| contains_pq(i(triple(X0,X1,X2)),X3) ),
inference(cnf_transformation,[],[f101]) ).
fof(f115,plain,
! [X2,X0,X1] :
( ok(triple(X0,X1,X2))
| ~ phi(triple(X0,X1,X2)) ),
inference(cnf_transformation,[],[f78]) ).
fof(f116,plain,
phi(findmin_cpq_eff(triple(sK0,sK1,sK2))),
inference(cnf_transformation,[],[f102]) ).
fof(f117,plain,
~ contains_pq(i(triple(sK0,sK1,sK2)),findmin_cpq_res(triple(sK0,sK1,sK2))),
inference(cnf_transformation,[],[f102]) ).
fof(f119,plain,
! [X2,X3,X0,X1] :
( ~ contains_slb(X1,X3)
| contains_cpq(triple(X0,X1,X2),X3) ),
inference(cnf_transformation,[],[f103]) ).
fof(f122,plain,
! [X0,X1] : ~ ok(triple(X0,X1,bad)),
inference(cnf_transformation,[],[f69]) ).
fof(f123,plain,
! [X0,X1] : findmin_cpq_eff(triple(X0,create_slb,X1)) = triple(X0,create_slb,bad),
inference(cnf_transformation,[],[f46]) ).
fof(f125,plain,
! [X2,X0,X1] :
( create_slb = X1
| findmin_pqp_res(X0) = findmin_cpq_res(triple(X0,X1,X2)) ),
inference(cnf_transformation,[],[f82]) ).
fof(f143,plain,
! [X2,X0,X1] :
( contains_slb(X1,findmin_pqp_res(X0))
| create_slb = X1
| findmin_cpq_eff(triple(X0,X1,X2)) = triple(X0,update_slb(X1,findmin_pqp_res(X0)),bad) ),
inference(cnf_transformation,[],[f90]) ).
tcf(c_50,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( contains_pq(i(triple(X0,X1,X2)),X3)
| ~ contains_cpq(triple(X0,X1,X2),X3) ),
inference(cnf_transformation,[],[f112]) ).
tcf(c_52,plain,
! [X0: $i,X1: $i,X2: $i] :
( ok(triple(X0,X1,X2))
| ~ phi(triple(X0,X1,X2)) ),
inference(cnf_transformation,[],[f115]) ).
tcf(c_53,negated_conjecture,
~ contains_pq(i(triple(sK0,sK1,sK2)),findmin_cpq_res(triple(sK0,sK1,sK2))),
inference(cnf_transformation,[],[f117]) ).
tcf(c_54,negated_conjecture,
phi(findmin_cpq_eff(triple(sK0,sK1,sK2))),
inference(cnf_transformation,[],[f116]) ).
tcf(c_55,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( contains_cpq(triple(X2,X0,X3),X1)
| ~ contains_slb(X0,X1) ),
inference(cnf_transformation,[],[f119]) ).
tcf(c_59,plain,
! [X0: $i,X1: $i] : ~ ok(triple(X0,X1,bad)),
inference(cnf_transformation,[],[f122]) ).
tcf(c_60,plain,
! [X0: $i,X1: $i] : findmin_cpq_eff(triple(X0,create_slb,X1)) = triple(X0,create_slb,bad),
inference(cnf_transformation,[],[f123]) ).
tcf(c_62,plain,
! [X0: $i,X1: $i,X2: $i] :
( ( X1 = create_slb )
| ( findmin_cpq_res(triple(X0,X1,X2)) = findmin_pqp_res(X0) ) ),
inference(cnf_transformation,[],[f125]) ).
tcf(c_80,plain,
! [X0: $i,X1: $i,X2: $i] :
( contains_slb(X1,findmin_pqp_res(X0))
| ( X1 = create_slb )
| ( triple(X0,update_slb(X1,findmin_pqp_res(X0)),bad) = findmin_cpq_eff(triple(X0,X1,X2)) ) ),
inference(cnf_transformation,[],[f143]) ).
tcf(c_3070,plain,
~ contains_cpq(triple(sK0,sK1,sK2),findmin_cpq_res(triple(sK0,sK1,sK2))),
inference(superposition,[status(thm)],[c_50,c_53]) ).
tcf(c_3085,plain,
~ contains_slb(sK1,findmin_cpq_res(triple(sK0,sK1,sK2))),
inference(superposition,[status(thm)],[c_55,c_3070]) ).
tcf(c_3087,plain,
( ( sK1 = create_slb )
| ~ contains_slb(sK1,findmin_pqp_res(sK0)) ),
inference(superposition,[status(thm)],[c_62,c_3085]) ).
tcf(c_3539,plain,
! [X0: $i] :
( ( sK1 = create_slb )
| ( triple(sK0,update_slb(sK1,findmin_pqp_res(sK0)),bad) = findmin_cpq_eff(triple(sK0,sK1,X0)) ) ),
inference(superposition,[status(thm)],[c_80,c_3087]) ).
tcf(c_3695,plain,
! [X0: $i] :
( ok(triple(sK0,update_slb(sK1,findmin_pqp_res(sK0)),bad))
| ( sK1 = create_slb )
| ~ phi(findmin_cpq_eff(triple(sK0,sK1,X0))) ),
inference(superposition,[status(thm)],[c_3539,c_52]) ).
tcf(c_3700,plain,
! [X0: $i,X1: $i] :
( ( sK1 = create_slb )
| ( findmin_cpq_eff(triple(sK0,sK1,X0)) = findmin_cpq_eff(triple(sK0,sK1,X1)) ) ),
inference(superposition,[status(thm)],[c_3539,c_3539]) ).
tcf(c_3714,plain,
! [X0: $i] :
( ( sK1 = create_slb )
| ~ phi(findmin_cpq_eff(triple(sK0,sK1,X0))) ),
inference(forward_subsumption_resolution,[status(thm)],[c_3695,c_59]) ).
tcf(c_3778,plain,
! [X0: $i] :
( phi(findmin_cpq_eff(triple(sK0,sK1,X0)))
| ( sK1 = create_slb ) ),
inference(superposition,[status(thm)],[c_3700,c_54]) ).
tcf(c_3819,plain,
sK1 = create_slb,
inference(global_subsumption_just,[status(thm)],[c_3778,c_3714,c_3778]) ).
tcf(c_3836,plain,
phi(findmin_cpq_eff(triple(sK0,create_slb,sK2))),
inference(demodulation,[status(thm)],[c_54,c_3819]) ).
tcf(c_3837,plain,
phi(triple(sK0,create_slb,bad)),
inference(demodulation,[status(thm)],[c_3836,c_60]) ).
tcf(c_3838,plain,
ok(triple(sK0,create_slb,bad)),
inference(superposition,[status(thm)],[c_3837,c_52]) ).
tcf(c_3839,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_3838,c_59]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWV372+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.09/0.36 % Computer : n011.cluster.edu
% 0.09/0.36 % Model : x86_64 x86_64
% 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36 % Memory : 8046.5625MB
% 0.09/0.36 % OS : Linux 6.8.0-71-generic
% 0.09/0.36 % CPULimit : 300
% 0.09/0.36 % WCLimit : 300
% 0.09/0.36 % DateTime : Thu Sep 24 19:23:14 UTC 2026
% 0.09/0.36 % CPUTime :
% 0.09/0.36 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.13/0.40 Running first-order theorem proving
% 0.13/0.41 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.42
% 0.13/0.42 % ======== iProver multi-core TPTP/SMT =========
% 0.13/0.42
% 0.13/0.42 % Detected problem language: tptp
% 0.13/0.43 % Proving...
% 3.71/1.29 % SZS status Started for theBenchmark.p
% 3.71/1.29 % SZS status Theorem for theBenchmark.p
% 3.71/1.29
% 3.71/1.29 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 3.71/1.29
% 3.71/1.29 % ------ iProver source info
% 3.71/1.29
% 3.71/1.29 % git: date: 2026-07-19 20:42:38 +0200
% 3.71/1.29 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 3.71/1.29 % git: non_committed_changes: false
% 3.71/1.29
% 3.71/1.29 % ------ Parsing...
% 3.71/1.29 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 3.71/1.29
% 3.71/1.29 % ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe:1:0s pe_e sup_sim: 0 sf_s rm: 2 0s sf_e pe_s pe_e %
% 3.71/1.29
% 3.71/1.29 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 3.71/1.29
% 3.71/1.29 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 3.71/1.29 % ------ Proving...
% 3.71/1.29 % ------ Problem Properties
% 3.71/1.29
% 3.71/1.29 %
% 3.71/1.29 % clauses 44
% 3.71/1.29 % conjectures 2
% 3.71/1.29 % EPR 6
% 3.71/1.29 % Horn 33
% 3.71/1.29 % unary 14
% 3.71/1.29 % binary 21
% 3.71/1.29 % lits 85
% 3.71/1.29 % lits eq 21
% 3.71/1.29 % fd_pure 0
% 3.71/1.29 % fd_pseudo 0
% 3.71/1.29 % fd_cond 5
% 3.71/1.29 % fd_pseudo_cond 3
% 3.71/1.29 % AC symbols 0
% 3.71/1.29
% 3.71/1.29 % ------ Schedule dynamic 5 is on
% 3.71/1.29
% 3.71/1.29 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.71/1.29
% 3.71/1.29
% 3.71/1.29 % ------
% 3.71/1.29 % Current options:
% 3.71/1.29 % ------
% 3.71/1.29
% 3.71/1.29
% 3.71/1.29 %
% 3.71/1.29
% 3.71/1.29 % ------ Proving...
% 3.71/1.29 %
% 3.71/1.29
% 3.71/1.29 % SZS status Theorem for theBenchmark.p
% 3.71/1.29
% 3.71/1.29 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.71/1.29
% 3.71/1.29
%------------------------------------------------------------------------------