TSTP Solution File: COM001_1 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---1.0
% Problem : COM001_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 : n001.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.19s 0.52s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 28
% Syntax : Number of formulae : 54 ( 13 unt; 21 typ; 0 def)
% Number of atoms : 65 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 57 ( 25 ~; 22 |; 4 &)
% ( 0 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 7 ( 6 usr)
% Number of type conns : 13 ( 7 >; 6 *; 0 +; 0 <<)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 8 con; 0-2 aty)
% Number of variables : 49 ( 49 !; 0 ?; 49 :)
% 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,
p3: state ).
tff(func_def_1,type,
p4: state ).
tff(func_def_2,type,
p5: state ).
tff(func_def_3,type,
p8: state ).
tff(func_def_4,type,
n: number ).
tff(func_def_5,type,
register_j: register ).
tff(func_def_6,type,
out: label ).
tff(func_def_7,type,
loop: label ).
tff(func_def_8,type,
equal_function: ( register * number ) > boolean ).
tff(func_def_9,type,
goto: label > statement ).
tff(func_def_10,type,
ifthen: ( boolean * state ) > statement ).
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(f60,plain,
$false,
inference(subsumption_resolution,[],[f59,f36]) ).
tff(f36,plain,
~ succeeds(p3,p3),
inference(cnf_transformation,[],[f16]) ).
tff(f16,plain,
~ succeeds(p3,p3),
inference(flattening,[],[f12]) ).
tff(f12,negated_conjecture,
~ succeeds(p3,p3),
inference(negated_conjecture,[],[f11]) ).
tff(f11,conjecture,
succeeds(p3,p3),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_there_is_a_loop_through_p3) ).
tff(f59,plain,
succeeds(p3,p3),
inference(resolution,[],[f56,f32]) ).
tff(f32,plain,
follows(p8,p3),
inference(cnf_transformation,[],[f9]) ).
tff(f9,axiom,
follows(p8,p3),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',transition_3_to_8) ).
tff(f56,plain,
! [X0: state] :
( ~ follows(p8,X0)
| succeeds(p3,X0) ),
inference(resolution,[],[f47,f31]) ).
tff(f31,plain,
! [X0: state,X1: state] :
( succeeds(X1,X0)
| ~ follows(X1,X0) ),
inference(cnf_transformation,[],[f25]) ).
tff(f25,plain,
! [X0: state,X1: state] :
( succeeds(X1,X0)
| ~ follows(X1,X0) ),
inference(rectify,[],[f21]) ).
tff(f21,plain,
! [X1: state,X0: state] :
( succeeds(X0,X1)
| ~ follows(X0,X1) ),
inference(ennf_transformation,[],[f14]) ).
tff(f14,plain,
! [X1: state,X0: state] :
( follows(X0,X1)
=> succeeds(X0,X1) ),
inference(rectify,[],[f1]) ).
tff(f1,axiom,
! [X1: state,X0: state] :
( follows(X1,X0)
=> succeeds(X1,X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',direct_success) ).
tff(f47,plain,
! [X0: state] :
( ~ succeeds(p8,X0)
| succeeds(p3,X0) ),
inference(resolution,[],[f45,f28]) ).
tff(f28,plain,
! [X2: state,X0: state,X1: state] :
( ~ succeeds(X1,X2)
| ~ succeeds(X2,X0)
| succeeds(X1,X0) ),
inference(cnf_transformation,[],[f24]) ).
tff(f24,plain,
! [X0: state,X1: state,X2: state] :
( succeeds(X1,X0)
| ~ succeeds(X2,X0)
| ~ succeeds(X1,X2) ),
inference(rectify,[],[f23]) ).
tff(f23,plain,
! [X1: state,X2: state,X0: state] :
( succeeds(X2,X1)
| ~ succeeds(X0,X1)
| ~ succeeds(X2,X0) ),
inference(flattening,[],[f22]) ).
tff(f22,plain,
! [X2: state,X1: state,X0: state] :
( succeeds(X2,X1)
| ~ succeeds(X0,X1)
| ~ succeeds(X2,X0) ),
inference(ennf_transformation,[],[f17]) ).
tff(f17,plain,
! [X2: state,X1: state,X0: state] :
( ( succeeds(X0,X1)
& succeeds(X2,X0) )
=> succeeds(X2,X1) ),
inference(rectify,[],[f2]) ).
tff(f2,axiom,
! [X2: state,X0: state,X1: state] :
( ( succeeds(X1,X2)
& succeeds(X2,X0) )
=> succeeds(X1,X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',transitivity_of_success) ).
tff(f45,plain,
succeeds(p3,p8),
inference(resolution,[],[f43,f38]) ).
tff(f38,plain,
has(p8,goto(loop)),
inference(cnf_transformation,[],[f10]) ).
tff(f10,axiom,
has(p8,goto(loop)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',state_8) ).
tff(f43,plain,
! [X0: state] :
( ~ has(X0,goto(loop))
| succeeds(p3,X0) ),
inference(resolution,[],[f33,f30]) ).
tff(f30,plain,
labels(loop,p3),
inference(cnf_transformation,[],[f5]) ).
tff(f5,axiom,
labels(loop,p3),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',label_state_3) ).
tff(f33,plain,
! [X2: label,X0: state,X1: state] :
( ~ labels(X2,X1)
| ~ has(X0,goto(X2))
| succeeds(X1,X0) ),
inference(cnf_transformation,[],[f26]) ).
tff(f26,plain,
! [X0: state,X1: state,X2: label] :
( ~ labels(X2,X1)
| succeeds(X1,X0)
| ~ has(X0,goto(X2)) ),
inference(rectify,[],[f20]) ).
tff(f20,plain,
! [X2: state,X0: state,X1: label] :
( ~ labels(X1,X0)
| succeeds(X0,X2)
| ~ has(X2,goto(X1)) ),
inference(flattening,[],[f19]) ).
tff(f19,plain,
! [X2: state,X0: state,X1: label] :
( succeeds(X0,X2)
| ~ labels(X1,X0)
| ~ has(X2,goto(X1)) ),
inference(ennf_transformation,[],[f13]) ).
tff(f13,plain,
! [X2: state,X0: state,X1: label] :
( ( labels(X1,X0)
& has(X2,goto(X1)) )
=> succeeds(X0,X2) ),
inference(rectify,[],[f3]) ).
tff(f3,axiom,
! [X1: state,X3: label,X0: state] :
( ( labels(X3,X1)
& has(X0,goto(X3)) )
=> succeeds(X1,X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goto_success) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : COM001_1 : TPTP v8.1.0. Released v5.0.0.
% 0.03/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.13/0.34 % Computer : n001.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Mon Aug 29 17:21:44 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.19/0.51 % (8566)dis+2_1:64_add=large:bce=on:bd=off:i=2:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.19/0.51 % (8561)ott+10_1:32_bd=off:fsr=off:newcnf=on:tgt=full:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.19/0.51 % (8581)ott+11_1:1_drc=off:nwc=5.0:slsq=on:slsqc=1:spb=goal_then_units:to=lpo:i=467:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/467Mi)
% 0.19/0.51 % (8558)fmb+10_1:1_bce=on:fmbsr=1.5:nm=4:skr=on:i=191324:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/191324Mi)
% 0.19/0.51 % (8566)Instruction limit reached!
% 0.19/0.51 % (8566)------------------------------
% 0.19/0.51 % (8566)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.51 % (8573)ott+11_2:3_av=off:fde=unused:nwc=5.0:tgt=ground:i=75:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/75Mi)
% 0.19/0.51 % (8581)First to succeed.
% 0.19/0.51 % (8566)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.51 % (8566)Termination reason: Unknown
% 0.19/0.51 % (8566)Termination phase: Saturation
% 0.19/0.51
% 0.19/0.51 % (8566)Memory used [KB]: 895
% 0.19/0.51 % (8566)Time elapsed: 0.004 s
% 0.19/0.51 % (8566)Instructions burned: 2 (million)
% 0.19/0.51 % (8566)------------------------------
% 0.19/0.51 % (8566)------------------------------
% 0.19/0.51 % (8568)ott+2_1:1_fsr=off:gsp=on:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 0.19/0.52 % (8560)ott+4_1:1_av=off:bd=off:nwc=5.0:s2a=on:s2at=2.0:slsq=on:slsqc=2:slsql=off:slsqr=1,2:sp=frequency:i=37:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/37Mi)
% 0.19/0.52 TRYING [1]
% 0.19/0.52 TRYING [2]
% 0.19/0.52 TRYING [3]
% 0.19/0.52 TRYING [4]
% 0.19/0.52 % (8559)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.19/0.52 % (8559)Refutation not found, incomplete strategy% (8559)------------------------------
% 0.19/0.52 % (8559)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.52 % (8559)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.52 % (8559)Termination reason: Refutation not found, incomplete strategy
% 0.19/0.52
% 0.19/0.52 % (8559)Memory used [KB]: 5373
% 0.19/0.52 % (8559)Time elapsed: 0.123 s
% 0.19/0.52 % (8559)Instructions burned: 2 (million)
% 0.19/0.52 % (8559)------------------------------
% 0.19/0.52 % (8559)------------------------------
% 0.19/0.52 TRYING [5]
% 0.19/0.52 % (8581)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 % (8581)------------------------------
% 0.19/0.52 % (8581)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.52 % (8581)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.52 % (8581)Termination reason: Refutation
% 0.19/0.52
% 0.19/0.52 % (8581)Memory used [KB]: 5373
% 0.19/0.52 % (8581)Time elapsed: 0.063 s
% 0.19/0.52 % (8581)Instructions burned: 2 (million)
% 0.19/0.52 % (8581)------------------------------
% 0.19/0.52 % (8581)------------------------------
% 0.19/0.52 % (8557)Success in time 0.173 s
%------------------------------------------------------------------------------