TSTP Solution File: SWV139+1 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---1.0
% Problem : SWV139+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 : n002.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:18 EDT 2022
% Result : Theorem 0.19s 0.51s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 5
% Syntax : Number of formulae : 26 ( 11 unt; 0 def)
% Number of atoms : 141 ( 5 equ)
% Maximal formula atoms : 27 ( 5 avg)
% Number of connectives : 152 ( 37 ~; 32 |; 54 &)
% ( 1 <=>; 28 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 2 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 9 con; 0-2 aty)
% Number of variables : 12 ( 12 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f286,plain,
$false,
inference(avatar_sat_refutation,[],[f252,f285]) ).
fof(f285,plain,
spl0_4,
inference(avatar_contradiction_clause,[],[f284]) ).
fof(f284,plain,
( $false
| spl0_4 ),
inference(subsumption_resolution,[],[f283,f183]) ).
fof(f183,plain,
leq(n1,loopcounter),
inference(cnf_transformation,[],[f108]) ).
fof(f108,plain,
( ( leq(n0,s_worst7)
| leq(tptp_float_0_001,pv1341) )
& ( leq(n0,s_worst7)
| ~ gt(loopcounter,n0) )
& ( ~ gt(loopcounter,n0)
| leq(n0,s_sworst7) )
& ~ leq(n0,s_best7)
& ( ~ gt(loopcounter,n0)
| leq(s_best7,n3) )
& leq(n1,loopcounter)
& ( ~ gt(loopcounter,n0)
| leq(n0,s_best7) )
& ( leq(tptp_float_0_001,pv1341)
| leq(s_best7,n3) )
& ( leq(tptp_float_0_001,pv1341)
| leq(s_worst7,n3) )
& ( leq(n0,s_best7)
| leq(tptp_float_0_001,pv1341) )
& ( leq(tptp_float_0_001,pv1341)
| leq(n0,s_sworst7) )
& ( leq(s_sworst7,n3)
| leq(tptp_float_0_001,pv1341) )
& ( leq(s_worst7,n3)
| ~ gt(loopcounter,n0) )
& ( leq(s_sworst7,n3)
| ~ gt(loopcounter,n0) )
& leq(tptp_float_0_001,pv1341) ),
inference(flattening,[],[f107]) ).
fof(f107,plain,
( ~ leq(n0,s_best7)
& ( leq(tptp_float_0_001,pv1341)
| leq(s_worst7,n3) )
& ( leq(tptp_float_0_001,pv1341)
| leq(s_best7,n3) )
& ( leq(n0,s_best7)
| leq(tptp_float_0_001,pv1341) )
& leq(n1,loopcounter)
& ( leq(s_worst7,n3)
| ~ gt(loopcounter,n0) )
& ( leq(tptp_float_0_001,pv1341)
| leq(n0,s_sworst7) )
& ( leq(s_sworst7,n3)
| ~ gt(loopcounter,n0) )
& ( ~ gt(loopcounter,n0)
| leq(n0,s_best7) )
& ( leq(n0,s_worst7)
| ~ gt(loopcounter,n0) )
& ( leq(s_sworst7,n3)
| leq(tptp_float_0_001,pv1341) )
& ( leq(n0,s_worst7)
| leq(tptp_float_0_001,pv1341) )
& ( ~ gt(loopcounter,n0)
| leq(n0,s_sworst7) )
& ( ~ gt(loopcounter,n0)
| leq(s_best7,n3) )
& leq(tptp_float_0_001,pv1341) ),
inference(ennf_transformation,[],[f54]) ).
fof(f54,negated_conjecture,
~ ( ( ( ~ 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_best7) )
& leq(n1,loopcounter)
& ( gt(loopcounter,n0)
=> leq(s_worst7,n3) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(n0,s_sworst7) )
& ( gt(loopcounter,n0)
=> leq(s_sworst7,n3) )
& ( gt(loopcounter,n0)
=> leq(n0,s_best7) )
& ( gt(loopcounter,n0)
=> leq(n0,s_worst7) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(s_sworst7,n3) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(n0,s_worst7) )
& ( gt(loopcounter,n0)
=> leq(n0,s_sworst7) )
& ( gt(loopcounter,n0)
=> leq(s_best7,n3) )
& leq(tptp_float_0_001,pv1341) )
=> leq(n0,s_best7) ),
inference(negated_conjecture,[],[f53]) ).
fof(f53,conjecture,
( ( ( ~ 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_best7) )
& leq(n1,loopcounter)
& ( gt(loopcounter,n0)
=> leq(s_worst7,n3) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(n0,s_sworst7) )
& ( gt(loopcounter,n0)
=> leq(s_sworst7,n3) )
& ( gt(loopcounter,n0)
=> leq(n0,s_best7) )
& ( gt(loopcounter,n0)
=> leq(n0,s_worst7) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(s_sworst7,n3) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(n0,s_worst7) )
& ( gt(loopcounter,n0)
=> leq(n0,s_sworst7) )
& ( gt(loopcounter,n0)
=> leq(s_best7,n3) )
& leq(tptp_float_0_001,pv1341) )
=> leq(n0,s_best7) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',gauss_array_0009) ).
fof(f283,plain,
( ~ leq(n1,loopcounter)
| spl0_4 ),
inference(forward_demodulation,[],[f275,f198]) ).
fof(f198,plain,
n1 = plus(n1,n0),
inference(definition_unfolding,[],[f126,f137]) ).
fof(f137,plain,
! [X0] : succ(X0) = plus(n1,X0),
inference(cnf_transformation,[],[f30]) ).
fof(f30,axiom,
! [X0] : succ(X0) = plus(n1,X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',succ_plus_1_l) ).
fof(f126,plain,
n1 = succ(n0),
inference(cnf_transformation,[],[f84]) ).
fof(f84,axiom,
n1 = succ(n0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',successor_1) ).
fof(f275,plain,
( ~ leq(plus(n1,n0),loopcounter)
| spl0_4 ),
inference(unit_resulting_resolution,[],[f232,f201]) ).
fof(f201,plain,
! [X0,X1] :
( ~ leq(plus(n1,X1),X0)
| gt(X0,X1) ),
inference(definition_unfolding,[],[f140,f137]) ).
fof(f140,plain,
! [X0,X1] :
( gt(X0,X1)
| ~ leq(succ(X1),X0) ),
inference(cnf_transformation,[],[f95]) ).
fof(f95,plain,
! [X0,X1] :
( gt(X0,X1)
| ~ leq(succ(X1),X0) ),
inference(ennf_transformation,[],[f89]) ).
fof(f89,plain,
! [X0,X1] :
( leq(succ(X1),X0)
=> gt(X0,X1) ),
inference(rectify,[],[f43]) ).
fof(f43,axiom,
! [X1,X0] :
( leq(succ(X0),X1)
=> gt(X1,X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',leq_succ_gt) ).
fof(f232,plain,
( ~ gt(loopcounter,n0)
| spl0_4 ),
inference(avatar_component_clause,[],[f230]) ).
fof(f230,plain,
( spl0_4
<=> gt(loopcounter,n0) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_4])]) ).
fof(f252,plain,
~ spl0_4,
inference(avatar_split_clause,[],[f251,f230]) ).
fof(f251,plain,
~ gt(loopcounter,n0),
inference(subsumption_resolution,[],[f182,f185]) ).
fof(f185,plain,
~ leq(n0,s_best7),
inference(cnf_transformation,[],[f108]) ).
fof(f182,plain,
( leq(n0,s_best7)
| ~ gt(loopcounter,n0) ),
inference(cnf_transformation,[],[f108]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWV139+1 : TPTP v8.1.0. Bugfixed v3.3.0.
% 0.07/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.12/0.33 % Computer : n002.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 : Tue Aug 30 19:15:14 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.19/0.49 % (6443)lrs+10_1:1_br=off:sos=on:ss=axioms:st=2.0:urr=on:i=33:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/33Mi)
% 0.19/0.49 % (6434)dis+1002_1:12_drc=off:fd=preordered:tgt=full:i=99978:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99978Mi)
% 0.19/0.50 % (6441)lrs+2_1:1_lcm=reverse:lma=on:sos=all:spb=goal_then_units:ss=included:urr=on:i=39:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/39Mi)
% 0.19/0.50 % (6449)lrs+10_1:1_drc=off:sp=reverse_frequency:spb=goal:to=lpo:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.19/0.50 % (6450)lrs+1011_1:1_fd=preordered:fsd=on:sos=on:thsq=on:thsqc=64:thsqd=32:uwa=ground:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 0.19/0.50 % (6443)First to succeed.
% 0.19/0.50 % (6457)dis+10_1:1_av=off:sos=on:sp=reverse_arity:ss=included:st=2.0:to=lpo:urr=ec_only:i=45:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/45Mi)
% 0.19/0.51 % (6443)Refutation found. Thanks to Tanya!
% 0.19/0.51 % SZS status Theorem for theBenchmark
% 0.19/0.51 % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.51 % (6443)------------------------------
% 0.19/0.51 % (6443)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.51 % (6443)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.51 % (6443)Termination reason: Refutation
% 0.19/0.51
% 0.19/0.51 % (6443)Memory used [KB]: 6140
% 0.19/0.51 % (6443)Time elapsed: 0.102 s
% 0.19/0.51 % (6443)Instructions burned: 5 (million)
% 0.19/0.51 % (6443)------------------------------
% 0.19/0.51 % (6443)------------------------------
% 0.19/0.51 % (6433)Success in time 0.166 s
%------------------------------------------------------------------------------