%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SWV374+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 : n014.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 0.74s 1.20s
% Output : CNFRefutation 0.74s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 7
% Syntax : Number of formulae : 53 ( 13 unt; 0 def)
% Number of atoms : 136 ( 57 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 125 ( 42 ~; 60 |; 14 &)
% ( 2 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 5 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 5 con; 0-3 aty)
% Number of variables : 104 ( 2 sgn 101 !; 3 ?; 37 :)
% Comments :
%------------------------------------------------------------------------------
fof(f2,axiom,
! [X0,X1] :
( less_than(X1,X0)
| less_than(X0,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV007+0.ax',totality) ).
fof(f4,axiom,
! [X0,X1] :
( strictly_less_than(X0,X1)
<=> ( ~ less_than(X1,X0)
& less_than(X0,X1) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV007+0.ax',stricly_smaller_definition) ).
fof(f28,axiom,
! [X0,X1] :
( ok(triple(X0,X1,bad))
<=> $false ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV007+3.ax',ax40) ).
fof(f34,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(f35,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(f36,axiom,
! [X0,X1,X2,X3] :
( ( strictly_less_than(findmin_pqp_res(X0),lookup_slb(X1,findmin_pqp_res(X0)))
& 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',ax48) ).
fof(f42,conjecture,
! [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/sandbox/benchmark/theBenchmark.p',l10_co) ).
fof(f43,negated_conjecture,
~ ! [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(negated_conjecture,[status(cth)],[f42]) ).
fof(f45,plain,
! [X0,X1,X2] :
( ( strictly_less_than(findmin_pqp_res(X0),lookup_slb(X1,findmin_pqp_res(X0)))
& 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,[],[f36]) ).
fof(f46,plain,
! [X0,X1] : ~ ok(triple(X0,X1,bad)),
inference(true_and_false_elimination,[],[f28]) ).
fof(f47,plain,
! [X0,X1] : ~ ok(triple(X0,X1,bad)),
inference(flattening,[],[f46]) ).
fof(f48,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,[],[f35]) ).
fof(f50,plain,
! [X0,X1] :
( ( ~ less_than(X1,X0)
& less_than(X0,X1) )
=> strictly_less_than(X0,X1) ),
inference(unused_predicate_definition_removal,[],[f4]) ).
fof(f51,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))
| create_slb = X1 ) ),
inference(ennf_transformation,[],[f43]) ).
fof(f56,plain,
! [X0,X1,X2] :
( ~ strictly_less_than(findmin_pqp_res(X0),lookup_slb(X1,findmin_pqp_res(X0)))
| ~ 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,[],[f45]) ).
fof(f57,plain,
! [X0,X1,X2] :
( ~ strictly_less_than(findmin_pqp_res(X0),lookup_slb(X1,findmin_pqp_res(X0)))
| ~ 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,[],[f56]) ).
fof(f61,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,[],[f48]) ).
fof(f62,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,[],[f61]) ).
fof(f67,plain,
! [X0,X1] :
( less_than(X1,X0)
| ~ less_than(X0,X1)
| strictly_less_than(X0,X1) ),
inference(ennf_transformation,[],[f50]) ).
fof(f68,plain,
! [X0,X1] :
( less_than(X1,X0)
| ~ less_than(X0,X1)
| strictly_less_than(X0,X1) ),
inference(flattening,[],[f67]) ).
fof(f71,plain,
( ok(findmin_cpq_eff(triple(sK0,sK1,sK2)))
& ( ~ less_than(lookup_slb(sK1,findmin_pqp_res(sK0)),findmin_pqp_res(sK0))
| ~ contains_slb(sK1,findmin_pqp_res(sK0))
| create_slb = sK1 ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2)],[f51]) ).
fof(f74,plain,
ok(findmin_cpq_eff(triple(sK0,sK1,sK2))),
inference(cnf_transformation,[],[f71]) ).
fof(f75,plain,
( ~ less_than(lookup_slb(sK1,findmin_pqp_res(sK0)),findmin_pqp_res(sK0))
| ~ contains_slb(sK1,findmin_pqp_res(sK0))
| create_slb = sK1 ),
inference(cnf_transformation,[],[f71]) ).
fof(f77,plain,
! [X0,X1] :
( less_than(X1,X0)
| less_than(X0,X1) ),
inference(cnf_transformation,[],[f2]) ).
fof(f84,plain,
! [X2,X0,X1] :
( ~ strictly_less_than(findmin_pqp_res(X0),lookup_slb(X1,findmin_pqp_res(X0)))
| ~ 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,[],[f57]) ).
fof(f88,plain,
! [X0,X1] : ~ ok(triple(X0,X1,bad)),
inference(cnf_transformation,[],[f47]) ).
fof(f89,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,[],[f62]) ).
fof(f90,plain,
! [X0,X1] : findmin_cpq_eff(triple(X0,create_slb,X1)) = triple(X0,create_slb,bad),
inference(cnf_transformation,[],[f34]) ).
fof(f96,plain,
! [X0,X1] :
( less_than(X1,X0)
| ~ less_than(X0,X1)
| strictly_less_than(X0,X1) ),
inference(cnf_transformation,[],[f68]) ).
tcf(c_49,negated_conjecture,
( ( create_slb = sK1 )
| ~ contains_slb(sK1,findmin_pqp_res(sK0))
| ~ less_than(lookup_slb(sK1,findmin_pqp_res(sK0)),findmin_pqp_res(sK0)) ),
inference(cnf_transformation,[],[f75]) ).
tcf(c_50,negated_conjecture,
ok(findmin_cpq_eff(triple(sK0,sK1,sK2))),
inference(cnf_transformation,[],[f74]) ).
tcf(c_52,plain,
! [X0: $i,X1: $i] :
( less_than(X1,X0)
| less_than(X0,X1) ),
inference(cnf_transformation,[],[f77]) ).
tcf(c_59,plain,
! [X0: $i,X1: $i,X2: $i] :
( ( X1 = create_slb )
| ( triple(X0,update_slb(X1,findmin_pqp_res(X0)),bad) = findmin_cpq_eff(triple(X0,X1,X2)) )
| ~ contains_slb(X1,findmin_pqp_res(X0))
| ~ strictly_less_than(findmin_pqp_res(X0),lookup_slb(X1,findmin_pqp_res(X0))) ),
inference(cnf_transformation,[],[f84]) ).
tcf(c_63,plain,
! [X0: $i,X1: $i] : ~ ok(triple(X0,X1,bad)),
inference(cnf_transformation,[],[f88]) ).
tcf(c_64,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,[],[f89]) ).
tcf(c_65,plain,
! [X0: $i,X1: $i] : findmin_cpq_eff(triple(X0,create_slb,X1)) = triple(X0,create_slb,bad),
inference(cnf_transformation,[],[f90]) ).
tcf(c_71,plain,
! [X0: $i,X1: $i] :
( strictly_less_than(X0,X1)
| less_than(X1,X0)
| ~ less_than(X0,X1) ),
inference(cnf_transformation,[],[f96]) ).
tcf(c_98,plain,
! [X0: $i,X1: $i] :
( strictly_less_than(X0,X1)
| less_than(X1,X0) ),
inference(global_subsumption_just,[status(thm)],[c_71,c_52,c_71]) ).
tcf(c_99,plain,
! [X0: $i,X1: $i] :
( strictly_less_than(X1,X0)
| less_than(X0,X1) ),
inference(renaming,[status(thm)],[c_98]) ).
tcf(c_100,plain,
! [X0: $i,X1: $i,X2: $i] :
( ( X1 = create_slb )
| ( triple(X0,update_slb(X1,findmin_pqp_res(X0)),bad) = findmin_cpq_eff(triple(X0,X1,X2)) )
| ~ strictly_less_than(findmin_pqp_res(X0),lookup_slb(X1,findmin_pqp_res(X0))) ),
inference(global_subsumption_just,[status(thm)],[c_59,c_64,c_59]) ).
tcf(c_323,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i] :
( less_than(X2,X3)
| ( X0 = create_slb )
| ( triple(X1,update_slb(X0,findmin_pqp_res(X1)),bad) = findmin_cpq_eff(triple(X1,X0,X4)) )
| ( findmin_pqp_res(X1) != X3 )
| ( lookup_slb(X0,findmin_pqp_res(X1)) != X2 ) ),
inference(resolution_lifted,[status(thm)],[c_100,c_99]) ).
tcf(c_324,plain,
! [X0: $i,X1: $i,X2: $i] :
( less_than(lookup_slb(X1,findmin_pqp_res(X0)),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(unflattening,[status(thm)],[c_323]) ).
tcf(c_918,plain,
! [X0: $i] :
( ( create_slb = sK1 )
| ( triple(sK0,update_slb(sK1,findmin_pqp_res(sK0)),bad) = findmin_cpq_eff(triple(sK0,sK1,X0)) )
| ~ contains_slb(sK1,findmin_pqp_res(sK0)) ),
inference(superposition,[status(thm)],[c_324,c_49]) ).
tcf(c_1898,plain,
! [X0: $i,X1: $i] :
( ( create_slb = sK1 )
| ( triple(sK0,update_slb(sK1,findmin_pqp_res(sK0)),bad) = findmin_cpq_eff(triple(sK0,sK1,X1)) )
| ( triple(sK0,update_slb(sK1,findmin_pqp_res(sK0)),bad) = findmin_cpq_eff(triple(sK0,sK1,X0)) ) ),
inference(superposition,[status(thm)],[c_64,c_918]) ).
tcf(c_1921,plain,
! [X0: $i] :
( ( create_slb = sK1 )
| ( triple(sK0,update_slb(sK1,findmin_pqp_res(sK0)),bad) = findmin_cpq_eff(triple(sK0,sK1,X0)) )
| ~ contains_slb(sK1,findmin_pqp_res(sK0)) ),
inference(superposition,[status(thm)],[c_324,c_49]) ).
tcf(c_2353,plain,
! [X0: $i] :
( ( create_slb = sK1 )
| ( triple(sK0,update_slb(sK1,findmin_pqp_res(sK0)),bad) = findmin_cpq_eff(triple(sK0,sK1,X0)) )
| ( triple(sK0,update_slb(sK1,findmin_pqp_res(sK0)),bad) != triple(sK0,update_slb(sK1,findmin_pqp_res(sK0)),bad) ) ),
inference(equality_factoring,[status(thm)],[c_1898]) ).
tcf(c_2361,plain,
! [X0: $i] :
( ( create_slb = sK1 )
| ( triple(sK0,update_slb(sK1,findmin_pqp_res(sK0)),bad) = findmin_cpq_eff(triple(sK0,sK1,X0)) ) ),
inference(equality_resolution_simp,[status(thm)],[c_2353]) ).
tcf(c_2614,plain,
! [X0: $i] :
( ( create_slb = sK1 )
| ( triple(sK0,update_slb(sK1,findmin_pqp_res(sK0)),bad) = findmin_cpq_eff(triple(sK0,sK1,X0)) ) ),
inference(global_subsumption_just,[status(thm)],[c_1921,c_2361]) ).
tcf(c_2622,plain,
! [X0: $i] :
( ( create_slb = sK1 )
| ~ ok(findmin_cpq_eff(triple(sK0,sK1,X0))) ),
inference(superposition,[status(thm)],[c_2614,c_63]) ).
tcf(c_2632,plain,
create_slb = sK1,
inference(superposition,[status(thm)],[c_50,c_2622]) ).
tcf(c_2634,plain,
ok(findmin_cpq_eff(triple(sK0,create_slb,sK2))),
inference(demodulation,[status(thm)],[c_50,c_2632]) ).
tcf(c_2663,plain,
ok(triple(sK0,create_slb,bad)),
inference(demodulation,[status(thm)],[c_2634,c_65]) ).
tcf(c_2664,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_2663,c_63]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWV374+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.08/0.36 % Computer : n014.cluster.edu
% 0.08/0.36 % Model : x86_64 x86_64
% 0.08/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.36 % Memory : 8046.5625MB
% 0.08/0.36 % OS : Linux 6.8.0-71-generic
% 0.08/0.36 % CPULimit : 300
% 0.08/0.36 % WCLimit : 300
% 0.08/0.36 % DateTime : Thu Sep 24 19:23:49 UTC 2026
% 0.08/0.37 % CPUTime :
% 0.08/0.37 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.13/0.40 Running first-order theorem proving
% 0.13/0.40 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.41
% 0.13/0.41 % ======== iProver multi-core TPTP/SMT =========
% 0.13/0.41
% 0.13/0.42 % Detected problem language: tptp
% 0.13/0.43 % Proving...
% 0.74/1.20 % SZS status Started for theBenchmark.p
% 0.74/1.20 % SZS status Theorem for theBenchmark.p
% 0.74/1.20
% 0.74/1.20 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 0.74/1.20
% 0.74/1.20 % ------ iProver source info
% 0.74/1.20
% 0.74/1.20 % git: date: 2026-07-19 20:42:38 +0200
% 0.74/1.20 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 0.74/1.20 % git: non_committed_changes: false
% 0.74/1.20
% 0.74/1.20 % ------ Parsing...
% 0.74/1.20 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 0.74/1.20
% 0.74/1.20 % ------ Preprocessing... sup_sim: 0 sf_s rm: 5 0s sf_e pe_s pe:1:0s pe_e sup_sim: 0 sf_s rm: 3 0s sf_e pe_s pe_e %
% 0.74/1.20
% 0.74/1.20 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 0.74/1.20
% 0.74/1.20 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 0.74/1.20 % ------ Proving...
% 0.74/1.20 % ------ Problem Properties
% 0.74/1.20
% 0.74/1.20 %
% 0.74/1.20 % clauses 24
% 0.74/1.20 % conjectures 2
% 0.74/1.20 % EPR 5
% 0.74/1.20 % Horn 14
% 0.74/1.20 % unary 10
% 0.74/1.20 % binary 7
% 0.74/1.20 % lits 46
% 0.74/1.20 % lits eq 20
% 0.74/1.20 % fd_pure 0
% 0.74/1.20 % fd_pseudo 0
% 0.74/1.20 % fd_cond 5
% 0.74/1.20 % fd_pseudo_cond 2
% 0.74/1.20 % AC symbols 0
% 0.74/1.20
% 0.74/1.20 % ------ Schedule dynamic 5 is on
% 0.74/1.20
% 0.74/1.20 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 0.74/1.20
% 0.74/1.20
% 0.74/1.20 % ------
% 0.74/1.20 % Current options:
% 0.74/1.20 % ------
% 0.74/1.20
% 0.74/1.20
% 0.74/1.20 %
% 0.74/1.20
% 0.74/1.20 % ------ Proving...
% 0.74/1.20 %
% 0.74/1.20
% 0.74/1.20 % SZS status Theorem for theBenchmark.p
% 0.74/1.20
% 0.74/1.20 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.74/1.21
% 0.74/1.21
%------------------------------------------------------------------------------