%------------------------------------------------------------------------------
% File : Beagle---0.9.52
% Problem : COM002_1 : TPTP v9.0.0. Released v5.0.0.
% Transfm : none
% Format : tptp:raw
% Command : java -Dfile.encoding=UTF-8 -Xms512M -Xmx4G -Xss10M -jar /export/starexec/sandbox2/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox2/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s
% Computer : n021.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 Apr 9 05:50:30 PM UTC 2025
% Result : Theorem 4.30s 2.11s
% Output : CNFRefutation 4.59s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 9
% Syntax : Number of formulae : 31 ( 15 unt; 0 typ; 0 def)
% Number of atoms : 57 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 51 ( 25 ~; 21 |; 2 &)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 7 ( 6 usr)
% Number of type conns : 0 ( 0 >; 0 *; 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 : 35 ( 35 !; 0 ?; 35 :)
% Comments :
%------------------------------------------------------------------------------
%$ succeeds > labels > has > follows > times > plus > ifthen > equal_function > assign > #nlpp > goto > register_k > register_j > p8 > p7 > p6 > p5 > p4 > p3 > p2 > p1 > out > n2 > n1 > n0 > n > loop
%Foreground sorts:
tff(label,type,
label: $tType ).
tff(state,type,
state: $tType ).
tff(statement,type,
statement: $tType ).
tff(boolean,type,
boolean: $tType ).
tff(register,type,
register: $tType ).
tff(number,type,
number: $tType ).
%Background operators:
%Foreground operators:
tff(n1,type,
n1: number ).
tff(out,type,
out: label ).
tff(register_k,type,
register_k: register ).
tff(goto,type,
goto: label > statement ).
tff(equal_function,type,
equal_function: ( register * number ) > boolean ).
tff(register_j,type,
register_j: register ).
tff(n0,type,
n0: number ).
tff(p8,type,
p8: state ).
tff(labels,type,
labels: ( label * state ) > $o ).
tff(p6,type,
p6: state ).
tff(p7,type,
p7: state ).
tff(assign,type,
assign: ( register * number ) > statement ).
tff(ifthen,type,
ifthen: ( boolean * state ) > statement ).
tff(p2,type,
p2: state ).
tff(times,type,
times: ( number * register ) > number ).
tff(p5,type,
p5: state ).
tff(n2,type,
n2: number ).
tff(has,type,
has: ( state * statement ) > $o ).
tff(plus,type,
plus: ( register * number ) > number ).
tff(succeeds,type,
succeeds: ( state * state ) > $o ).
tff(n,type,
n: number ).
tff(p1,type,
p1: state ).
tff(loop,type,
loop: label ).
tff(p3,type,
p3: state ).
tff(follows,type,
follows: ( state * state ) > $o ).
tff(p4,type,
p4: state ).
tff(f_64,hypothesis,
follows(p8,p7),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',transition_7_to_8) ).
tff(f_62,hypothesis,
follows(p7,p6),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',transition_6_to_7) ).
tff(f_67,negated_conjecture,
~ succeeds(p3,p3),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_there_is_a_loop_through_p3) ).
tff(f_65,hypothesis,
has(p8,goto(loop)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',state_8) ).
tff(f_55,hypothesis,
labels(loop,p3),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',label_state_3) ).
tff(f_47,axiom,
! [Goal_state: state,Label: label,Start_state: state] :
( ( has(Start_state,goto(Label))
& labels(Label,Goal_state) )
=> succeeds(Goal_state,Start_state) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goto_success) ).
tff(f_35,axiom,
! [Start_state: state,Goal_state: state] :
( follows(Goal_state,Start_state)
=> succeeds(Goal_state,Start_state) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',direct_success) ).
tff(f_41,axiom,
! [Start_state: state,Intermediate_state: state,Goal_state: state] :
( ( succeeds(Goal_state,Intermediate_state)
& succeeds(Intermediate_state,Start_state) )
=> succeeds(Goal_state,Start_state) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',transitivity_of_success) ).
tff(f_60,hypothesis,
follows(p6,p3),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',transition_3_to_6) ).
tff(c_34,plain,
follows(p8,p7),
inference(cnfTransformation,[status(thm)],[f_64]) ).
tff(c_30,plain,
follows(p7,p6),
inference(cnfTransformation,[status(thm)],[f_62]) ).
tff(c_38,plain,
~ succeeds(p3,p3),
inference(cnfTransformation,[status(thm)],[f_67]) ).
tff(c_36,plain,
has(p8,goto(loop)),
inference(cnfTransformation,[status(thm)],[f_65]) ).
tff(c_16,plain,
labels(loop,p3),
inference(cnfTransformation,[status(thm)],[f_55]) ).
tff(c_93,plain,
! [Goal_state_26: state,Start_state_27: state,Label_28: label] :
( succeeds(Goal_state_26,Start_state_27)
| ~ labels(Label_28,Goal_state_26)
| ~ has(Start_state_27,goto(Label_28)) ),
inference(cnfTransformation,[status(thm)],[f_47]) ).
tff(c_97,plain,
! [Start_state_29: state] :
( succeeds(p3,Start_state_29)
| ~ has(Start_state_29,goto(loop)) ),
inference(resolution,[status(thm)],[c_16,c_93]) ).
tff(c_101,plain,
succeeds(p3,p8),
inference(resolution,[status(thm)],[c_36,c_97]) ).
tff(c_2,plain,
! [Goal_state_2: state,Start_state_1: state] :
( succeeds(Goal_state_2,Start_state_1)
| ~ follows(Goal_state_2,Start_state_1) ),
inference(cnfTransformation,[status(thm)],[f_35]) ).
tff(c_49,plain,
! [Goal_state_17: state,Start_state_18: state,Intermediate_state_19: state] :
( succeeds(Goal_state_17,Start_state_18)
| ~ succeeds(Intermediate_state_19,Start_state_18)
| ~ succeeds(Goal_state_17,Intermediate_state_19) ),
inference(cnfTransformation,[status(thm)],[f_41]) ).
tff(c_55,plain,
! [Goal_state_17: state,Start_state_1: state,Goal_state_2: state] :
( succeeds(Goal_state_17,Start_state_1)
| ~ succeeds(Goal_state_17,Goal_state_2)
| ~ follows(Goal_state_2,Start_state_1) ),
inference(resolution,[status(thm)],[c_2,c_49]) ).
tff(c_106,plain,
! [Start_state_1: state] :
( succeeds(p3,Start_state_1)
| ~ follows(p8,Start_state_1) ),
inference(resolution,[status(thm)],[c_101,c_55]) ).
tff(c_26,plain,
follows(p6,p3),
inference(cnfTransformation,[status(thm)],[f_60]) ).
tff(c_70,plain,
! [Goal_state_22: state,Start_state_23: state,Goal_state_24: state] :
( succeeds(Goal_state_22,Start_state_23)
| ~ succeeds(Goal_state_22,Goal_state_24)
| ~ follows(Goal_state_24,Start_state_23) ),
inference(resolution,[status(thm)],[c_2,c_49]) ).
tff(c_133,plain,
! [Goal_state_32: state,Start_state_33: state,Start_state_34: state] :
( succeeds(Goal_state_32,Start_state_33)
| ~ follows(Start_state_34,Start_state_33)
| ~ follows(Goal_state_32,Start_state_34) ),
inference(resolution,[status(thm)],[c_2,c_70]) ).
tff(c_152,plain,
! [Goal_state_35: state] :
( succeeds(Goal_state_35,p3)
| ~ follows(Goal_state_35,p6) ),
inference(resolution,[status(thm)],[c_26,c_133]) ).
tff(c_4,plain,
! [Goal_state_5: state,Start_state_3: state,Intermediate_state_4: state] :
( succeeds(Goal_state_5,Start_state_3)
| ~ succeeds(Intermediate_state_4,Start_state_3)
| ~ succeeds(Goal_state_5,Intermediate_state_4) ),
inference(cnfTransformation,[status(thm)],[f_41]) ).
tff(c_694,plain,
! [Goal_state_67: state,Goal_state_68: state] :
( succeeds(Goal_state_67,p3)
| ~ succeeds(Goal_state_67,Goal_state_68)
| ~ follows(Goal_state_68,p6) ),
inference(resolution,[status(thm)],[c_152,c_4]) ).
tff(c_730,plain,
! [Start_state_1: state] :
( succeeds(p3,p3)
| ~ follows(Start_state_1,p6)
| ~ follows(p8,Start_state_1) ),
inference(resolution,[status(thm)],[c_106,c_694]) ).
tff(c_801,plain,
! [Start_state_70: state] :
( ~ follows(Start_state_70,p6)
| ~ follows(p8,Start_state_70) ),
inference(negUnitSimplification,[status(thm)],[c_38,c_730]) ).
tff(c_803,plain,
~ follows(p8,p7),
inference(resolution,[status(thm)],[c_30,c_801]) ).
tff(c_807,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_34,c_803]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : COM002_1 : TPTP v9.0.0. Released v5.0.0.
% 0.08/0.14 % Command : java -Dfile.encoding=UTF-8 -Xms512M -Xmx4G -Xss10M -jar /export/starexec/sandbox2/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox2/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s
% 0.14/0.35 % Computer : n021.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 : Mon Apr 7 16:10:43 EDT 2025
% 0.14/0.35 % CPUTime :
% 4.30/2.11 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 4.30/2.11
% 4.30/2.11 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------