TSTP Solution File: COM002_1 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---1.0
% Problem : COM002_1 : TPTP v8.1.0. Released v5.0.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 : n019.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 15:53:31 EDT 2022
% Result : Theorem 0.21s 0.51s
% Output : Refutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 41
% Syntax : Number of formulae : 74 ( 22 unt; 32 typ; 0 def)
% Number of atoms : 74 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 58 ( 26 ~; 23 |; 4 &)
% ( 0 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 7 ( 6 usr)
% Number of type conns : 19 ( 10 >; 9 *; 0 +; 0 <<)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 22 ( 22 usr; 16 con; 0-2 aty)
% Number of variables : 48 ( 48 !; 0 ?; 48 :)
% Comments :
%------------------------------------------------------------------------------
tff(type_def_5,type,
state: $tType ).
tff(type_def_6,type,
label: $tType ).
tff(type_def_7,type,
statement: $tType ).
tff(type_def_8,type,
register: $tType ).
tff(type_def_9,type,
number: $tType ).
tff(type_def_10,type,
boolean: $tType ).
tff(func_def_0,type,
p1: state ).
tff(func_def_1,type,
p2: state ).
tff(func_def_2,type,
p3: state ).
tff(func_def_3,type,
p4: state ).
tff(func_def_4,type,
p5: state ).
tff(func_def_5,type,
p6: state ).
tff(func_def_6,type,
p7: state ).
tff(func_def_7,type,
p8: state ).
tff(func_def_8,type,
n: number ).
tff(func_def_9,type,
n0: number ).
tff(func_def_10,type,
n1: number ).
tff(func_def_11,type,
n2: number ).
tff(func_def_12,type,
register_j: register ).
tff(func_def_13,type,
register_k: register ).
tff(func_def_14,type,
out: label ).
tff(func_def_15,type,
loop: label ).
tff(func_def_16,type,
equal_function: ( register * number ) > boolean ).
tff(func_def_17,type,
assign: ( register * number ) > statement ).
tff(func_def_18,type,
goto: label > statement ).
tff(func_def_19,type,
ifthen: ( boolean * state ) > statement ).
tff(func_def_20,type,
plus: ( register * number ) > number ).
tff(func_def_21,type,
times: ( number * register ) > number ).
tff(pred_def_1,type,
follows: ( state * state ) > $o ).
tff(pred_def_2,type,
succeeds: ( state * state ) > $o ).
tff(pred_def_3,type,
labels: ( label * state ) > $o ).
tff(pred_def_4,type,
has: ( state * statement ) > $o ).
tff(f107,plain,
$false,
inference(subsumption_resolution,[],[f105,f36]) ).
tff(f36,plain,
~ succeeds(p3,p3),
inference(cnf_transformation,[],[f23]) ).
tff(f23,plain,
~ succeeds(p3,p3),
inference(flattening,[],[f20]) ).
tff(f20,negated_conjecture,
~ succeeds(p3,p3),
inference(negated_conjecture,[],[f19]) ).
tff(f19,conjecture,
succeeds(p3,p3),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_there_is_a_loop_through_p3) ).
tff(f105,plain,
succeeds(p3,p3),
inference(resolution,[],[f103,f65]) ).
tff(f65,plain,
! [X4: state] :
( ~ succeeds(X4,p6)
| succeeds(X4,p3) ),
inference(resolution,[],[f49,f57]) ).
tff(f57,plain,
succeeds(p6,p3),
inference(resolution,[],[f44,f43]) ).
tff(f43,plain,
follows(p6,p3),
inference(cnf_transformation,[],[f13]) ).
tff(f13,axiom,
follows(p6,p3),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',transition_3_to_6) ).
tff(f44,plain,
! [X0: state,X1: state] :
( ~ follows(X0,X1)
| succeeds(X0,X1) ),
inference(cnf_transformation,[],[f33]) ).
tff(f33,plain,
! [X0: state,X1: state] :
( ~ follows(X0,X1)
| succeeds(X0,X1) ),
inference(rectify,[],[f28]) ).
tff(f28,plain,
! [X1: state,X0: state] :
( ~ follows(X1,X0)
| succeeds(X1,X0) ),
inference(ennf_transformation,[],[f1]) ).
tff(f1,axiom,
! [X0: state,X1: state] :
( follows(X1,X0)
=> succeeds(X1,X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',direct_success) ).
tff(f49,plain,
! [X2: state,X0: state,X1: state] :
( ~ succeeds(X1,X2)
| ~ succeeds(X0,X1)
| succeeds(X0,X2) ),
inference(cnf_transformation,[],[f34]) ).
tff(f34,plain,
! [X0: state,X1: state,X2: state] :
( ~ succeeds(X0,X1)
| ~ succeeds(X1,X2)
| succeeds(X0,X2) ),
inference(rectify,[],[f27]) ).
tff(f27,plain,
! [X1: state,X0: state,X2: state] :
( ~ succeeds(X1,X0)
| ~ succeeds(X0,X2)
| succeeds(X1,X2) ),
inference(flattening,[],[f26]) ).
tff(f26,plain,
! [X0: state,X2: state,X1: state] :
( succeeds(X1,X2)
| ~ succeeds(X1,X0)
| ~ succeeds(X0,X2) ),
inference(ennf_transformation,[],[f21]) ).
tff(f21,plain,
! [X0: state,X2: state,X1: state] :
( ( succeeds(X1,X0)
& succeeds(X0,X2) )
=> succeeds(X1,X2) ),
inference(rectify,[],[f2]) ).
tff(f2,axiom,
! [X2: state,X1: state,X0: state] :
( ( succeeds(X2,X0)
& succeeds(X1,X2) )
=> succeeds(X1,X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',transitivity_of_success) ).
tff(f103,plain,
succeeds(p3,p6),
inference(resolution,[],[f102,f66]) ).
tff(f66,plain,
! [X5: state] :
( ~ succeeds(X5,p7)
| succeeds(X5,p6) ),
inference(resolution,[],[f49,f58]) ).
tff(f58,plain,
succeeds(p7,p6),
inference(resolution,[],[f44,f38]) ).
tff(f38,plain,
follows(p7,p6),
inference(cnf_transformation,[],[f15]) ).
tff(f15,axiom,
follows(p7,p6),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',transition_6_to_7) ).
tff(f102,plain,
succeeds(p3,p7),
inference(resolution,[],[f67,f100]) ).
tff(f100,plain,
succeeds(p3,p8),
inference(resolution,[],[f96,f42]) ).
tff(f42,plain,
labels(loop,p3),
inference(cnf_transformation,[],[f8]) ).
tff(f8,axiom,
labels(loop,p3),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',label_state_3) ).
tff(f96,plain,
! [X1: state] :
( ~ labels(loop,X1)
| succeeds(X1,p8) ),
inference(resolution,[],[f37,f47]) ).
tff(f47,plain,
has(p8,goto(loop)),
inference(cnf_transformation,[],[f18]) ).
tff(f18,axiom,
has(p8,goto(loop)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',state_8) ).
tff(f37,plain,
! [X2: state,X0: label,X1: state] :
( ~ has(X2,goto(X0))
| succeeds(X1,X2)
| ~ labels(X0,X1) ),
inference(cnf_transformation,[],[f31]) ).
tff(f31,plain,
! [X0: label,X1: state,X2: state] :
( succeeds(X1,X2)
| ~ has(X2,goto(X0))
| ~ labels(X0,X1) ),
inference(rectify,[],[f30]) ).
tff(f30,plain,
! [X2: label,X0: state,X1: state] :
( succeeds(X0,X1)
| ~ has(X1,goto(X2))
| ~ labels(X2,X0) ),
inference(flattening,[],[f29]) ).
tff(f29,plain,
! [X1: state,X2: label,X0: state] :
( succeeds(X0,X1)
| ~ labels(X2,X0)
| ~ has(X1,goto(X2)) ),
inference(ennf_transformation,[],[f24]) ).
tff(f24,plain,
! [X1: state,X2: label,X0: state] :
( ( labels(X2,X0)
& has(X1,goto(X2)) )
=> succeeds(X0,X1) ),
inference(rectify,[],[f3]) ).
tff(f3,axiom,
! [X1: state,X0: state,X3: label] :
( ( has(X0,goto(X3))
& labels(X3,X1) )
=> succeeds(X1,X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goto_success) ).
tff(f67,plain,
! [X6: state] :
( ~ succeeds(X6,p8)
| succeeds(X6,p7) ),
inference(resolution,[],[f49,f59]) ).
tff(f59,plain,
succeeds(p8,p7),
inference(resolution,[],[f44,f53]) ).
tff(f53,plain,
follows(p8,p7),
inference(cnf_transformation,[],[f17]) ).
tff(f17,axiom,
follows(p8,p7),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',transition_7_to_8) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : COM002_1 : TPTP v8.1.0. Released v5.0.0.
% 0.07/0.13 % 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.34 % Computer : n019.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Mon Aug 29 17:03:20 EDT 2022
% 0.14/0.34 % CPUTime :
% 0.21/0.50 % (339)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.50 % (339)First to succeed.
% 0.21/0.51 % (355)ott+33_1:4_s2a=on:tgt=ground:i=439:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/439Mi)
% 0.21/0.51 % (340)ott+10_1:5_bd=off:tgt=full:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99Mi)
% 0.21/0.51 % (339)Refutation found. Thanks to Tanya!
% 0.21/0.51 % SZS status Theorem for theBenchmark
% 0.21/0.51 % SZS output start Proof for theBenchmark
% See solution above
% 0.21/0.51 % (339)------------------------------
% 0.21/0.51 % (339)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.21/0.51 % (339)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.21/0.51 % (339)Termination reason: Refutation
% 0.21/0.51
% 0.21/0.51 % (339)Memory used [KB]: 5500
% 0.21/0.51 % (339)Time elapsed: 0.097 s
% 0.21/0.51 % (339)Instructions burned: 2 (million)
% 0.21/0.51 % (339)------------------------------
% 0.21/0.51 % (339)------------------------------
% 0.21/0.51 % (326)Success in time 0.158 s
%------------------------------------------------------------------------------