%------------------------------------------------------------------------------
% File : Beagle---0.9.52
% Problem : SWV009-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/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 : n002.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 09:29:19 PM UTC 2025
% Result : Unsatisfiable 2.71s 1.78s
% Output : CNFRefutation 2.98s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 8
% Syntax : Number of formulae : 24 ( 13 unt; 0 typ; 0 def)
% Number of atoms : 53 ( 0 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 63 ( 34 ~; 29 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 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 : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 6 con; 0-1 aty)
% Number of variables : 16 ( 16 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ less_or_equal > less > #nlpp > a > q > p > n > m > j > i
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(i,type,
i: $i ).
tff(m,type,
m: $i ).
tff(less_or_equal,type,
less_or_equal: ( $i * $i ) > $o ).
tff(j,type,
j: $i ).
tff(less,type,
less: ( $i * $i ) > $o ).
tff(a,type,
a: $i > $i ).
tff(n,type,
n: $i ).
tff(q,type,
q: $i ).
tff(p,type,
p: $i ).
tff(f_29,axiom,
less_or_equal(m,p),
file(unknown,unknown) ).
tff(f_27,axiom,
! [X,Y] :
( less_or_equal(X,Y)
| less(Y,X) ),
file(unknown,unknown) ).
tff(f_30,axiom,
less_or_equal(p,q),
file(unknown,unknown) ).
tff(f_31,axiom,
less_or_equal(q,n),
file(unknown,unknown) ).
tff(f_67,axiom,
! [X,Y] :
( ~ less_or_equal(i,X)
| ~ less_or_equal(X,Y)
| ~ less_or_equal(Y,n)
| less_or_equal(a(X),a(Y)) ),
file(unknown,unknown) ).
tff(f_69,axiom,
~ less_or_equal(a(p),a(q)),
file(unknown,unknown) ).
tff(f_56,axiom,
! [X,Y] :
( ~ less_or_equal(m,X)
| ~ less_or_equal(X,Y)
| ~ less_or_equal(Y,j)
| less_or_equal(a(X),a(Y)) ),
file(unknown,unknown) ).
tff(f_45,axiom,
! [X,Y] :
( ~ less_or_equal(m,X)
| ~ less(X,i)
| ~ less(j,Y)
| ~ less_or_equal(Y,n)
| less_or_equal(a(X),a(Y)) ),
file(unknown,unknown) ).
tff(c_6,plain,
less_or_equal(m,p),
inference(cnfTransformation,[status(thm)],[f_29]) ).
tff(c_2,plain,
! [Y_2,X_1] :
( less(Y_2,X_1)
| less_or_equal(X_1,Y_2) ),
inference(cnfTransformation,[status(thm)],[f_27]) ).
tff(c_8,plain,
less_or_equal(p,q),
inference(cnfTransformation,[status(thm)],[f_30]) ).
tff(c_10,plain,
less_or_equal(q,n),
inference(cnfTransformation,[status(thm)],[f_31]) ).
tff(c_35,plain,
! [X_13,Y_14] :
( less_or_equal(a(X_13),a(Y_14))
| ~ less_or_equal(Y_14,n)
| ~ less_or_equal(X_13,Y_14)
| ~ less_or_equal(i,X_13) ),
inference(cnfTransformation,[status(thm)],[f_67]) ).
tff(c_18,plain,
~ less_or_equal(a(p),a(q)),
inference(cnfTransformation,[status(thm)],[f_69]) ).
tff(c_38,plain,
( ~ less_or_equal(q,n)
| ~ less_or_equal(p,q)
| ~ less_or_equal(i,p) ),
inference(resolution,[status(thm)],[c_35,c_18]) ).
tff(c_41,plain,
~ less_or_equal(i,p),
inference(demodulation,[status(thm),theory(equality)],[c_8,c_10,c_38]) ).
tff(c_45,plain,
less(p,i),
inference(resolution,[status(thm)],[c_2,c_41]) ).
tff(c_24,plain,
! [X_11,Y_12] :
( less_or_equal(a(X_11),a(Y_12))
| ~ less_or_equal(Y_12,j)
| ~ less_or_equal(X_11,Y_12)
| ~ less_or_equal(m,X_11) ),
inference(cnfTransformation,[status(thm)],[f_56]) ).
tff(c_27,plain,
( ~ less_or_equal(q,j)
| ~ less_or_equal(p,q)
| ~ less_or_equal(m,p) ),
inference(resolution,[status(thm)],[c_24,c_18]) ).
tff(c_30,plain,
~ less_or_equal(q,j),
inference(demodulation,[status(thm),theory(equality)],[c_6,c_8,c_27]) ).
tff(c_34,plain,
less(j,q),
inference(resolution,[status(thm)],[c_2,c_30]) ).
tff(c_46,plain,
! [X_15,Y_16] :
( less_or_equal(a(X_15),a(Y_16))
| ~ less_or_equal(Y_16,n)
| ~ less(j,Y_16)
| ~ less(X_15,i)
| ~ less_or_equal(m,X_15) ),
inference(cnfTransformation,[status(thm)],[f_45]) ).
tff(c_49,plain,
( ~ less_or_equal(q,n)
| ~ less(j,q)
| ~ less(p,i)
| ~ less_or_equal(m,p) ),
inference(resolution,[status(thm)],[c_46,c_18]) ).
tff(c_53,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_6,c_45,c_34,c_10,c_49]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SWV009-1 : TPTP v9.0.0. Released v1.0.0.
% 0.11/0.12 % 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 : n002.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.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Wed Apr 9 02:36:32 EDT 2025
% 0.12/0.33 % CPUTime :
% 2.71/1.78 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.96/1.78
% 2.96/1.78 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------