%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SWV135+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 : n003.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 4.31s 1.30s
% Output : CNFRefutation 4.34s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 4
% Syntax : Number of formulae : 24 ( 9 unt; 0 def)
% Number of atoms : 74 ( 0 equ)
% Maximal formula atoms : 9 ( 3 avg)
% Number of connectives : 70 ( 20 ~; 15 |; 31 &)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 5 avg)
% Maximal term depth : 1 ( 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 : 7 ( 7 usr; 7 con; 0-0 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(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(n0,pv1325) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',gauss_array_0005) ).
fof(f54,negated_conjecture,
~ ( ( 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(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(f87,plain,
( 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(n0,pv1325) ),
inference(ennf_transformation,[],[f54]) ).
fof(f88,plain,
( 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(n0,pv1325) ),
inference(flattening,[],[f87]) ).
fof(f95,plain,
! [X0,X1] :
( ~ gt(X1,X0)
| leq(X0,X1) ),
inference(ennf_transformation,[],[f8]) ).
fof(f96,plain,
! [X0,X1,X2] :
( ~ leq(X1,X2)
| ~ leq(X0,X1)
| leq(X0,X2) ),
inference(ennf_transformation,[],[f5]) ).
fof(f97,plain,
! [X0,X1,X2] :
( ~ leq(X1,X2)
| ~ leq(X0,X1)
| leq(X0,X2) ),
inference(flattening,[],[f96]) ).
fof(f116,plain,
leq(n2,pv1325),
inference(cnf_transformation,[],[f88]) ).
fof(f120,plain,
~ leq(n0,pv1325),
inference(cnf_transformation,[],[f88]) ).
fof(f129,plain,
! [X0,X1] :
( ~ gt(X1,X0)
| leq(X0,X1) ),
inference(cnf_transformation,[],[f95]) ).
fof(f130,plain,
! [X2,X0,X1] :
( ~ leq(X1,X2)
| ~ leq(X0,X1)
| leq(X0,X2) ),
inference(cnf_transformation,[],[f97]) ).
fof(f141,plain,
gt(n2,n0),
inference(cnf_transformation,[],[f65]) ).
tcf(c_49,negated_conjecture,
~ leq(n0,pv1325),
inference(cnf_transformation,[],[f120]) ).
tcf(c_53,negated_conjecture,
leq(n2,pv1325),
inference(cnf_transformation,[],[f116]) ).
tcf(c_66,plain,
! [X0: $i,X1: $i] :
( leq(X1,X0)
| ~ gt(X0,X1) ),
inference(cnf_transformation,[],[f129]) ).
tcf(c_67,plain,
! [X0: $i,X1: $i,X2: $i] :
( leq(X0,X2)
| ~ leq(X1,X2)
| ~ leq(X0,X1) ),
inference(cnf_transformation,[],[f130]) ).
tcf(c_78,plain,
gt(n2,n0),
inference(cnf_transformation,[],[f141]) ).
tcf(c_1374,plain,
leq(n0,n2),
inference(superposition,[status(thm)],[c_78,c_66]) ).
tcf(c_1558,plain,
! [X0: $i] :
( leq(n0,pv1325)
| ~ leq(n0,X0)
| ~ leq(X0,pv1325) ),
inference(instantiation,[status(thm)],[c_67]) ).
tcf(c_2008,plain,
( leq(n0,pv1325)
| ~ leq(n2,pv1325)
| ~ leq(n0,n2) ),
inference(instantiation,[status(thm)],[c_1558]) ).
tcf(c_2009,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_2008,c_1374,c_49,c_53]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWV135+1 : TPTP v9.3.1. Bugfixed v3.3.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.10/0.37 % Computer : n003.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.38 % CPULimit : 300
% 0.10/0.38 % WCLimit : 300
% 0.10/0.38 % DateTime : Thu Sep 24 18:37:07 UTC 2026
% 0.10/0.38 % CPUTime :
% 0.10/0.38 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.10/0.42 Running first-order theorem proving
% 0.10/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.10/0.43
% 0.10/0.43 % ======== iProver multi-core TPTP/SMT =========
% 0.10/0.43
% 0.10/0.43 % Detected problem language: tptp
% 0.10/0.44 % Proving...
% 4.31/1.30 % SZS status Started for theBenchmark.p
% 4.31/1.30 % SZS status Theorem for theBenchmark.p
% 4.31/1.30
% 4.31/1.30 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 4.31/1.30
% 4.31/1.30 % ------ iProver source info
% 4.31/1.30
% 4.31/1.30 % git: date: 2026-07-19 20:42:38 +0200
% 4.31/1.30 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 4.31/1.30 % git: non_committed_changes: false
% 4.31/1.30
% 4.31/1.30 % ------ Parsing...
% 4.31/1.30 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 4.31/1.30
% 4.31/1.30 % ------ Preprocessing... sup_sim: 10 sf_s rm: 1 0s sf_e pe_s pe_e %
% 4.31/1.30
% 4.31/1.30 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 4.31/1.30
% 4.31/1.30 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 4.31/1.30 % ------ Proving...
% 4.31/1.30 % ------ Problem Properties
% 4.31/1.30
% 4.31/1.30 %
% 4.31/1.30 % clauses 65
% 4.31/1.30 % conjectures 9
% 4.31/1.30 % EPR 43
% 4.31/1.30 % Horn 58
% 4.31/1.30 % unary 48
% 4.31/1.30 % binary 7
% 4.31/1.30 % lits 107
% 4.31/1.30 % lits eq 38
% 4.31/1.30 % fd_pure 0
% 4.31/1.30 % fd_pseudo 0
% 4.31/1.30 % fd_cond 6
% 4.31/1.30 % fd_pseudo_cond 2
% 4.31/1.30 % AC symbols 0
% 4.31/1.30
% 4.31/1.30 % ------ Schedule dynamic 5 is on
% 4.31/1.30
% 4.31/1.30 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 4.31/1.30
% 4.31/1.30
% 4.31/1.30 % ------
% 4.31/1.30 % Current options:
% 4.31/1.30 % ------
% 4.31/1.30
% 4.31/1.30
% 4.31/1.30 %
% 4.31/1.30
% 4.31/1.30 % ------ Proving...
% 4.31/1.30 %
% 4.31/1.30
% 4.31/1.30 % SZS status Theorem for theBenchmark.p
% 4.31/1.30
% 4.31/1.30 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 4.34/1.30
% 4.34/1.30
%------------------------------------------------------------------------------