%------------------------------------------------------------------------------
% File : Beagle---0.9.52
% Problem : COM001_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 : n006.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 3.48s 2.08s
% Output : CNFRefutation 3.67s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 7
% Syntax : Number of formulae : 20 ( 11 unt; 0 typ; 0 def)
% Number of atoms : 34 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 26 ( 12 ~; 9 |; 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 : 11 ( 11 usr; 8 con; 0-2 aty)
% Number of variables : 21 ( 21 !; 0 ?; 21 :)
% Comments :
%------------------------------------------------------------------------------
%$ succeeds > labels > has > follows > ifthen > equal_function > #nlpp > goto > register_j > p8 > p5 > p4 > p3 > out > 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(out,type,
out: label ).
tff(goto,type,
goto: label > statement ).
tff(equal_function,type,
equal_function: ( register * number ) > boolean ).
tff(register_j,type,
register_j: register ).
tff(p8,type,
p8: state ).
tff(labels,type,
labels: ( label * state ) > $o ).
tff(ifthen,type,
ifthen: ( boolean * state ) > statement ).
tff(p5,type,
p5: state ).
tff(has,type,
has: ( state * statement ) > $o ).
tff(succeeds,type,
succeeds: ( state * state ) > $o ).
tff(n,type,
n: number ).
tff(loop,type,
loop: label ).
tff(p3,type,
p3: state ).
tff(follows,type,
follows: ( state * state ) > $o ).
tff(p4,type,
p4: state ).
tff(f_57,hypothesis,
follows(p8,p3),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',transition_3_to_8) ).
tff(f_58,hypothesis,
has(p8,goto(loop)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',state_8) ).
tff(f_53,hypothesis,
labels(loop,p3),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',label_state_3) ).
tff(f_48,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_36,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_42,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,negated_conjecture,
~ succeeds(p3,p3),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_there_is_a_loop_through_p3) ).
tff(c_18,plain,
follows(p8,p3),
inference(cnfTransformation,[status(thm)],[f_57]) ).
tff(c_20,plain,
has(p8,goto(loop)),
inference(cnfTransformation,[status(thm)],[f_58]) ).
tff(c_10,plain,
labels(loop,p3),
inference(cnfTransformation,[status(thm)],[f_53]) ).
tff(c_54,plain,
! [Goal_state_22: state,Start_state_23: state,Label_24: label] :
( succeeds(Goal_state_22,Start_state_23)
| ~ labels(Label_24,Goal_state_22)
| ~ has(Start_state_23,goto(Label_24)) ),
inference(cnfTransformation,[status(thm)],[f_48]) ).
tff(c_58,plain,
! [Start_state_25: state] :
( succeeds(p3,Start_state_25)
| ~ has(Start_state_25,goto(loop)) ),
inference(resolution,[status(thm)],[c_10,c_54]) ).
tff(c_62,plain,
succeeds(p3,p8),
inference(resolution,[status(thm)],[c_20,c_58]) ).
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_36]) ).
tff(c_33,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_42]) ).
tff(c_70,plain,
! [Goal_state_27: state,Start_state_28: state,Goal_state_29: state] :
( succeeds(Goal_state_27,Start_state_28)
| ~ succeeds(Goal_state_27,Goal_state_29)
| ~ follows(Goal_state_29,Start_state_28) ),
inference(resolution,[status(thm)],[c_2,c_33]) ).
tff(c_99,plain,
! [Start_state_31: state] :
( succeeds(p3,Start_state_31)
| ~ follows(p8,Start_state_31) ),
inference(resolution,[status(thm)],[c_62,c_70]) ).
tff(c_22,plain,
~ succeeds(p3,p3),
inference(cnfTransformation,[status(thm)],[f_60]) ).
tff(c_110,plain,
~ follows(p8,p3),
inference(resolution,[status(thm)],[c_99,c_22]) ).
tff(c_119,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_18,c_110]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.09 % Problem : COM001_1 : TPTP v9.0.0. Released v5.0.0.
% 0.02/0.09 % 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.10/0.29 % Computer : n006.cluster.edu
% 0.10/0.29 % Model : x86_64 x86_64
% 0.10/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.29 % Memory : 8042.1875MB
% 0.10/0.29 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.29 % CPULimit : 300
% 0.10/0.29 % WCLimit : 300
% 0.10/0.29 % DateTime : Mon Apr 7 16:09:23 EDT 2025
% 0.10/0.29 % CPUTime :
% 3.48/2.08 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.67/2.08
% 3.67/2.08 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------