TSTP Solution File: SWV134+1 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---1.0
% Problem : SWV134+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 : 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:55:37 EDT 2022
% Result : Theorem 0.21s 0.57s
% Output : Refutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 6
% Syntax : Number of formulae : 30 ( 15 unt; 0 def)
% Number of atoms : 85 ( 8 equ)
% Maximal formula atoms : 12 ( 2 avg)
% Number of connectives : 71 ( 16 ~; 8 |; 42 &)
% ( 0 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 9 con; 0-2 aty)
% Number of variables : 21 ( 21 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1061,plain,
$false,
inference(subsumption_resolution,[],[f1060,f357]) ).
fof(f357,plain,
~ leq(n0,pv1325),
inference(cnf_transformation,[],[f125]) ).
fof(f125,plain,
( leq(a_select2(s_values7,pv1325),a_select2(s_values7,s_best7))
& leq(s_sworst7,n3)
& leq(s_best7,n3)
& ~ leq(n0,pv1325)
& leq(a_select2(s_values7,pv1325),a_select2(s_values7,s_sworst7))
& leq(n0,s_best7)
& ~ leq(a_select2(s_values7,pv1325),a_select2(s_values7,s_worst7))
& leq(n0,s_worst7)
& leq(n0,s_sworst7)
& leq(pv1325,n3)
& leq(n2,pv1325)
& leq(s_worst7,n3) ),
inference(flattening,[],[f124]) ).
fof(f124,plain,
( ~ leq(n0,pv1325)
& leq(s_sworst7,n3)
& leq(s_best7,n3)
& leq(n0,s_worst7)
& leq(s_worst7,n3)
& ~ leq(a_select2(s_values7,pv1325),a_select2(s_values7,s_worst7))
& leq(a_select2(s_values7,pv1325),a_select2(s_values7,s_sworst7))
& leq(n2,pv1325)
& leq(n0,s_sworst7)
& leq(n0,s_best7)
& leq(a_select2(s_values7,pv1325),a_select2(s_values7,s_best7))
& leq(pv1325,n3) ),
inference(ennf_transformation,[],[f54]) ).
fof(f54,negated_conjecture,
~ ( ( leq(s_sworst7,n3)
& leq(s_best7,n3)
& leq(n0,s_worst7)
& leq(s_worst7,n3)
& ~ leq(a_select2(s_values7,pv1325),a_select2(s_values7,s_worst7))
& leq(a_select2(s_values7,pv1325),a_select2(s_values7,s_sworst7))
& leq(n2,pv1325)
& leq(n0,s_sworst7)
& leq(n0,s_best7)
& leq(a_select2(s_values7,pv1325),a_select2(s_values7,s_best7))
& leq(pv1325,n3) )
=> leq(n0,pv1325) ),
inference(negated_conjecture,[],[f53]) ).
fof(f53,conjecture,
( ( leq(s_sworst7,n3)
& leq(s_best7,n3)
& leq(n0,s_worst7)
& leq(s_worst7,n3)
& ~ leq(a_select2(s_values7,pv1325),a_select2(s_values7,s_worst7))
& leq(a_select2(s_values7,pv1325),a_select2(s_values7,s_sworst7))
& leq(n2,pv1325)
& leq(n0,s_sworst7)
& leq(n0,s_best7)
& leq(a_select2(s_values7,pv1325),a_select2(s_values7,s_best7))
& leq(pv1325,n3) )
=> leq(n0,pv1325) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',gauss_array_0004) ).
fof(f1060,plain,
leq(n0,pv1325),
inference(resolution,[],[f1059,f236]) ).
fof(f236,plain,
! [X0,X1] :
( ~ gt(X1,X0)
| leq(X0,X1) ),
inference(cnf_transformation,[],[f123]) ).
fof(f123,plain,
! [X0,X1] :
( ~ gt(X1,X0)
| leq(X0,X1) ),
inference(ennf_transformation,[],[f8]) ).
fof(f8,axiom,
! [X1,X0] :
( gt(X1,X0)
=> leq(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',leq_gt1) ).
fof(f1059,plain,
gt(pv1325,n0),
inference(resolution,[],[f1058,f963]) ).
fof(f963,plain,
! [X2] :
( ~ leq(n1,X2)
| gt(X2,n0) ),
inference(superposition,[],[f412,f407]) ).
fof(f407,plain,
n1 = plus(n1,n0),
inference(definition_unfolding,[],[f327,f266]) ).
fof(f266,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(f327,plain,
n1 = succ(n0),
inference(cnf_transformation,[],[f84]) ).
fof(f84,axiom,
n1 = succ(n0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',successor_1) ).
fof(f412,plain,
! [X0,X1] :
( ~ leq(plus(n1,X1),X0)
| gt(X0,X1) ),
inference(definition_unfolding,[],[f335,f266]) ).
fof(f335,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,[],[f98]) ).
fof(f98,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/sandbox2/benchmark/theBenchmark.p',leq_succ_gt) ).
fof(f1058,plain,
leq(n1,pv1325),
inference(resolution,[],[f1050,f236]) ).
fof(f1050,plain,
gt(pv1325,n1),
inference(resolution,[],[f970,f350]) ).
fof(f350,plain,
leq(n2,pv1325),
inference(cnf_transformation,[],[f125]) ).
fof(f970,plain,
! [X5] :
( ~ leq(n2,X5)
| gt(X5,n1) ),
inference(forward_demodulation,[],[f966,f407]) ).
fof(f966,plain,
! [X5] :
( gt(X5,plus(n1,n0))
| ~ leq(n2,X5) ),
inference(superposition,[],[f412,f395]) ).
fof(f395,plain,
n2 = plus(n1,plus(n1,n0)),
inference(definition_unfolding,[],[f263,f266,f266]) ).
fof(f263,plain,
n2 = succ(succ(n0)),
inference(cnf_transformation,[],[f85]) ).
fof(f85,axiom,
n2 = succ(succ(n0)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',successor_2) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SWV134+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.14/0.35 % Computer : n004.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Tue Aug 30 18:59:20 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.21/0.51 % (3361)ott+10_1:28_bd=off:bs=on:tgt=ground:i=101:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/101Mi)
% 0.21/0.52 % (3370)ott+3_1:1_gsp=on:lcm=predicate:i=138:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/138Mi)
% 0.21/0.57 % (3361)First to succeed.
% 0.21/0.57 % (3361)Refutation found. Thanks to Tanya!
% 0.21/0.57 % SZS status Theorem for theBenchmark
% 0.21/0.57 % SZS output start Proof for theBenchmark
% See solution above
% 0.21/0.57 % (3361)------------------------------
% 0.21/0.57 % (3361)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.21/0.57 % (3361)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.21/0.57 % (3361)Termination reason: Refutation
% 0.21/0.57
% 0.21/0.57 % (3361)Memory used [KB]: 6140
% 0.21/0.57 % (3361)Time elapsed: 0.120 s
% 0.21/0.57 % (3361)Instructions burned: 41 (million)
% 0.21/0.57 % (3361)------------------------------
% 0.21/0.57 % (3361)------------------------------
% 0.21/0.57 % (3348)Success in time 0.208 s
%------------------------------------------------------------------------------