TSTP Solution File: SWV133+1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : SWV133+1 : TPTP v8.1.2. Bugfixed v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n010.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Fri May 3 03:13:35 EDT 2024
% Result : Theorem 0.46s 1.15s
% Output : CNFRefutation 0.46s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 4
% Syntax : Number of formulae : 24 ( 9 unt; 0 def)
% Number of atoms : 80 ( 0 equ)
% Maximal formula atoms : 11 ( 3 avg)
% Number of connectives : 78 ( 22 ~; 13 |; 39 &)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% 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 18 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f5,axiom,
! [X0,X1,X2] :
( ( leq(X1,X2)
& leq(X0,X1) )
=> leq(X0,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',transitivity_leq) ).
fof(f8,axiom,
! [X0,X1] :
( gt(X1,X0)
=> leq(X0,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',leq_gt1) ).
fof(f53,conjecture,
( ( 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_0003) ).
fof(f54,negated_conjecture,
~ ( ( 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,[],[f53]) ).
fof(f65,axiom,
gt(n2,n0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',gt_2_0) ).
fof(f110,plain,
! [X0,X1,X2] :
( leq(X0,X2)
| ~ leq(X1,X2)
| ~ leq(X0,X1) ),
inference(ennf_transformation,[],[f5]) ).
fof(f111,plain,
! [X0,X1,X2] :
( leq(X0,X2)
| ~ leq(X1,X2)
| ~ leq(X0,X1) ),
inference(flattening,[],[f110]) ).
fof(f112,plain,
! [X0,X1] :
( leq(X0,X1)
| ~ gt(X1,X0) ),
inference(ennf_transformation,[],[f8]) ).
fof(f148,plain,
( ~ leq(n0,pv1325)
& 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)) ),
inference(ennf_transformation,[],[f54]) ).
fof(f149,plain,
( ~ leq(n0,pv1325)
& 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)) ),
inference(flattening,[],[f148]) ).
fof(f220,plain,
! [X2,X0,X1] :
( leq(X0,X2)
| ~ leq(X1,X2)
| ~ leq(X0,X1) ),
inference(cnf_transformation,[],[f111]) ).
fof(f221,plain,
! [X0,X1] :
( leq(X0,X1)
| ~ gt(X1,X0) ),
inference(cnf_transformation,[],[f112]) ).
fof(f330,plain,
leq(n2,pv1325),
inference(cnf_transformation,[],[f149]) ).
fof(f336,plain,
~ leq(n0,pv1325),
inference(cnf_transformation,[],[f149]) ).
fof(f347,plain,
gt(n2,n0),
inference(cnf_transformation,[],[f65]) ).
cnf(c_53,plain,
( ~ leq(X0,X1)
| ~ leq(X1,X2)
| leq(X0,X2) ),
inference(cnf_transformation,[],[f220]) ).
cnf(c_54,plain,
( ~ gt(X0,X1)
| leq(X1,X0) ),
inference(cnf_transformation,[],[f221]) ).
cnf(c_157,negated_conjecture,
~ leq(n0,pv1325),
inference(cnf_transformation,[],[f336]) ).
cnf(c_163,negated_conjecture,
leq(n2,pv1325),
inference(cnf_transformation,[],[f330]) ).
cnf(c_178,plain,
gt(n2,n0),
inference(cnf_transformation,[],[f347]) ).
cnf(c_8714,plain,
( ~ leq(X0,n2)
| leq(X0,pv1325) ),
inference(superposition,[status(thm)],[c_163,c_53]) ).
cnf(c_8718,plain,
( ~ leq(n0,n2)
| leq(n0,pv1325) ),
inference(instantiation,[status(thm)],[c_8714]) ).
cnf(c_9110,plain,
leq(n0,n2),
inference(superposition,[status(thm)],[c_178,c_54]) ).
cnf(c_9115,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_9110,c_8718,c_157]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SWV133+1 : TPTP v8.1.2. Bugfixed v3.3.0.
% 0.06/0.12 % Command : run_iprover %s %d THM
% 0.12/0.33 % Computer : n010.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Fri May 3 00:02:19 EDT 2024
% 0.12/0.33 % CPUTime :
% 0.18/0.45 Running first-order theorem proving
% 0.18/0.45 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --heuristic_context casc_unsat --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.46/1.15 % SZS status Started for theBenchmark.p
% 0.46/1.15 % SZS status Theorem for theBenchmark.p
% 0.46/1.15
% 0.46/1.15 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 0.46/1.15
% 0.46/1.15 ------ iProver source info
% 0.46/1.15
% 0.46/1.15 git: date: 2024-05-02 19:28:25 +0000
% 0.46/1.15 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 0.46/1.15 git: non_committed_changes: false
% 0.46/1.15
% 0.46/1.15 ------ Parsing...
% 0.46/1.15 ------ Clausification by vclausify_rel & Parsing by iProver...
% 0.46/1.15
% 0.46/1.15 ------ Preprocessing... sup_sim: 17 sf_s rm: 1 0s sf_e pe_s pe_e
% 0.46/1.15
% 0.46/1.15 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 0.46/1.15
% 0.46/1.15 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 0.46/1.15 ------ Proving...
% 0.46/1.15 ------ Problem Properties
% 0.46/1.15
% 0.46/1.15
% 0.46/1.15 clauses 151
% 0.46/1.15 conjectures 11
% 0.46/1.15 EPR 45
% 0.46/1.15 Horn 101
% 0.46/1.15 unary 57
% 0.46/1.15 binary 34
% 0.46/1.15 lits 490
% 0.46/1.15 lits eq 113
% 0.46/1.15 fd_pure 0
% 0.46/1.15 fd_pseudo 0
% 0.46/1.15 fd_cond 6
% 0.46/1.15 fd_pseudo_cond 4
% 0.46/1.15 AC symbols 0
% 0.46/1.15
% 0.46/1.15 ------ Input Options Time Limit: Unbounded
% 0.46/1.15
% 0.46/1.15
% 0.46/1.15 ------
% 0.46/1.15 Current options:
% 0.46/1.15 ------
% 0.46/1.15
% 0.46/1.15
% 0.46/1.15
% 0.46/1.15
% 0.46/1.15 ------ Proving...
% 0.46/1.15
% 0.46/1.15
% 0.46/1.15 ------ Proving...
% 0.46/1.15
% 0.46/1.15
% 0.46/1.15 % SZS status Theorem for theBenchmark.p
% 0.46/1.15
% 0.46/1.15 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.46/1.15
% 0.46/1.15
%------------------------------------------------------------------------------