TSTP Solution File: SWV143+1 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---1.0
% Problem : SWV143+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_sat --cores 0 -t %d %s
% Computer : n024.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:55:38 EDT 2022
% Result : Theorem 0.20s 0.52s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 5
% Syntax : Number of formulae : 26 ( 16 unt; 0 def)
% Number of atoms : 136 ( 9 equ)
% Maximal formula atoms : 27 ( 5 avg)
% Number of connectives : 146 ( 36 ~; 28 |; 54 &)
% ( 0 <=>; 28 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 9 con; 0-2 aty)
% Number of variables : 15 ( 15 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f555,plain,
$false,
inference(resolution,[],[f554,f371]) ).
fof(f371,plain,
leq(n1,loopcounter),
inference(cnf_transformation,[],[f157]) ).
fof(f157,plain,
( ( leq(s_worst7,n3)
| ~ gt(loopcounter,n0) )
& ( leq(n0,s_sworst7)
| leq(tptp_float_0_001,pv1341) )
& ( leq(n0,s_best7)
| ~ gt(loopcounter,n0) )
& ( ~ gt(loopcounter,n0)
| leq(s_sworst7,n3) )
& leq(n1,loopcounter)
& ( leq(s_worst7,n3)
| leq(tptp_float_0_001,pv1341) )
& ( leq(s_sworst7,n3)
| leq(tptp_float_0_001,pv1341) )
& ( leq(s_best7,n3)
| ~ gt(loopcounter,n0) )
& leq(tptp_float_0_001,pv1341)
& ( leq(tptp_float_0_001,pv1341)
| leq(n0,s_best7) )
& ( leq(n0,s_worst7)
| ~ gt(loopcounter,n0) )
& ( leq(s_best7,n3)
| leq(tptp_float_0_001,pv1341) )
& ~ leq(s_sworst7,n3)
& ( ~ gt(loopcounter,n0)
| leq(n0,s_sworst7) )
& ( leq(n0,s_worst7)
| leq(tptp_float_0_001,pv1341) ) ),
inference(flattening,[],[f156]) ).
fof(f156,plain,
( ~ leq(s_sworst7,n3)
& ( ~ gt(loopcounter,n0)
| leq(s_sworst7,n3) )
& ( leq(n0,s_worst7)
| leq(tptp_float_0_001,pv1341) )
& leq(n1,loopcounter)
& ( leq(s_worst7,n3)
| leq(tptp_float_0_001,pv1341) )
& ( leq(s_sworst7,n3)
| leq(tptp_float_0_001,pv1341) )
& ( leq(s_best7,n3)
| leq(tptp_float_0_001,pv1341) )
& leq(tptp_float_0_001,pv1341)
& ( ~ gt(loopcounter,n0)
| leq(n0,s_sworst7) )
& ( leq(n0,s_worst7)
| ~ gt(loopcounter,n0) )
& ( leq(s_worst7,n3)
| ~ gt(loopcounter,n0) )
& ( leq(n0,s_sworst7)
| leq(tptp_float_0_001,pv1341) )
& ( leq(tptp_float_0_001,pv1341)
| leq(n0,s_best7) )
& ( leq(n0,s_best7)
| ~ gt(loopcounter,n0) )
& ( leq(s_best7,n3)
| ~ gt(loopcounter,n0) ) ),
inference(ennf_transformation,[],[f54]) ).
fof(f54,negated_conjecture,
~ ( ( ( gt(loopcounter,n0)
=> leq(s_sworst7,n3) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(n0,s_worst7) )
& leq(n1,loopcounter)
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(s_worst7,n3) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(s_sworst7,n3) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(s_best7,n3) )
& leq(tptp_float_0_001,pv1341)
& ( gt(loopcounter,n0)
=> leq(n0,s_sworst7) )
& ( gt(loopcounter,n0)
=> leq(n0,s_worst7) )
& ( gt(loopcounter,n0)
=> leq(s_worst7,n3) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(n0,s_sworst7) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(n0,s_best7) )
& ( gt(loopcounter,n0)
=> leq(n0,s_best7) )
& ( gt(loopcounter,n0)
=> leq(s_best7,n3) ) )
=> leq(s_sworst7,n3) ),
inference(negated_conjecture,[],[f53]) ).
fof(f53,conjecture,
( ( ( gt(loopcounter,n0)
=> leq(s_sworst7,n3) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(n0,s_worst7) )
& leq(n1,loopcounter)
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(s_worst7,n3) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(s_sworst7,n3) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(s_best7,n3) )
& leq(tptp_float_0_001,pv1341)
& ( gt(loopcounter,n0)
=> leq(n0,s_sworst7) )
& ( gt(loopcounter,n0)
=> leq(n0,s_worst7) )
& ( gt(loopcounter,n0)
=> leq(s_worst7,n3) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(n0,s_sworst7) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(n0,s_best7) )
& ( gt(loopcounter,n0)
=> leq(n0,s_best7) )
& ( gt(loopcounter,n0)
=> leq(s_best7,n3) ) )
=> leq(s_sworst7,n3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',gauss_array_0013) ).
fof(f554,plain,
~ leq(n1,loopcounter),
inference(forward_demodulation,[],[f553,f463]) ).
fof(f463,plain,
n1 = plus(n0,n1),
inference(superposition,[],[f428,f413]) ).
fof(f413,plain,
! [X0] : plus(X0,n1) = plus(n1,X0),
inference(definition_unfolding,[],[f280,f279]) ).
fof(f279,plain,
! [X0] : succ(X0) = plus(n1,X0),
inference(cnf_transformation,[],[f30]) ).
fof(f30,axiom,
! [X0] : succ(X0) = plus(n1,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',succ_plus_1_l) ).
fof(f280,plain,
! [X0] : succ(X0) = plus(X0,n1),
inference(cnf_transformation,[],[f29]) ).
fof(f29,axiom,
! [X0] : succ(X0) = plus(X0,n1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',succ_plus_1_r) ).
fof(f428,plain,
n1 = plus(n1,n0),
inference(definition_unfolding,[],[f402,f279]) ).
fof(f402,plain,
n1 = succ(n0),
inference(cnf_transformation,[],[f84]) ).
fof(f84,axiom,
n1 = succ(n0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',successor_1) ).
fof(f553,plain,
~ leq(plus(n0,n1),loopcounter),
inference(forward_demodulation,[],[f552,f413]) ).
fof(f552,plain,
~ leq(plus(n1,n0),loopcounter),
inference(resolution,[],[f419,f449]) ).
fof(f449,plain,
~ gt(loopcounter,n0),
inference(resolution,[],[f372,f363]) ).
fof(f363,plain,
~ leq(s_sworst7,n3),
inference(cnf_transformation,[],[f157]) ).
fof(f372,plain,
( leq(s_sworst7,n3)
| ~ gt(loopcounter,n0) ),
inference(cnf_transformation,[],[f157]) ).
fof(f419,plain,
! [X0,X1] :
( gt(X0,X1)
| ~ leq(plus(n1,X1),X0) ),
inference(definition_unfolding,[],[f359,f279]) ).
fof(f359,plain,
! [X0,X1] :
( gt(X0,X1)
| ~ leq(succ(X1),X0) ),
inference(cnf_transformation,[],[f139]) ).
fof(f139,plain,
! [X0,X1] :
( gt(X0,X1)
| ~ leq(succ(X1),X0) ),
inference(ennf_transformation,[],[f105]) ).
fof(f105,plain,
! [X1,X0] :
( 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/sandbox/benchmark/theBenchmark.p',leq_succ_gt) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SWV143+1 : TPTP v8.1.0. Bugfixed v3.3.0.
% 0.07/0.14 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_sat --cores 0 -t %d %s
% 0.13/0.35 % Computer : n024.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 30 19:05:49 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.20/0.48 % (27581)ott-1_1:6_av=off:cond=on:fsr=off:nwc=3.0:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.20/0.48 % (27589)fmb+10_1:1_bce=on:i=59:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/59Mi)
% 0.20/0.52 % (27573)ott+10_1:32_abs=on:br=off:urr=ec_only:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 0.20/0.52 % (27581)First to succeed.
% 0.20/0.52 % (27581)Refutation found. Thanks to Tanya!
% 0.20/0.52 % SZS status Theorem for theBenchmark
% 0.20/0.52 % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.52 % (27581)------------------------------
% 0.20/0.52 % (27581)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.52 % (27581)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.52 % (27581)Termination reason: Refutation
% 0.20/0.52
% 0.20/0.52 % (27581)Memory used [KB]: 1407
% 0.20/0.52 % (27581)Time elapsed: 0.102 s
% 0.20/0.52 % (27581)Instructions burned: 24 (million)
% 0.20/0.52 % (27581)------------------------------
% 0.20/0.52 % (27581)------------------------------
% 0.20/0.52 % (27571)Success in time 0.16 s
%------------------------------------------------------------------------------