%------------------------------------------------------------------------------
% File : Beagle---0.9.52
% Problem : COM001-1 : TPTP v9.0.0. Released v1.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 : 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 : Wed Apr 9 05:50:29 PM UTC 2025
% Result : Unsatisfiable 3.41s 2.30s
% Output : CNFRefutation 3.51s
% 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 : 31 ( 17 ~; 14 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 0 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 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ succeeds > labels > has > follows > ifthen > equal_function > #nlpp > goto > register_j > p8 > p5 > p4 > p3 > out > n > loop
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(loop,type,
loop: $i ).
tff(labels,type,
labels: ( $i * $i ) > $o ).
tff(goto,type,
goto: $i > $i ).
tff(equal_function,type,
equal_function: ( $i * $i ) > $i ).
tff(register_j,type,
register_j: $i ).
tff(out,type,
out: $i ).
tff(p8,type,
p8: $i ).
tff(p5,type,
p5: $i ).
tff(n,type,
n: $i ).
tff(has,type,
has: ( $i * $i ) > $o ).
tff(p3,type,
p3: $i ).
tff(p4,type,
p4: $i ).
tff(succeeds,type,
succeeds: ( $i * $i ) > $o ).
tff(ifthen,type,
ifthen: ( $i * $i ) > $i ).
tff(follows,type,
follows: ( $i * $i ) > $o ).
tff(f_59,axiom,
follows(p8,p3),
file(unknown,unknown) ).
tff(f_60,axiom,
has(p8,goto(loop)),
file(unknown,unknown) ).
tff(f_55,axiom,
labels(loop,p3),
file(unknown,unknown) ).
tff(f_49,axiom,
! [Goal_state,Start_state,Label] :
( succeeds(Goal_state,Start_state)
| ~ has(Start_state,goto(Label))
| ~ labels(Label,Goal_state) ),
file(unknown,unknown) ).
tff(f_33,axiom,
! [Goal_state,Start_state] :
( succeeds(Goal_state,Start_state)
| ~ follows(Goal_state,Start_state) ),
file(unknown,unknown) ).
tff(f_41,axiom,
! [Goal_state,Start_state,Intermediate_state] :
( succeeds(Goal_state,Start_state)
| ~ succeeds(Goal_state,Intermediate_state)
| ~ succeeds(Intermediate_state,Start_state) ),
file(unknown,unknown) ).
tff(f_62,axiom,
~ succeeds(p3,p3),
file(unknown,unknown) ).
tff(c_18,plain,
follows(p8,p3),
inference(cnfTransformation,[status(thm)],[f_59]) ).
tff(c_20,plain,
has(p8,goto(loop)),
inference(cnfTransformation,[status(thm)],[f_60]) ).
tff(c_10,plain,
labels(loop,p3),
inference(cnfTransformation,[status(thm)],[f_55]) ).
tff(c_54,plain,
! [Label_22,Goal_state_23,Start_state_24] :
( ~ labels(Label_22,Goal_state_23)
| ~ has(Start_state_24,goto(Label_22))
| succeeds(Goal_state_23,Start_state_24) ),
inference(cnfTransformation,[status(thm)],[f_49]) ).
tff(c_58,plain,
! [Start_state_25] :
( ~ has(Start_state_25,goto(loop))
| succeeds(p3,Start_state_25) ),
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_1,Start_state_2] :
( ~ follows(Goal_state_1,Start_state_2)
| succeeds(Goal_state_1,Start_state_2) ),
inference(cnfTransformation,[status(thm)],[f_33]) ).
tff(c_33,plain,
! [Intermediate_state_17,Start_state_18,Goal_state_19] :
( ~ succeeds(Intermediate_state_17,Start_state_18)
| ~ succeeds(Goal_state_19,Intermediate_state_17)
| succeeds(Goal_state_19,Start_state_18) ),
inference(cnfTransformation,[status(thm)],[f_41]) ).
tff(c_70,plain,
! [Goal_state_27,Goal_state_28,Start_state_29] :
( ~ succeeds(Goal_state_27,Goal_state_28)
| succeeds(Goal_state_27,Start_state_29)
| ~ follows(Goal_state_28,Start_state_29) ),
inference(resolution,[status(thm)],[c_2,c_33]) ).
tff(c_99,plain,
! [Start_state_31] :
( 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_62]) ).
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.00/0.09 % Problem : COM001-1 : TPTP v9.0.0. Released v1.0.0.
% 0.09/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.09/0.29 % Computer : n012.cluster.edu
% 0.09/0.29 % Model : x86_64 x86_64
% 0.09/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.29 % Memory : 8042.1875MB
% 0.09/0.29 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.29 % CPULimit : 300
% 0.09/0.29 % WCLimit : 300
% 0.09/0.29 % DateTime : Mon Apr 7 16:09:00 EDT 2025
% 0.09/0.29 % CPUTime :
% 3.41/2.30 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.41/2.31
% 3.41/2.31 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------