TSTP Solution File: COM002_1 by Vampire-SAT---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire-SAT---4.8
% Problem : COM002_1 : TPTP v8.1.2. Released v5.0.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% Computer : n012.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 : Sun May 5 04:47:08 EDT 2024
% Result : Theorem 0.12s 0.36s
% Output : Refutation 0.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 41
% Syntax : Number of formulae : 71 ( 22 unt; 32 typ; 0 def)
% Number of atoms : 66 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 48 ( 21 ~; 18 |; 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 : 40 ( 40 !; 0 ?; 40 :)
% 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(f103,plain,
$false,
inference(subsumption_resolution,[],[f101,f31]) ).
tff(f31,plain,
~ succeeds(p3,p3),
inference(cnf_transformation,[],[f21]) ).
tff(f21,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(f101,plain,
succeeds(p3,p3),
inference(resolution,[],[f99,f61]) ).
tff(f61,plain,
! [X0: state] :
( ~ succeeds(X0,p6)
| succeeds(X0,p3) ),
inference(resolution,[],[f48,f53]) ).
tff(f53,plain,
succeeds(p6,p3),
inference(resolution,[],[f46,f37]) ).
tff(f37,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(f46,plain,
! [X0: state,X1: state] :
( ~ follows(X1,X0)
| succeeds(X1,X0) ),
inference(cnf_transformation,[],[f25]) ).
tff(f25,plain,
! [X0: state,X1: state] :
( succeeds(X1,X0)
| ~ follows(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(f48,plain,
! [X2: state,X0: state,X1: state] :
( ~ succeeds(X1,X0)
| succeeds(X2,X0)
| ~ succeeds(X2,X1) ),
inference(cnf_transformation,[],[f28]) ).
tff(f28,plain,
! [X0: state,X1: state,X2: state] :
( succeeds(X2,X0)
| ~ succeeds(X1,X0)
| ~ succeeds(X2,X1) ),
inference(flattening,[],[f27]) ).
tff(f27,plain,
! [X0: state,X1: state,X2: state] :
( succeeds(X2,X0)
| ~ succeeds(X1,X0)
| ~ succeeds(X2,X1) ),
inference(ennf_transformation,[],[f23]) ).
tff(f23,plain,
! [X0: state,X1: state,X2: state] :
( ( succeeds(X1,X0)
& succeeds(X2,X1) )
=> succeeds(X2,X0) ),
inference(rectify,[],[f2]) ).
tff(f2,axiom,
! [X0: state,X2: state,X1: state] :
( ( succeeds(X2,X0)
& succeeds(X1,X2) )
=> succeeds(X1,X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',transitivity_of_success) ).
tff(f99,plain,
succeeds(p3,p6),
inference(resolution,[],[f98,f62]) ).
tff(f62,plain,
! [X0: state] :
( ~ succeeds(X0,p7)
| succeeds(X0,p6) ),
inference(resolution,[],[f48,f54]) ).
tff(f54,plain,
succeeds(p7,p6),
inference(resolution,[],[f46,f36]) ).
tff(f36,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(f98,plain,
succeeds(p3,p7),
inference(resolution,[],[f63,f96]) ).
tff(f96,plain,
succeeds(p3,p8),
inference(resolution,[],[f89,f32]) ).
tff(f32,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(f89,plain,
! [X0: state] :
( ~ labels(loop,X0)
| succeeds(X0,p8) ),
inference(resolution,[],[f49,f39]) ).
tff(f39,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(f49,plain,
! [X2: state,X0: state,X1: label] :
( ~ has(X2,goto(X1))
| ~ labels(X1,X0)
| succeeds(X0,X2) ),
inference(cnf_transformation,[],[f30]) ).
tff(f30,plain,
! [X0: state,X1: label,X2: state] :
( succeeds(X0,X2)
| ~ labels(X1,X0)
| ~ has(X2,goto(X1)) ),
inference(flattening,[],[f29]) ).
tff(f29,plain,
! [X0: state,X1: label,X2: state] :
( succeeds(X0,X2)
| ~ labels(X1,X0)
| ~ has(X2,goto(X1)) ),
inference(ennf_transformation,[],[f24]) ).
tff(f24,plain,
! [X0: state,X1: label,X2: state] :
( ( 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/sandbox/benchmark/theBenchmark.p',goto_success) ).
tff(f63,plain,
! [X0: state] :
( ~ succeeds(X0,p8)
| succeeds(X0,p7) ),
inference(resolution,[],[f48,f55]) ).
tff(f55,plain,
succeeds(p8,p7),
inference(resolution,[],[f46,f34]) ).
tff(f34,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.06/0.11 % Problem : COM002_1 : TPTP v8.1.2. Released v5.0.0.
% 0.06/0.13 % Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.12/0.34 % Computer : n012.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Fri May 3 21:25:53 EDT 2024
% 0.12/0.34 % CPUTime :
% 0.12/0.34 % (6506)Running in auto input_syntax mode. Trying TPTP
% 0.12/0.35 % (6512)dis+11_4:5_nm=4_216 on theBenchmark for (216ds/0Mi)
% 0.12/0.36 % (6510)fmb+10_1_bce=on:fmbas=expand:fmbksg=on:fmbsr=1.3:gsp=on:nm=4_470 on theBenchmark for (470ds/0Mi)
% 0.12/0.36 % (6509)dis-2_2:3_amm=sco:anc=none:bce=on:fsr=off:gsp=on:nm=16:nwc=1.2:nicw=on:sac=on:sp=weighted_frequency_476 on theBenchmark for (476ds/0Mi)
% 0.12/0.36 % (6511)dis+1_20_av=off:lcm=predicate:nm=2:nwc=2.0_396 on theBenchmark for (396ds/0Mi)
% 0.12/0.36 % (6513)fmb+10_1_fmbas=off:fmbsr=1.3:nm=2:si=on:rtra=on:rawr=on:rp=on:fmbksg=on_1451 on theBenchmark for (1451ds/0Mi)
% 0.12/0.36 % (6508)fmb+10_1_bce=on:fmbas=expand:fmbksg=on:fmbsr=1.3_569 on theBenchmark for (569ds/0Mi)
% 0.12/0.36 Detected minimum model sizes of [1,1,1,1,1,1]
% 0.12/0.36 Detected maximum model sizes of [8,1,1,2,max,max]
% 0.12/0.36 TRYING [1,1,1,1,1,1]
% 0.12/0.36 TRYING [2,1,1,1,1,1]
% 0.12/0.36 Detected minimum model sizes of [1,1,1,1,1,1]
% 0.12/0.36 Detected maximum model sizes of [8,1,1,2,max,max]
% 0.12/0.36 TRYING [3,1,1,1,1,1]
% 0.12/0.36 TRYING [1,1,1,1,1,1]
% 0.12/0.36 Detected minimum model sizes of [1,1,1,1,1,1]
% 0.12/0.36 Detected maximum model sizes of [8,max,2,2,max,max]
% 0.12/0.36 % (6511)First to succeed.
% 0.12/0.36 TRYING [1,1,1,1,1,1]
% 0.12/0.36 % (6512)Also succeeded, but the first one will report.
% 0.12/0.36 TRYING [2,1,1,1,1,1]
% 0.12/0.36 TRYING [2,1,1,1,1,1]
% 0.12/0.36 TRYING [3,1,1,1,1,1]
% 0.12/0.36 % (6511)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-6506"
% 0.12/0.36 TRYING [3,1,1,1,1,2]
% 0.12/0.36 TRYING [3,1,1,1,1,1]
% 0.12/0.36 % (6511)Refutation found. Thanks to Tanya!
% 0.12/0.36 % SZS status Theorem for theBenchmark
% 0.12/0.36 % SZS output start Proof for theBenchmark
% See solution above
% 0.12/0.36 % (6511)------------------------------
% 0.12/0.36 % (6511)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.12/0.36 % (6511)Termination reason: Refutation
% 0.12/0.36
% 0.12/0.36 % (6511)Memory used [KB]: 758
% 0.12/0.36 % (6511)Time elapsed: 0.004 s
% 0.12/0.36 % (6511)Instructions burned: 5 (million)
% 0.12/0.36 % (6506)Success in time 0.008 s
%------------------------------------------------------------------------------