TSTP Solution File: SWV023+1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : SWV023+1 : TPTP v8.1.2. Bugfixed v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n015.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:30:48 EDT 2023
% Result : Theorem 0.95s 1.11s
% Output : CNFRefutation 0.95s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 2
% Syntax : Number of formulae : 11 ( 6 unt; 0 def)
% Number of atoms : 61 ( 20 equ)
% Maximal formula atoms : 11 ( 5 avg)
% Number of connectives : 68 ( 18 ~; 12 |; 26 &)
% ( 0 <=>; 12 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 2 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 8 con; 0-3 aty)
% Number of variables : 15 ( 0 sgn; 15 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f51,axiom,
true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ttrue) ).
fof(f53,conjecture,
( ( ! [X3] :
( ( leq(X3,n3)
& leq(n0,X3) )
=> init = a_select2(s_values7_init,X3) )
& ! [X13] :
( ( leq(X13,n2)
& leq(n0,X13) )
=> ! [X17] :
( ( leq(X17,n3)
& leq(n0,X17) )
=> init = a_select3(simplex7_init,X17,X13) ) )
& init = sigma_init
& i0_init = init )
=> true ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',gauss_init_0005) ).
fof(f54,negated_conjecture,
~ ( ( ! [X3] :
( ( leq(X3,n3)
& leq(n0,X3) )
=> init = a_select2(s_values7_init,X3) )
& ! [X13] :
( ( leq(X13,n2)
& leq(n0,X13) )
=> ! [X17] :
( ( leq(X17,n3)
& leq(n0,X17) )
=> init = a_select3(simplex7_init,X17,X13) ) )
& init = sigma_init
& i0_init = init )
=> true ),
inference(negated_conjecture,[],[f53]) ).
fof(f107,plain,
~ ( ( ! [X0] :
( ( leq(X0,n3)
& leq(n0,X0) )
=> init = a_select2(s_values7_init,X0) )
& ! [X1] :
( ( leq(X1,n2)
& leq(n0,X1) )
=> ! [X2] :
( ( leq(X2,n3)
& leq(n0,X2) )
=> init = a_select3(simplex7_init,X2,X1) ) )
& init = sigma_init
& i0_init = init )
=> true ),
inference(rectify,[],[f54]) ).
fof(f148,plain,
( ~ true
& ! [X0] :
( init = a_select2(s_values7_init,X0)
| ~ leq(X0,n3)
| ~ leq(n0,X0) )
& ! [X1] :
( ! [X2] :
( init = a_select3(simplex7_init,X2,X1)
| ~ leq(X2,n3)
| ~ leq(n0,X2) )
| ~ leq(X1,n2)
| ~ leq(n0,X1) )
& init = sigma_init
& i0_init = init ),
inference(ennf_transformation,[],[f107]) ).
fof(f149,plain,
( ~ true
& ! [X0] :
( init = a_select2(s_values7_init,X0)
| ~ leq(X0,n3)
| ~ leq(n0,X0) )
& ! [X1] :
( ! [X2] :
( init = a_select3(simplex7_init,X2,X1)
| ~ leq(X2,n3)
| ~ leq(n0,X2) )
| ~ leq(X1,n2)
| ~ leq(n0,X1) )
& init = sigma_init
& i0_init = init ),
inference(flattening,[],[f148]) ).
fof(f325,plain,
true,
inference(cnf_transformation,[],[f51]) ).
fof(f331,plain,
~ true,
inference(cnf_transformation,[],[f149]) ).
cnf(c_156,plain,
true,
inference(cnf_transformation,[],[f325]) ).
cnf(c_158,negated_conjecture,
~ true,
inference(cnf_transformation,[],[f331]) ).
cnf(c_193,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_158,c_156]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SWV023+1 : TPTP v8.1.2. Bugfixed v3.3.0.
% 0.00/0.14 % Command : run_iprover %s %d THM
% 0.13/0.35 % Computer : n015.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Tue Aug 29 05:30:26 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.20/0.47 Running first-order theorem proving
% 0.20/0.47 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.95/1.11 % SZS status Started for theBenchmark.p
% 0.95/1.11 % SZS status Theorem for theBenchmark.p
% 0.95/1.11
% 0.95/1.11 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 0.95/1.11
% 0.95/1.11 ------ iProver source info
% 0.95/1.11
% 0.95/1.11 git: date: 2023-05-31 18:12:56 +0000
% 0.95/1.11 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 0.95/1.11 git: non_committed_changes: false
% 0.95/1.11 git: last_make_outside_of_git: false
% 0.95/1.11
% 0.95/1.11 ------ Parsing...
% 0.95/1.11 ------ Clausification by vclausify_rel & Parsing by iProver...
% 0.95/1.11
% 0.95/1.11 ------ Preprocessing...
% 0.95/1.11
% 0.95/1.11 % SZS status Theorem for theBenchmark.p
% 0.95/1.11
% 0.95/1.11 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.95/1.11
% 0.95/1.11
%------------------------------------------------------------------------------