%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SWV144+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 : n007.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:32 PM UTC 2026
% Result : Theorem 3.38s 1.34s
% Output : CNFRefutation 3.38s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 4
% Syntax : Number of formulae : 32 ( 11 unt; 0 def)
% Number of atoms : 165 ( 7 equ)
% Maximal formula atoms : 27 ( 5 avg)
% Number of connectives : 185 ( 52 ~; 49 |; 56 &)
% ( 0 <=>; 28 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 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 : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 9 con; 0-0 aty)
% Number of variables : 26 ( 0 sgn 26 !; 0 ?; 6 :)
% Comments :
%------------------------------------------------------------------------------
fof(f2,axiom,
! [X0,X1,X2] :
( ( gt(X1,X2)
& gt(X0,X1) )
=> gt(X0,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV003+0.ax',transitivity_gt) ).
fof(f9,axiom,
! [X0,X1] :
( ( X0 != X1
& leq(X0,X1) )
=> gt(X1,X0) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV003+0.ax',leq_gt2) ).
fof(f53,conjecture,
( ( ( gt(loopcounter,n0)
=> leq(s_worst7,n3) )
& ( gt(loopcounter,n0)
=> leq(s_sworst7,n3) )
& ( gt(loopcounter,n0)
=> leq(s_best7,n3) )
& ( gt(loopcounter,n0)
=> leq(n0,s_worst7) )
& ( gt(loopcounter,n0)
=> leq(n0,s_sworst7) )
& ( gt(loopcounter,n0)
=> leq(n0,s_best7) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(s_worst7,n3) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(s_sworst7,n3) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(s_best7,n3) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(n0,s_worst7) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(n0,s_sworst7) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(n0,s_best7) )
& leq(n1,loopcounter)
& leq(tptp_float_0_001,pv1341) )
=> leq(s_worst7,n3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',gauss_array_0014) ).
fof(f54,negated_conjecture,
~ ( ( ( gt(loopcounter,n0)
=> leq(s_worst7,n3) )
& ( gt(loopcounter,n0)
=> leq(s_sworst7,n3) )
& ( gt(loopcounter,n0)
=> leq(s_best7,n3) )
& ( gt(loopcounter,n0)
=> leq(n0,s_worst7) )
& ( gt(loopcounter,n0)
=> leq(n0,s_sworst7) )
& ( gt(loopcounter,n0)
=> leq(n0,s_best7) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(s_worst7,n3) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(s_sworst7,n3) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(s_best7,n3) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(n0,s_worst7) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(n0,s_sworst7) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(n0,s_best7) )
& leq(n1,loopcounter)
& leq(tptp_float_0_001,pv1341) )
=> leq(s_worst7,n3) ),
inference(negated_conjecture,[status(cth)],[f53]) ).
fof(f64,axiom,
gt(n1,n0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',gt_1_0) ).
fof(f87,plain,
( ( ~ gt(loopcounter,n0)
| leq(s_worst7,n3) )
& ( ~ gt(loopcounter,n0)
| leq(s_sworst7,n3) )
& ( ~ gt(loopcounter,n0)
| leq(s_best7,n3) )
& ( ~ gt(loopcounter,n0)
| leq(n0,s_worst7) )
& ( ~ gt(loopcounter,n0)
| leq(n0,s_sworst7) )
& ( ~ gt(loopcounter,n0)
| leq(n0,s_best7) )
& ( leq(tptp_float_0_001,pv1341)
| leq(s_worst7,n3) )
& ( leq(tptp_float_0_001,pv1341)
| leq(s_sworst7,n3) )
& ( leq(tptp_float_0_001,pv1341)
| leq(s_best7,n3) )
& ( leq(tptp_float_0_001,pv1341)
| leq(n0,s_worst7) )
& ( leq(tptp_float_0_001,pv1341)
| leq(n0,s_sworst7) )
& ( leq(tptp_float_0_001,pv1341)
| leq(n0,s_best7) )
& leq(n1,loopcounter)
& leq(tptp_float_0_001,pv1341)
& ~ leq(s_worst7,n3) ),
inference(ennf_transformation,[],[f54]) ).
fof(f88,plain,
( ( ~ gt(loopcounter,n0)
| leq(s_worst7,n3) )
& ( ~ gt(loopcounter,n0)
| leq(s_sworst7,n3) )
& ( ~ gt(loopcounter,n0)
| leq(s_best7,n3) )
& ( ~ gt(loopcounter,n0)
| leq(n0,s_worst7) )
& ( ~ gt(loopcounter,n0)
| leq(n0,s_sworst7) )
& ( ~ gt(loopcounter,n0)
| leq(n0,s_best7) )
& ( leq(tptp_float_0_001,pv1341)
| leq(s_worst7,n3) )
& ( leq(tptp_float_0_001,pv1341)
| leq(s_sworst7,n3) )
& ( leq(tptp_float_0_001,pv1341)
| leq(s_best7,n3) )
& ( leq(tptp_float_0_001,pv1341)
| leq(n0,s_worst7) )
& ( leq(tptp_float_0_001,pv1341)
| leq(n0,s_sworst7) )
& ( leq(tptp_float_0_001,pv1341)
| leq(n0,s_best7) )
& leq(n1,loopcounter)
& leq(tptp_float_0_001,pv1341)
& ~ leq(s_worst7,n3) ),
inference(flattening,[],[f87]) ).
fof(f90,plain,
! [X0,X1] :
( X0 = X1
| ~ leq(X0,X1)
| gt(X1,X0) ),
inference(ennf_transformation,[],[f9]) ).
fof(f91,plain,
! [X0,X1] :
( X0 = X1
| ~ leq(X0,X1)
| gt(X1,X0) ),
inference(flattening,[],[f90]) ).
fof(f93,plain,
! [X0,X1,X2] :
( ~ gt(X1,X2)
| ~ gt(X0,X1)
| gt(X0,X2) ),
inference(ennf_transformation,[],[f2]) ).
fof(f94,plain,
! [X0,X1,X2] :
( ~ gt(X1,X2)
| ~ gt(X0,X1)
| gt(X0,X2) ),
inference(flattening,[],[f93]) ).
fof(f112,plain,
( ~ gt(loopcounter,n0)
| leq(s_worst7,n3) ),
inference(cnf_transformation,[],[f88]) ).
fof(f117,plain,
( ~ gt(loopcounter,n0)
| leq(n0,s_best7) ),
inference(cnf_transformation,[],[f88]) ).
fof(f124,plain,
leq(n1,loopcounter),
inference(cnf_transformation,[],[f88]) ).
fof(f126,plain,
~ leq(s_worst7,n3),
inference(cnf_transformation,[],[f88]) ).
fof(f131,plain,
! [X0,X1] :
( X0 = X1
| ~ leq(X0,X1)
| gt(X1,X0) ),
inference(cnf_transformation,[],[f91]) ).
fof(f134,plain,
! [X2,X0,X1] :
( ~ gt(X1,X2)
| ~ gt(X0,X1)
| gt(X0,X2) ),
inference(cnf_transformation,[],[f94]) ).
fof(f150,plain,
gt(n1,n0),
inference(cnf_transformation,[],[f64]) ).
tcf(c_49,negated_conjecture,
~ leq(s_worst7,n3),
inference(cnf_transformation,[],[f126]) ).
tcf(c_51,negated_conjecture,
leq(n1,loopcounter),
inference(cnf_transformation,[],[f124]) ).
tcf(c_58,negated_conjecture,
( leq(n0,s_best7)
| ~ gt(loopcounter,n0) ),
inference(cnf_transformation,[],[f117]) ).
tcf(c_63,negated_conjecture,
( leq(s_worst7,n3)
| ~ gt(loopcounter,n0) ),
inference(cnf_transformation,[],[f112]) ).
tcf(c_68,plain,
! [X0: $i,X1: $i] :
( gt(X1,X0)
| ( X0 = X1 )
| ~ leq(X0,X1) ),
inference(cnf_transformation,[],[f131]) ).
tcf(c_71,plain,
! [X0: $i,X1: $i,X2: $i] :
( gt(X2,X1)
| ~ gt(X2,X0)
| ~ gt(X0,X1) ),
inference(cnf_transformation,[],[f134]) ).
tcf(c_87,plain,
gt(n1,n0),
inference(cnf_transformation,[],[f150]) ).
tcf(c_164,negated_conjecture,
~ gt(loopcounter,n0),
inference(global_subsumption_just,[status(thm)],[c_58,c_49,c_63]) ).
tcf(c_2026,plain,
! [X0: $i] :
( gt(X0,n0)
| ~ gt(n1,n0)
| ~ gt(X0,n1) ),
inference(instantiation,[status(thm)],[c_71]) ).
tcf(c_2365,plain,
( gt(loopcounter,n1)
| ( n1 = loopcounter ) ),
inference(superposition,[status(thm)],[c_51,c_68]) ).
tcf(c_2690,plain,
( gt(loopcounter,n0)
| ~ gt(loopcounter,n1)
| ~ gt(n1,n0) ),
inference(instantiation,[status(thm)],[c_2026]) ).
tcf(c_2753,plain,
n1 = loopcounter,
inference(global_subsumption_just,[status(thm)],[c_2365,c_87,c_49,c_63,c_2365,c_2690]) ).
tcf(c_2757,plain,
~ gt(n1,n0),
inference(demodulation,[status(thm)],[c_164,c_2753]) ).
tcf(c_2759,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_2757,c_87]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWV144+1 : TPTP v9.3.1. Bugfixed v3.3.0.
% 0.00/0.03 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.07/0.35 % Computer : n007.cluster.edu
% 0.07/0.35 % Model : x86_64 x86_64
% 0.07/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.35 % Memory : 8046.5625MB
% 0.07/0.35 % OS : Linux 6.8.0-71-generic
% 0.07/0.35 % CPULimit : 300
% 0.07/0.35 % WCLimit : 300
% 0.07/0.35 % DateTime : Thu Sep 24 18:34:37 UTC 2026
% 0.07/0.36 % CPUTime :
% 0.07/0.36 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.13/0.42 Running first-order theorem proving
% 0.13/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.13/0.44
% 0.13/0.44 % ======== iProver multi-core TPTP/SMT =========
% 0.13/0.44
% 0.13/0.44 % Detected problem language: tptp
% 0.13/0.46 % Proving...
% 3.38/1.34 % SZS status Started for theBenchmark.p
% 3.38/1.34 % SZS status Theorem for theBenchmark.p
% 3.38/1.34
% 3.38/1.34 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 3.38/1.34
% 3.38/1.34 % ------ iProver source info
% 3.38/1.34
% 3.38/1.34 % git: date: 2026-07-19 20:42:38 +0200
% 3.38/1.34 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 3.38/1.34 % git: non_committed_changes: false
% 3.38/1.34
% 3.38/1.34 % ------ Parsing...
% 3.38/1.34 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 3.38/1.34
% 3.38/1.34 % ------ Preprocessing... sup_sim: 10 sf_s rm: 1 0s sf_e pe_s pe_e sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e %
% 3.38/1.34
% 3.38/1.34 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 3.38/1.34
% 3.38/1.34 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 3.38/1.34 % ------ Proving...
% 3.38/1.34 % ------ Problem Properties
% 3.38/1.34
% 3.38/1.34 %
% 3.38/1.34 % clauses 60
% 3.38/1.34 % conjectures 4
% 3.38/1.34 % EPR 38
% 3.38/1.34 % Horn 53
% 3.38/1.34 % unary 43
% 3.38/1.34 % binary 7
% 3.38/1.34 % lits 102
% 3.38/1.34 % lits eq 38
% 3.38/1.34 % fd_pure 0
% 3.38/1.34 % fd_pseudo 0
% 3.38/1.34 % fd_cond 6
% 3.38/1.34 % fd_pseudo_cond 2
% 3.38/1.34 % AC symbols 0
% 3.38/1.34
% 3.38/1.34 % ------ Schedule dynamic 5 is on
% 3.38/1.34
% 3.38/1.34 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.38/1.34
% 3.38/1.34
% 3.38/1.34 % ------
% 3.38/1.34 % Current options:
% 3.38/1.34 % ------
% 3.38/1.34
% 3.38/1.34
% 3.38/1.34 %
% 3.38/1.34
% 3.38/1.34 % ------ Proving...
% 3.38/1.34 %
% 3.38/1.34
% 3.38/1.34 % SZS status Theorem for theBenchmark.p
% 3.38/1.34
% 3.38/1.34 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.38/1.34
% 3.38/1.34
%------------------------------------------------------------------------------