TSTP Solution File: SWV134+1 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---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_uns --cores 0 -t %d %s
% Computer : n010.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.52s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 5
% Syntax : Number of formulae : 26 ( 12 unt; 0 def)
% Number of atoms : 80 ( 5 equ)
% Maximal formula atoms : 12 ( 3 avg)
% Number of connectives : 70 ( 16 ~; 8 |; 42 &)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 4 avg)
% Maximal term depth : 3 ( 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 : 18 ( 18 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f264,plain,
$false,
inference(subsumption_resolution,[],[f263,f127]) ).
fof(f127,plain,
~ leq(n0,pv1325),
inference(cnf_transformation,[],[f95]) ).
fof(f95,plain,
( leq(s_best7,n3)
& leq(n0,s_worst7)
& leq(a_select2(s_values7,pv1325),a_select2(s_values7,s_sworst7))
& ~ leq(a_select2(s_values7,pv1325),a_select2(s_values7,s_worst7))
& leq(n0,s_best7)
& ~ leq(n0,pv1325)
& leq(pv1325,n3)
& leq(s_sworst7,n3)
& leq(n2,pv1325)
& leq(n0,s_sworst7)
& leq(s_worst7,n3)
& leq(a_select2(s_values7,pv1325),a_select2(s_values7,s_best7)) ),
inference(flattening,[],[f94]) ).
fof(f94,plain,
( ~ leq(n0,pv1325)
& leq(n0,s_worst7)
& leq(s_best7,n3)
& leq(n0,s_best7)
& leq(a_select2(s_values7,pv1325),a_select2(s_values7,s_best7))
& leq(n0,s_sworst7)
& leq(s_worst7,n3)
& leq(n2,pv1325)
& leq(a_select2(s_values7,pv1325),a_select2(s_values7,s_sworst7))
& leq(pv1325,n3)
& leq(s_sworst7,n3)
& ~ leq(a_select2(s_values7,pv1325),a_select2(s_values7,s_worst7)) ),
inference(ennf_transformation,[],[f54]) ).
fof(f54,negated_conjecture,
~ ( ( leq(n0,s_worst7)
& leq(s_best7,n3)
& leq(n0,s_best7)
& leq(a_select2(s_values7,pv1325),a_select2(s_values7,s_best7))
& leq(n0,s_sworst7)
& leq(s_worst7,n3)
& leq(n2,pv1325)
& leq(a_select2(s_values7,pv1325),a_select2(s_values7,s_sworst7))
& leq(pv1325,n3)
& leq(s_sworst7,n3)
& ~ leq(a_select2(s_values7,pv1325),a_select2(s_values7,s_worst7)) )
=> leq(n0,pv1325) ),
inference(negated_conjecture,[],[f53]) ).
fof(f53,conjecture,
( ( leq(n0,s_worst7)
& leq(s_best7,n3)
& leq(n0,s_best7)
& leq(a_select2(s_values7,pv1325),a_select2(s_values7,s_best7))
& leq(n0,s_sworst7)
& leq(s_worst7,n3)
& leq(n2,pv1325)
& leq(a_select2(s_values7,pv1325),a_select2(s_values7,s_sworst7))
& leq(pv1325,n3)
& leq(s_sworst7,n3)
& ~ leq(a_select2(s_values7,pv1325),a_select2(s_values7,s_worst7)) )
=> leq(n0,pv1325) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',gauss_array_0004) ).
fof(f263,plain,
leq(n0,pv1325),
inference(resolution,[],[f262,f147]) ).
fof(f147,plain,
! [X0,X1] :
( ~ gt(X0,X1)
| leq(X1,X0) ),
inference(cnf_transformation,[],[f116]) ).
fof(f116,plain,
! [X0,X1] :
( leq(X1,X0)
| ~ gt(X0,X1) ),
inference(rectify,[],[f107]) ).
fof(f107,plain,
! [X1,X0] :
( leq(X0,X1)
| ~ gt(X1,X0) ),
inference(ennf_transformation,[],[f8]) ).
fof(f8,axiom,
! [X1,X0] :
( gt(X1,X0)
=> leq(X0,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',leq_gt1) ).
fof(f262,plain,
gt(pv1325,n0),
inference(resolution,[],[f261,f225]) ).
fof(f225,plain,
! [X0] :
( ~ leq(n1,X0)
| gt(X0,n0) ),
inference(superposition,[],[f152,f150]) ).
fof(f150,plain,
n1 = succ(n0),
inference(cnf_transformation,[],[f84]) ).
fof(f84,axiom,
n1 = succ(n0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',successor_1) ).
fof(f152,plain,
! [X0,X1] :
( ~ leq(succ(X1),X0)
| gt(X0,X1) ),
inference(cnf_transformation,[],[f118]) ).
fof(f118,plain,
! [X0,X1] :
( gt(X0,X1)
| ~ leq(succ(X1),X0) ),
inference(rectify,[],[f104]) ).
fof(f104,plain,
! [X1,X0] :
( gt(X1,X0)
| ~ leq(succ(X0),X1) ),
inference(ennf_transformation,[],[f43]) ).
fof(f43,axiom,
! [X0,X1] :
( leq(succ(X0),X1)
=> gt(X1,X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',leq_succ_gt) ).
fof(f261,plain,
leq(n1,pv1325),
inference(resolution,[],[f252,f147]) ).
fof(f252,plain,
gt(pv1325,n1),
inference(resolution,[],[f226,f124]) ).
fof(f124,plain,
leq(n2,pv1325),
inference(cnf_transformation,[],[f95]) ).
fof(f226,plain,
! [X1] :
( ~ leq(n2,X1)
| gt(X1,n1) ),
inference(superposition,[],[f152,f159]) ).
fof(f159,plain,
n2 = succ(n1),
inference(forward_demodulation,[],[f151,f150]) ).
fof(f151,plain,
n2 = succ(succ(n0)),
inference(cnf_transformation,[],[f85]) ).
fof(f85,axiom,
n2 = succ(succ(n0)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',successor_2) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWV134+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 : n010.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 18:55:29 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.19/0.50 % (16628)lrs+10_1:32_br=off:nm=16:sd=2:ss=axioms:st=2.0:urr=on:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.19/0.50 % (16629)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.19/0.51 % (16636)ott+21_1:1_erd=off:s2a=on:sac=on:sd=1:sgt=64:sos=on:ss=included:st=3.0:to=lpo:urr=on:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99Mi)
% 0.19/0.51 % (16629)Instruction limit reached!
% 0.19/0.51 % (16629)------------------------------
% 0.19/0.51 % (16629)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.51 % (16629)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.51 % (16629)Termination reason: Unknown
% 0.19/0.51 % (16629)Termination phase: Preprocessing 3
% 0.19/0.51
% 0.19/0.51 % (16629)Memory used [KB]: 1535
% 0.19/0.51 % (16629)Time elapsed: 0.003 s
% 0.19/0.51 % (16629)Instructions burned: 3 (million)
% 0.19/0.51 % (16629)------------------------------
% 0.19/0.51 % (16629)------------------------------
% 0.19/0.51 % (16621)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.19/0.51 % (16619)lrs+10_1:1024_nm=0:nwc=5.0:ss=axioms:i=13:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/13Mi)
% 0.19/0.51 % (16621)First to succeed.
% 0.19/0.52 % (16621)Refutation found. Thanks to Tanya!
% 0.19/0.52 % SZS status Theorem for theBenchmark
% 0.19/0.52 % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.52 % (16621)------------------------------
% 0.19/0.52 % (16621)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.52 % (16621)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.52 % (16621)Termination reason: Refutation
% 0.19/0.52
% 0.19/0.52 % (16621)Memory used [KB]: 6012
% 0.19/0.52 % (16621)Time elapsed: 0.119 s
% 0.19/0.52 % (16621)Instructions burned: 5 (million)
% 0.19/0.52 % (16621)------------------------------
% 0.19/0.52 % (16621)------------------------------
% 0.19/0.52 % (16614)Success in time 0.171 s
%------------------------------------------------------------------------------