TSTP Solution File: COM001_1 by Vampire-SAT---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire-SAT---4.8
% Problem : COM001_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 : n008.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 : Tue Apr 30 10:46:31 EDT 2024
% Result : Theorem 0.14s 0.37s
% Output : Refutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 28
% Syntax : Number of formulae : 50 ( 14 unt; 21 typ; 0 def)
% Number of atoms : 54 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 44 ( 19 ~; 16 |; 4 &)
% ( 0 <=>; 5 =>; 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 : 38 ( 38 !; 0 ?; 38 :)
% 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(f47,plain,
$false,
inference(subsumption_resolution,[],[f45,f23]) ).
tff(f23,plain,
~ succeeds(p3,p3),
inference(cnf_transformation,[],[f13]) ).
tff(f13,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(f45,plain,
succeeds(p3,p3),
inference(resolution,[],[f44,f38]) ).
tff(f38,plain,
! [X0: state] :
( ~ succeeds(X0,p8)
| succeeds(X0,p3) ),
inference(resolution,[],[f32,f35]) ).
tff(f35,plain,
succeeds(p8,p3),
inference(resolution,[],[f30,f26]) ).
tff(f26,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(f30,plain,
! [X0: state,X1: state] :
( ~ follows(X1,X0)
| succeeds(X1,X0) ),
inference(cnf_transformation,[],[f17]) ).
tff(f17,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/sandbox2/benchmark/theBenchmark.p',direct_success) ).
tff(f32,plain,
! [X2: state,X0: state,X1: state] :
( ~ succeeds(X1,X0)
| succeeds(X2,X0)
| ~ succeeds(X2,X1) ),
inference(cnf_transformation,[],[f20]) ).
tff(f20,plain,
! [X0: state,X1: state,X2: state] :
( succeeds(X2,X0)
| ~ succeeds(X1,X0)
| ~ succeeds(X2,X1) ),
inference(flattening,[],[f19]) ).
tff(f19,plain,
! [X0: state,X1: state,X2: state] :
( succeeds(X2,X0)
| ~ succeeds(X1,X0)
| ~ succeeds(X2,X1) ),
inference(ennf_transformation,[],[f15]) ).
tff(f15,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/sandbox2/benchmark/theBenchmark.p',transitivity_of_success) ).
tff(f44,plain,
succeeds(p3,p8),
inference(resolution,[],[f42,f24]) ).
tff(f24,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(f42,plain,
! [X0: state] :
( ~ labels(loop,X0)
| succeeds(X0,p8) ),
inference(resolution,[],[f33,f27]) ).
tff(f27,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(f33,plain,
! [X2: state,X0: state,X1: label] :
( ~ has(X2,goto(X1))
| ~ labels(X1,X0)
| succeeds(X0,X2) ),
inference(cnf_transformation,[],[f22]) ).
tff(f22,plain,
! [X0: state,X1: label,X2: state] :
( succeeds(X0,X2)
| ~ labels(X1,X0)
| ~ has(X2,goto(X1)) ),
inference(flattening,[],[f21]) ).
tff(f21,plain,
! [X0: state,X1: label,X2: state] :
( succeeds(X0,X2)
| ~ labels(X1,X0)
| ~ has(X2,goto(X1)) ),
inference(ennf_transformation,[],[f16]) ).
tff(f16,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/sandbox2/benchmark/theBenchmark.p',goto_success) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : COM001_1 : TPTP v8.1.2. Released v5.0.0.
% 0.07/0.14 % Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.14/0.35 % Computer : n008.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 Apr 30 05:08:43 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.14/0.35 % (7753)Running in auto input_syntax mode. Trying TPTP
% 0.14/0.37 % (7757)fmb+10_1_bce=on:fmbas=expand:fmbksg=on:fmbsr=1.3:gsp=on:nm=4_470 on theBenchmark for (470ds/0Mi)
% 0.14/0.37 % (7756)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.14/0.37 % (7759)dis+11_4:5_nm=4_216 on theBenchmark for (216ds/0Mi)
% 0.14/0.37 % (7760)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.14/0.37 % (7758)dis+1_20_av=off:lcm=predicate:nm=2:nwc=2.0_396 on theBenchmark for (396ds/0Mi)
% 0.14/0.37 % (7754)fmb+10_1_fmbas=off:fmbsr=1.3:nm=2_1451 on theBenchmark for (1451ds/0Mi)
% 0.14/0.37 % (7755)fmb+10_1_bce=on:fmbas=expand:fmbksg=on:fmbsr=1.3_569 on theBenchmark for (569ds/0Mi)
% 0.14/0.37 % (7758)First to succeed.
% 0.14/0.37 Detected minimum model sizes of [1,1,1,1,1,1]
% 0.14/0.37 Detected minimum model sizes of [1,1,1,1,1,1]
% 0.14/0.37 Detected maximum model sizes of [4,1,1,2,max,max]
% 0.14/0.37 Detected minimum model sizes of [1,1,1,1,1,1]
% 0.14/0.37 Detected maximum model sizes of [4,1,1,2,max,max]
% 0.14/0.37 Detected maximum model sizes of [4,1,1,2,max,max]
% 0.14/0.37 TRYING [1,1,1,1,1,1]
% 0.14/0.37 TRYING [1,1,1,1,1,1]
% 0.14/0.37 TRYING [1,1,1,1,1,1]
% 0.14/0.37 Detected minimum model sizes of [1,1,1,1,1,1]
% 0.14/0.37 Detected maximum model sizes of [4,1,1,2,max,max]
% 0.14/0.37 TRYING [1,1,1,1,1,1]
% 0.14/0.37 TRYING [1,1,1,1,1,2]
% 0.14/0.37 TRYING [1,1,1,1,1,2]
% 0.14/0.37 TRYING [1,1,1,1,1,2]
% 0.14/0.37 TRYING [1,1,1,1,1,2]
% 0.14/0.37 TRYING [2,1,1,1,1,2]
% 0.14/0.37 TRYING [2,1,1,1,1,2]
% 0.14/0.37 % (7759)Also succeeded, but the first one will report.
% 0.14/0.37 TRYING [2,1,1,1,1,2]
% 0.14/0.37 TRYING [2,1,1,1,1,2]
% 0.14/0.37 TRYING [2,1,1,2,1,2]
% 0.14/0.37 TRYING [2,1,1,2,1,2]
% 0.14/0.37 TRYING [2,1,1,2,1,2]
% 0.14/0.37 TRYING [2,1,1,2,1,2]
% 0.14/0.37 TRYING [2,1,1,1,1,3]
% 0.14/0.37 % (7756)Also succeeded, but the first one will report.
% 0.14/0.37 % (7758)Refutation found. Thanks to Tanya!
% 0.14/0.37 % SZS status Theorem for theBenchmark
% 0.14/0.37 % SZS output start Proof for theBenchmark
% See solution above
% 0.14/0.37 % (7758)------------------------------
% 0.14/0.37 % (7758)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.14/0.37 % (7758)Termination reason: Refutation
% 0.14/0.37
% 0.14/0.37 % (7758)Memory used [KB]: 748
% 0.14/0.37 % (7758)Time elapsed: 0.003 s
% 0.14/0.37 % (7758)Instructions burned: 3 (million)
% 0.14/0.37 % (7758)------------------------------
% 0.14/0.37 % (7758)------------------------------
% 0.14/0.37 % (7753)Success in time 0.01 s
%------------------------------------------------------------------------------