TSTP Solution File: SWV135+1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : SWV135+1 : TPTP v8.1.2. Bugfixed v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n006.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 : Thu Aug 31 22:31:17 EDT 2023
% Result : Theorem 0.40s 1.09s
% Output : CNFRefutation 0.40s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 4
% Syntax : Number of formulae : 24 ( 9 unt; 0 def)
% Number of atoms : 72 ( 0 equ)
% Maximal formula atoms : 9 ( 3 avg)
% Number of connectives : 66 ( 18 ~; 13 |; 31 &)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% 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; 18 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f5,axiom,
! [X0,X1,X2] :
( ( leq(X1,X2)
& leq(X0,X1) )
=> leq(X0,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',transitivity_leq) ).
fof(f8,axiom,
! [X0,X1] :
( gt(X1,X0)
=> leq(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',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/sandbox2/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,[],[f53]) ).
fof(f65,axiom,
gt(n2,n0),
file('/export/starexec/sandbox2/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(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) ),
inference(ennf_transformation,[],[f54]) ).
fof(f149,plain,
( ~ leq(n0,pv1325)
& 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) ),
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(f329,plain,
leq(n2,pv1325),
inference(cnf_transformation,[],[f149]) ).
fof(f334,plain,
~ leq(n0,pv1325),
inference(cnf_transformation,[],[f149]) ).
fof(f345,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,[],[f334]) ).
cnf(c_162,negated_conjecture,
leq(n2,pv1325),
inference(cnf_transformation,[],[f329]) ).
cnf(c_176,plain,
gt(n2,n0),
inference(cnf_transformation,[],[f345]) ).
cnf(c_8696,plain,
leq(n0,n2),
inference(superposition,[status(thm)],[c_176,c_54]) ).
cnf(c_10065,plain,
( ~ leq(X0,n2)
| leq(X0,pv1325) ),
inference(superposition,[status(thm)],[c_162,c_53]) ).
cnf(c_10298,plain,
( ~ leq(n0,n2)
| leq(n0,pv1325) ),
inference(instantiation,[status(thm)],[c_10065]) ).
cnf(c_10299,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_10298,c_8696,c_157]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.09 % Problem : SWV135+1 : TPTP v8.1.2. Bugfixed v3.3.0.
% 0.08/0.10 % Command : run_iprover %s %d THM
% 0.10/0.30 % Computer : n006.cluster.edu
% 0.10/0.30 % Model : x86_64 x86_64
% 0.10/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.30 % Memory : 8042.1875MB
% 0.10/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.30 % CPULimit : 300
% 0.10/0.30 % WCLimit : 300
% 0.10/0.30 % DateTime : Tue Aug 29 03:18:36 EDT 2023
% 0.10/0.31 % CPUTime :
% 0.15/0.40 Running first-order theorem proving
% 0.15/0.40 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.40/1.09 % SZS status Started for theBenchmark.p
% 0.40/1.09 % SZS status Theorem for theBenchmark.p
% 0.40/1.09
% 0.40/1.09 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 0.40/1.09
% 0.40/1.09 ------ iProver source info
% 0.40/1.09
% 0.40/1.09 git: date: 2023-05-31 18:12:56 +0000
% 0.40/1.09 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 0.40/1.09 git: non_committed_changes: false
% 0.40/1.09 git: last_make_outside_of_git: false
% 0.40/1.09
% 0.40/1.09 ------ Parsing...
% 0.40/1.09 ------ Clausification by vclausify_rel & Parsing by iProver...
% 0.40/1.09
% 0.40/1.09 ------ Preprocessing... sup_sim: 16 sf_s rm: 1 0s sf_e pe_s pe_e
% 0.40/1.09
% 0.40/1.09 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 0.40/1.09
% 0.40/1.09 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 0.40/1.09 ------ Proving...
% 0.40/1.09 ------ Problem Properties
% 0.40/1.09
% 0.40/1.09
% 0.40/1.09 clauses 149
% 0.40/1.09 conjectures 9
% 0.40/1.09 EPR 45
% 0.40/1.09 Horn 99
% 0.40/1.09 unary 55
% 0.40/1.09 binary 34
% 0.40/1.09 lits 488
% 0.40/1.09 lits eq 113
% 0.40/1.09 fd_pure 0
% 0.40/1.09 fd_pseudo 0
% 0.40/1.09 fd_cond 6
% 0.40/1.09 fd_pseudo_cond 4
% 0.40/1.09 AC symbols 0
% 0.40/1.09
% 0.40/1.09 ------ Schedule dynamic 5 is on
% 0.40/1.09
% 0.40/1.09 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 0.40/1.09
% 0.40/1.09
% 0.40/1.09 ------
% 0.40/1.09 Current options:
% 0.40/1.09 ------
% 0.40/1.09
% 0.40/1.09
% 0.40/1.09
% 0.40/1.09
% 0.40/1.09 ------ Proving...
% 0.40/1.09
% 0.40/1.09
% 0.40/1.09 % SZS status Theorem for theBenchmark.p
% 0.40/1.09
% 0.40/1.09 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.40/1.09
% 0.40/1.09
%------------------------------------------------------------------------------