%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SWV134+1 : TPTP v9.3.1. Bugfixed v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% Computer : n012.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:16:30 PM UTC 2026
% Result : Theorem 3.69s 1.10s
% Output : CNFRefutation 3.69s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 4
% Syntax : Number of formulae : 24 ( 9 unt; 0 def)
% Number of atoms : 86 ( 0 equ)
% Maximal formula atoms : 12 ( 3 avg)
% Number of connectives : 86 ( 24 ~; 15 |; 43 &)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 8 con; 0-2 aty)
% Number of variables : 24 ( 0 sgn 24 !; 0 ?; 6 :)
% Comments :
%------------------------------------------------------------------------------
fof(f5,axiom,
! [X0,X1,X2] :
( ( leq(X1,X2)
& leq(X0,X1) )
=> leq(X0,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV003+0.ax',transitivity_leq) ).
fof(f8,axiom,
! [X0,X1] :
( gt(X1,X0)
=> leq(X0,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV003+0.ax',leq_gt1) ).
fof(f53,conjecture,
( ( leq(a_select2(s_values7,pv1325),a_select2(s_values7,s_sworst7))
& leq(a_select2(s_values7,pv1325),a_select2(s_values7,s_best7))
& leq(pv1325,n3)
& leq(s_worst7,n3)
& leq(s_sworst7,n3)
& leq(s_best7,n3)
& leq(n2,pv1325)
& leq(n0,s_worst7)
& leq(n0,s_sworst7)
& leq(n0,s_best7)
& ~ leq(a_select2(s_values7,pv1325),a_select2(s_values7,s_worst7)) )
=> leq(n0,pv1325) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',gauss_array_0004) ).
fof(f54,negated_conjecture,
~ ( ( leq(a_select2(s_values7,pv1325),a_select2(s_values7,s_sworst7))
& leq(a_select2(s_values7,pv1325),a_select2(s_values7,s_best7))
& leq(pv1325,n3)
& leq(s_worst7,n3)
& leq(s_sworst7,n3)
& leq(s_best7,n3)
& leq(n2,pv1325)
& leq(n0,s_worst7)
& leq(n0,s_sworst7)
& leq(n0,s_best7)
& ~ leq(a_select2(s_values7,pv1325),a_select2(s_values7,s_worst7)) )
=> leq(n0,pv1325) ),
inference(negated_conjecture,[status(cth)],[f53]) ).
fof(f65,axiom,
gt(n2,n0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',gt_2_0) ).
fof(f98,plain,
! [X0,X1,X2] :
( ~ leq(X1,X2)
| ~ leq(X0,X1)
| leq(X0,X2) ),
inference(ennf_transformation,[],[f5]) ).
fof(f99,plain,
! [X0,X1,X2] :
( ~ leq(X1,X2)
| ~ leq(X0,X1)
| leq(X0,X2) ),
inference(flattening,[],[f98]) ).
fof(f100,plain,
! [X0,X1] :
( ~ gt(X1,X0)
| leq(X0,X1) ),
inference(ennf_transformation,[],[f8]) ).
fof(f136,plain,
( leq(a_select2(s_values7,pv1325),a_select2(s_values7,s_sworst7))
& leq(a_select2(s_values7,pv1325),a_select2(s_values7,s_best7))
& leq(pv1325,n3)
& leq(s_worst7,n3)
& leq(s_sworst7,n3)
& leq(s_best7,n3)
& leq(n2,pv1325)
& leq(n0,s_worst7)
& leq(n0,s_sworst7)
& leq(n0,s_best7)
& ~ leq(a_select2(s_values7,pv1325),a_select2(s_values7,s_worst7))
& ~ leq(n0,pv1325) ),
inference(ennf_transformation,[],[f54]) ).
fof(f137,plain,
( leq(a_select2(s_values7,pv1325),a_select2(s_values7,s_sworst7))
& leq(a_select2(s_values7,pv1325),a_select2(s_values7,s_best7))
& leq(pv1325,n3)
& leq(s_worst7,n3)
& leq(s_sworst7,n3)
& leq(s_best7,n3)
& leq(n2,pv1325)
& leq(n0,s_worst7)
& leq(n0,s_sworst7)
& leq(n0,s_best7)
& ~ leq(a_select2(s_values7,pv1325),a_select2(s_values7,s_worst7))
& ~ leq(n0,pv1325) ),
inference(flattening,[],[f136]) ).
fof(f194,plain,
! [X2,X0,X1] :
( ~ leq(X1,X2)
| ~ leq(X0,X1)
| leq(X0,X2) ),
inference(cnf_transformation,[],[f99]) ).
fof(f195,plain,
! [X0,X1] :
( ~ gt(X1,X0)
| leq(X0,X1) ),
inference(cnf_transformation,[],[f100]) ).
fof(f306,plain,
leq(n2,pv1325),
inference(cnf_transformation,[],[f137]) ).
fof(f311,plain,
~ leq(n0,pv1325),
inference(cnf_transformation,[],[f137]) ).
fof(f322,plain,
gt(n2,n0),
inference(cnf_transformation,[],[f65]) ).
tcf(c_53,plain,
! [X0: $i,X1: $i,X2: $i] :
( leq(X0,X2)
| ~ leq(X1,X2)
| ~ leq(X0,X1) ),
inference(cnf_transformation,[],[f194]) ).
tcf(c_54,plain,
! [X0: $i,X1: $i] :
( leq(X1,X0)
| ~ gt(X0,X1) ),
inference(cnf_transformation,[],[f195]) ).
tcf(c_157,negated_conjecture,
~ leq(n0,pv1325),
inference(cnf_transformation,[],[f311]) ).
tcf(c_162,negated_conjecture,
leq(n2,pv1325),
inference(cnf_transformation,[],[f306]) ).
tcf(c_179,plain,
gt(n2,n0),
inference(cnf_transformation,[],[f322]) ).
tcf(c_8755,plain,
leq(n0,n2),
inference(superposition,[status(thm)],[c_179,c_54]) ).
tcf(c_9844,plain,
! [X0: $i] :
( leq(n0,pv1325)
| ~ leq(n0,X0)
| ~ leq(X0,pv1325) ),
inference(instantiation,[status(thm)],[c_53]) ).
tcf(c_10597,plain,
( leq(n0,pv1325)
| ~ leq(n2,pv1325)
| ~ leq(n0,n2) ),
inference(instantiation,[status(thm)],[c_9844]) ).
tcf(c_10598,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_10597,c_8755,c_157,c_162]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : SWV134+1 : TPTP v9.3.1. Bugfixed v3.3.0.
% 0.00/0.02 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.05/0.30 % Computer : n012.cluster.edu
% 0.05/0.30 % Model : x86_64 x86_64
% 0.05/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.05/0.30 % Memory : 8046.5625MB
% 0.05/0.30 % OS : Linux 6.8.0-71-generic
% 0.05/0.30 % CPULimit : 300
% 0.05/0.30 % WCLimit : 300
% 0.05/0.30 % DateTime : Thu Sep 24 18:35:09 UTC 2026
% 0.05/0.30 % CPUTime :
% 0.05/0.30 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.05/0.33 Running first-order theorem proving
% 0.05/0.33 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.08/0.34
% 0.08/0.34 % ======== iProver multi-core TPTP/SMT =========
% 0.08/0.34
% 0.08/0.34 % Detected problem language: tptp
% 0.08/0.34 % Proving...
% 3.69/1.10 % SZS status Started for theBenchmark.p
% 3.69/1.10 % SZS status Theorem for theBenchmark.p
% 3.69/1.10
% 3.69/1.10 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 3.69/1.10
% 3.69/1.10 % ------ iProver source info
% 3.69/1.10
% 3.69/1.10 % git: date: 2026-07-19 20:42:38 +0200
% 3.69/1.10 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 3.69/1.10 % git: non_committed_changes: false
% 3.69/1.10
% 3.69/1.10 % ------ Parsing...
% 3.69/1.10 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 3.69/1.10
% 3.69/1.10 % ------ Preprocessing... sup_sim: 15 sf_s rm: 1 0s sf_e pe_s pe_e %
% 3.69/1.10
% 3.69/1.10 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 3.69/1.10
% 3.69/1.10 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 3.69/1.10 % ------ Proving...
% 3.69/1.10 % ------ Problem Properties
% 3.69/1.10
% 3.69/1.10 %
% 3.69/1.10 % clauses 156
% 3.69/1.10 % conjectures 12
% 3.69/1.10 % EPR 48
% 3.69/1.10 % Horn 106
% 3.69/1.10 % unary 62
% 3.69/1.10 % binary 34
% 3.69/1.10 % lits 495
% 3.69/1.10 % lits eq 117
% 3.69/1.10 % fd_pure 0
% 3.69/1.10 % fd_pseudo 0
% 3.69/1.10 % fd_cond 6
% 3.69/1.10 % fd_pseudo_cond 4
% 3.69/1.10 % AC symbols 0
% 3.69/1.10
% 3.69/1.10 % ------ Schedule dynamic 5 is on
% 3.69/1.10
% 3.69/1.10 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.69/1.10
% 3.69/1.10
% 3.69/1.10 % ------
% 3.69/1.10 % Current options:
% 3.69/1.10 % ------
% 3.69/1.10
% 3.69/1.10
% 3.69/1.10 %
% 3.69/1.10
% 3.69/1.10 % ------ Proving...
% 3.69/1.10 %
% 3.69/1.10
% 3.69/1.10 % SZS status Theorem for theBenchmark.p
% 3.69/1.10
% 3.69/1.10 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.69/1.10
% 3.69/1.10
%------------------------------------------------------------------------------