TSTP Solution File: COM002_1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : COM002_1 : TPTP v8.1.2. Released v5.0.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n028.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:46:04 EDT 2024
% Result : Theorem 0.59s 0.75s
% Output : Refutation 0.59s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 41
% Syntax : Number of formulae : 67 ( 22 unt; 32 typ; 0 def)
% Number of atoms : 58 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 42 ( 19 ~; 14 |; 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 : 36 ( 36 !; 0 ?; 36 :)
% 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(f93,plain,
$false,
inference(subsumption_resolution,[],[f88,f75]) ).
tff(f75,plain,
succeeds(p3,p7),
inference(unit_resulting_resolution,[],[f55,f67,f48]) ).
tff(f48,plain,
! [X2: state,X0: state,X1: state] :
( succeeds(X2,X0)
| ~ succeeds(X1,X0)
| ~ succeeds(X2,X1) ),
inference(cnf_transformation,[],[f29]) ).
tff(f29,plain,
! [X0: state,X1: state,X2: state] :
( succeeds(X2,X0)
| ~ succeeds(X1,X0)
| ~ succeeds(X2,X1) ),
inference(flattening,[],[f28]) ).
tff(f28,plain,
! [X0: state,X1: state,X2: state] :
( succeeds(X2,X0)
| ~ succeeds(X1,X0)
| ~ succeeds(X2,X1) ),
inference(ennf_transformation,[],[f24]) ).
tff(f24,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/tmp/tmp.M0hqwdQtbE/Vampire---4.8_15893',transitivity_of_success) ).
tff(f67,plain,
succeeds(p3,p8),
inference(unit_resulting_resolution,[],[f34,f44,f46]) ).
tff(f46,plain,
! [X2: state,X0: state,X1: label] :
( ~ labels(X1,X0)
| succeeds(X0,X2)
| ~ has(X2,goto(X1)) ),
inference(cnf_transformation,[],[f26]) ).
tff(f26,plain,
! [X0: state,X1: label,X2: state] :
( succeeds(X0,X2)
| ~ labels(X1,X0)
| ~ has(X2,goto(X1)) ),
inference(flattening,[],[f25]) ).
tff(f25,plain,
! [X0: state,X1: label,X2: state] :
( succeeds(X0,X2)
| ~ labels(X1,X0)
| ~ has(X2,goto(X1)) ),
inference(ennf_transformation,[],[f22]) ).
tff(f22,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/tmp/tmp.M0hqwdQtbE/Vampire---4.8_15893',goto_success) ).
tff(f44,plain,
has(p8,goto(loop)),
inference(cnf_transformation,[],[f18]) ).
tff(f18,axiom,
has(p8,goto(loop)),
file('/export/starexec/sandbox2/tmp/tmp.M0hqwdQtbE/Vampire---4.8_15893',state_8) ).
tff(f34,plain,
labels(loop,p3),
inference(cnf_transformation,[],[f8]) ).
tff(f8,axiom,
labels(loop,p3),
file('/export/starexec/sandbox2/tmp/tmp.M0hqwdQtbE/Vampire---4.8_15893',label_state_3) ).
tff(f55,plain,
succeeds(p8,p7),
inference(unit_resulting_resolution,[],[f43,f49]) ).
tff(f49,plain,
! [X0: state,X1: state] :
( succeeds(X1,X0)
| ~ follows(X1,X0) ),
inference(cnf_transformation,[],[f30]) ).
tff(f30,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/tmp/tmp.M0hqwdQtbE/Vampire---4.8_15893',direct_success) ).
tff(f43,plain,
follows(p8,p7),
inference(cnf_transformation,[],[f17]) ).
tff(f17,axiom,
follows(p8,p7),
file('/export/starexec/sandbox2/tmp/tmp.M0hqwdQtbE/Vampire---4.8_15893',transition_7_to_8) ).
tff(f88,plain,
~ succeeds(p3,p7),
inference(unit_resulting_resolution,[],[f54,f65,f48]) ).
tff(f65,plain,
~ succeeds(p3,p6),
inference(unit_resulting_resolution,[],[f45,f53,f48]) ).
tff(f53,plain,
succeeds(p6,p3),
inference(unit_resulting_resolution,[],[f39,f49]) ).
tff(f39,plain,
follows(p6,p3),
inference(cnf_transformation,[],[f13]) ).
tff(f13,axiom,
follows(p6,p3),
file('/export/starexec/sandbox2/tmp/tmp.M0hqwdQtbE/Vampire---4.8_15893',transition_3_to_6) ).
tff(f45,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/sandbox2/tmp/tmp.M0hqwdQtbE/Vampire---4.8_15893',prove_there_is_a_loop_through_p3) ).
tff(f54,plain,
succeeds(p7,p6),
inference(unit_resulting_resolution,[],[f41,f49]) ).
tff(f41,plain,
follows(p7,p6),
inference(cnf_transformation,[],[f15]) ).
tff(f15,axiom,
follows(p7,p6),
file('/export/starexec/sandbox2/tmp/tmp.M0hqwdQtbE/Vampire---4.8_15893',transition_6_to_7) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : COM002_1 : TPTP v8.1.2. Released v5.0.0.
% 0.04/0.14 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.15/0.35 % Computer : n028.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Fri May 3 21:25:53 EDT 2024
% 0.15/0.35 % CPUTime :
% 0.15/0.35 This is a TF0_THM_NEQ_NAR problem
% 0.15/0.35 Running vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t 300 /export/starexec/sandbox2/tmp/tmp.M0hqwdQtbE/Vampire---4.8_15893
% 0.59/0.75 % (16254)lrs-21_1:1_to=lpo:sil=2000:sp=frequency:sos=on:lma=on:i=56:sd=2:ss=axioms:ep=R_0 on Vampire---4 for (2996ds/56Mi)
% 0.59/0.75 % (16247)dis-1011_2:1_sil=2000:lsd=20:nwc=5.0:flr=on:mep=off:st=3.0:i=34:sd=1:ep=RS:ss=axioms_0 on Vampire---4 for (2996ds/34Mi)
% 0.59/0.75 % (16249)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on Vampire---4 for (2996ds/78Mi)
% 0.59/0.75 % (16250)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on Vampire---4 for (2996ds/33Mi)
% 0.59/0.75 % (16248)lrs+1011_461:32768_sil=16000:irw=on:sp=frequency:lsd=20:fd=preordered:nwc=10.0:s2agt=32:alpa=false:cond=fast:s2a=on:i=51:s2at=3.0:awrs=decay:awrsf=691:bd=off:nm=20:fsr=off:amm=sco:uhcvi=on:rawr=on_0 on Vampire---4 for (2996ds/51Mi)
% 0.59/0.75 % (16252)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on Vampire---4 for (2996ds/45Mi)
% 0.59/0.75 % (16251)lrs+2_1:1_sil=16000:fde=none:sos=all:nwc=5.0:i=34:ep=RS:s2pl=on:lma=on:afp=100000_0 on Vampire---4 for (2996ds/34Mi)
% 0.59/0.75 % (16253)lrs+21_1:5_sil=2000:sos=on:urr=on:newcnf=on:slsq=on:i=83:slsql=off:bd=off:nm=2:ss=axioms:st=1.5:sp=const_min:gsp=on:rawr=on_0 on Vampire---4 for (2996ds/83Mi)
% 0.59/0.75 % (16250)First to succeed.
% 0.59/0.75 % (16253)Also succeeded, but the first one will report.
% 0.59/0.75 % (16248)Also succeeded, but the first one will report.
% 0.59/0.75 % (16249)Also succeeded, but the first one will report.
% 0.59/0.75 % (16252)Also succeeded, but the first one will report.
% 0.59/0.75 % (16250)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-16075"
% 0.59/0.75 % (16250)Refutation found. Thanks to Tanya!
% 0.59/0.75 % SZS status Theorem for Vampire---4
% 0.59/0.75 % SZS output start Proof for Vampire---4
% See solution above
% 0.59/0.75 % (16250)------------------------------
% 0.59/0.75 % (16250)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.59/0.75 % (16250)Termination reason: Refutation
% 0.59/0.75
% 0.59/0.75 % (16250)Memory used [KB]: 985
% 0.59/0.75 % (16250)Time elapsed: 0.004 s
% 0.59/0.75 % (16250)Instructions burned: 4 (million)
% 0.59/0.75 % (16075)Success in time 0.393 s
% 0.59/0.76 % Vampire---4.8 exiting
%------------------------------------------------------------------------------