%------------------------------------------------------------------------------
% File : Beagle---0.9.52
% Problem : NUM023-1 : TPTP v9.0.0. Bugfixed v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : java -Dfile.encoding=UTF-8 -Xms512M -Xmx4G -Xss10M -jar /export/starexec/sandbox/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -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 : Wed Apr 9 07:55:02 PM UTC 2025
% Result : Unsatisfiable 2.72s 1.63s
% Output : CNFRefutation 2.91s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 3
% Syntax : Number of formulae : 8 ( 6 unt; 0 typ; 0 def)
% Number of atoms : 10 ( 0 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 6 ( 4 ~; 2 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 2 con; 0-2 aty)
% Number of variables : 9 ( 9 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ less > equalish > predecessor_of_1st_minus_2nd > multiply > add > #nlpp > successor > n0 > a
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(a,type,
a: $i ).
tff(multiply,type,
multiply: ( $i * $i ) > $i ).
tff(less,type,
less: ( $i * $i ) > $o ).
tff(add,type,
add: ( $i * $i ) > $i ).
tff(n0,type,
n0: $i ).
tff(predecessor_of_1st_minus_2nd,type,
predecessor_of_1st_minus_2nd: ( $i * $i ) > $i ).
tff(equalish,type,
equalish: ( $i * $i ) > $o ).
tff(successor,type,
successor: $i > $i ).
tff(f_49,axiom,
! [A] : equalish(add(A,n0),A),
file(unknown,unknown) ).
tff(f_100,axiom,
! [A,B,C] :
( ~ equalish(add(successor(A),B),C)
| less(B,C) ),
file(unknown,unknown) ).
tff(f_129,axiom,
~ less(n0,successor(a)),
file(unknown,unknown) ).
tff(c_2,plain,
! [A_1] : equalish(add(A_1,n0),A_1),
inference(cnfTransformation,[status(thm)],[f_49]) ).
tff(c_99,plain,
! [B_48,C_49,A_50] :
( less(B_48,C_49)
| ~ equalish(add(successor(A_50),B_48),C_49) ),
inference(cnfTransformation,[status(thm)],[f_100]) ).
tff(c_113,plain,
! [A_50] : less(n0,successor(A_50)),
inference(resolution,[status(thm)],[c_2,c_99]) ).
tff(c_30,plain,
~ less(n0,successor(a)),
inference(cnfTransformation,[status(thm)],[f_129]) ).
tff(c_117,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_113,c_30]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : NUM023-1 : TPTP v9.0.0. Bugfixed v4.0.0.
% 0.11/0.13 % Command : java -Dfile.encoding=UTF-8 -Xms512M -Xmx4G -Xss10M -jar /export/starexec/sandbox/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s
% 0.12/0.33 % Computer : n028.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Tue Apr 8 09:58:19 EDT 2025
% 0.12/0.34 % CPUTime :
% 2.72/1.63 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.72/1.63
% 2.72/1.63 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------