TSTP Solution File: SWV132+1 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---1.0
% Problem : SWV132+1 : TPTP v8.1.0. Bugfixed v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_uns --cores 0 -t %d %s
% Computer : n004.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 : Wed Aug 31 18:44:17 EDT 2022
% Result : Theorem 0.17s 0.50s
% Output : Refutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 3
% Syntax : Number of formulae : 13 ( 5 unt; 0 def)
% Number of atoms : 117 ( 0 equ)
% Maximal formula atoms : 26 ( 9 avg)
% Number of connectives : 139 ( 35 ~; 26 |; 50 &)
% ( 2 <=>; 26 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 6 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 3 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 8 con; 0-0 aty)
% Number of variables : 0 ( 0 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f200,plain,
$false,
inference(avatar_sat_refutation,[],[f177,f184,f199]) ).
fof(f199,plain,
~ spl0_6,
inference(avatar_split_clause,[],[f119,f181]) ).
fof(f181,plain,
( spl0_6
<=> leq(s_best7,n3) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_6])]) ).
fof(f119,plain,
~ leq(s_best7,n3),
inference(cnf_transformation,[],[f91]) ).
fof(f91,plain,
( ( ~ gt(loopcounter,n0)
| leq(s_worst7,n3) )
& ( leq(n0,s_worst7)
| leq(tptp_float_0_001,pv1341) )
& ( leq(s_sworst7,n3)
| leq(tptp_float_0_001,pv1341) )
& ( leq(tptp_float_0_001,pv1341)
| leq(s_best7,n3) )
& ( ~ gt(loopcounter,n0)
| leq(n0,s_worst7) )
& ( ~ gt(loopcounter,n0)
| leq(s_sworst7,n3) )
& ( leq(tptp_float_0_001,pv1341)
| leq(s_worst7,n3) )
& ( ~ gt(loopcounter,n0)
| leq(s_best7,n3) )
& ( leq(tptp_float_0_001,pv1341)
| leq(n0,s_sworst7) )
& ( leq(tptp_float_0_001,pv1341)
| leq(n0,s_best7) )
& ~ leq(s_best7,n3)
& ~ leq(tptp_float_0_001,pv1341)
& ( leq(n0,s_sworst7)
| ~ gt(loopcounter,n0) )
& ( leq(n0,s_best7)
| ~ gt(loopcounter,n0) ) ),
inference(flattening,[],[f90]) ).
fof(f90,plain,
( ~ leq(s_best7,n3)
& ( ~ gt(loopcounter,n0)
| leq(n0,s_worst7) )
& ( leq(tptp_float_0_001,pv1341)
| leq(s_worst7,n3) )
& ( leq(tptp_float_0_001,pv1341)
| leq(s_best7,n3) )
& ( leq(tptp_float_0_001,pv1341)
| leq(n0,s_sworst7) )
& ( leq(n0,s_worst7)
| leq(tptp_float_0_001,pv1341) )
& ( leq(n0,s_best7)
| ~ gt(loopcounter,n0) )
& ( leq(n0,s_sworst7)
| ~ gt(loopcounter,n0) )
& ( ~ gt(loopcounter,n0)
| leq(s_best7,n3) )
& ~ leq(tptp_float_0_001,pv1341)
& ( leq(tptp_float_0_001,pv1341)
| leq(n0,s_best7) )
& ( leq(s_sworst7,n3)
| leq(tptp_float_0_001,pv1341) )
& ( ~ gt(loopcounter,n0)
| leq(s_worst7,n3) )
& ( ~ gt(loopcounter,n0)
| leq(s_sworst7,n3) ) ),
inference(ennf_transformation,[],[f54]) ).
fof(f54,negated_conjecture,
~ ( ( ( gt(loopcounter,n0)
=> leq(n0,s_worst7) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(s_worst7,n3) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(s_best7,n3) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(n0,s_sworst7) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(n0,s_worst7) )
& ( gt(loopcounter,n0)
=> leq(n0,s_best7) )
& ( gt(loopcounter,n0)
=> leq(n0,s_sworst7) )
& ( gt(loopcounter,n0)
=> leq(s_best7,n3) )
& ~ leq(tptp_float_0_001,pv1341)
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(n0,s_best7) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(s_sworst7,n3) )
& ( gt(loopcounter,n0)
=> leq(s_worst7,n3) )
& ( gt(loopcounter,n0)
=> leq(s_sworst7,n3) ) )
=> leq(s_best7,n3) ),
inference(negated_conjecture,[],[f53]) ).
fof(f53,conjecture,
( ( ( gt(loopcounter,n0)
=> leq(n0,s_worst7) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(s_worst7,n3) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(s_best7,n3) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(n0,s_sworst7) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(n0,s_worst7) )
& ( gt(loopcounter,n0)
=> leq(n0,s_best7) )
& ( gt(loopcounter,n0)
=> leq(n0,s_sworst7) )
& ( gt(loopcounter,n0)
=> leq(s_best7,n3) )
& ~ leq(tptp_float_0_001,pv1341)
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(n0,s_best7) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(s_sworst7,n3) )
& ( gt(loopcounter,n0)
=> leq(s_worst7,n3) )
& ( gt(loopcounter,n0)
=> leq(s_sworst7,n3) ) )
=> leq(s_best7,n3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',gauss_array_0002) ).
fof(f184,plain,
( spl0_4
| spl0_6 ),
inference(avatar_split_clause,[],[f126,f181,f168]) ).
fof(f168,plain,
( spl0_4
<=> leq(tptp_float_0_001,pv1341) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_4])]) ).
fof(f126,plain,
( leq(s_best7,n3)
| leq(tptp_float_0_001,pv1341) ),
inference(cnf_transformation,[],[f91]) ).
fof(f177,plain,
~ spl0_4,
inference(avatar_split_clause,[],[f118,f168]) ).
fof(f118,plain,
~ leq(tptp_float_0_001,pv1341),
inference(cnf_transformation,[],[f91]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.12 % Problem : SWV132+1 : TPTP v8.1.0. Bugfixed v3.3.0.
% 0.09/0.12 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_uns --cores 0 -t %d %s
% 0.11/0.33 % Computer : n004.cluster.edu
% 0.11/0.33 % Model : x86_64 x86_64
% 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33 % Memory : 8042.1875MB
% 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 300
% 0.11/0.33 % WCLimit : 300
% 0.11/0.33 % DateTime : Tue Aug 30 18:59:34 EDT 2022
% 0.11/0.33 % CPUTime :
% 0.17/0.49 % (4062)dis+1010_1:50_awrs=decay:awrsf=128:nwc=10.0:s2pl=no:sp=frequency:ss=axioms:i=39:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/39Mi)
% 0.17/0.49 % (4070)lrs+10_1:1_ins=3:sp=reverse_frequency:spb=goal:to=lpo:i=3:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.17/0.50 % (4062)First to succeed.
% 0.17/0.50 % (4062)Refutation found. Thanks to Tanya!
% 0.17/0.50 % SZS status Theorem for theBenchmark
% 0.17/0.50 % SZS output start Proof for theBenchmark
% See solution above
% 0.17/0.50 % (4062)------------------------------
% 0.17/0.50 % (4062)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.17/0.50 % (4062)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.17/0.50 % (4062)Termination reason: Refutation
% 0.17/0.50
% 0.17/0.50 % (4062)Memory used [KB]: 6012
% 0.17/0.50 % (4062)Time elapsed: 0.005 s
% 0.17/0.50 % (4062)Instructions burned: 3 (million)
% 0.17/0.50 % (4062)------------------------------
% 0.17/0.50 % (4062)------------------------------
% 0.17/0.50 % (4055)Success in time 0.161 s
%------------------------------------------------------------------------------