%------------------------------------------------------------------------------
% File : Beagle---0.9.52
% Problem : SYN009-3 : TPTP v9.0.0. Released v2.5.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 : n009.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 10:01:51 PM UTC 2025
% Result : Unsatisfiable 2.79s 1.68s
% Output : CNFRefutation 2.79s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 8
% Syntax : Number of formulae : 24 ( 11 unt; 0 typ; 0 def)
% Number of atoms : 48 ( 0 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 51 ( 27 ~; 24 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 8 ( 7 usr; 1 prp; 0-3 aty)
% Number of functors : 3 ( 3 usr; 3 con; 0-0 aty)
% Number of variables : 39 ( 39 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ v > u > t > r > q > p > s > #nlpp > c > b > a
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(a,type,
a: $i ).
tff(u,type,
u: ( $i * $i * $i ) > $o ).
tff(r,type,
r: ( $i * $i * $i ) > $o ).
tff(t,type,
t: ( $i * $i * $i ) > $o ).
tff(v,type,
v: ( $i * $i * $i ) > $o ).
tff(b,type,
b: $i ).
tff(p,type,
p: ( $i * $i * $i ) > $o ).
tff(s,type,
s: $i > $o ).
tff(q,type,
q: ( $i * $i * $i ) > $o ).
tff(c,type,
c: $i ).
tff(f_48,axiom,
u(c,c,c),
file(unknown,unknown) ).
tff(f_47,axiom,
! [X,Y,Z] : ~ v(X,Y,Z),
file(unknown,unknown) ).
tff(f_70,axiom,
! [X,Y,Z] :
( ~ u(X,Y,Z)
| t(X,Y,Z)
| v(X,Y,Z) ),
file(unknown,unknown) ).
tff(f_29,axiom,
! [X,Y,Z] :
( ~ p(X,Y,Z)
| ~ t(X,Y,Z) ),
file(unknown,unknown) ).
tff(f_35,axiom,
! [X,Y,Z] :
( ~ q(X,Y,Z)
| ~ t(X,Y,Z) ),
file(unknown,unknown) ).
tff(f_44,axiom,
s(c),
file(unknown,unknown) ).
tff(f_63,axiom,
! [X,Y,Z] :
( ~ s(X)
| ~ s(Y)
| ~ s(Z)
| p(X,Y,Z)
| q(X,Y,Z)
| r(X,Y,Z) ),
file(unknown,unknown) ).
tff(f_41,axiom,
! [X,Y,Z] :
( ~ r(X,Y,Z)
| ~ t(X,Y,Z) ),
file(unknown,unknown) ).
tff(c_16,plain,
u(c,c,c),
inference(cnfTransformation,[status(thm)],[f_48]) ).
tff(c_14,plain,
! [X_10,Y_11,Z_12] : ~ v(X_10,Y_11,Z_12),
inference(cnfTransformation,[status(thm)],[f_47]) ).
tff(c_20,plain,
! [X_16,Y_17,Z_18] :
( v(X_16,Y_17,Z_18)
| t(X_16,Y_17,Z_18)
| ~ u(X_16,Y_17,Z_18) ),
inference(cnfTransformation,[status(thm)],[f_70]) ).
tff(c_25,plain,
! [X_28,Y_29,Z_30] :
( t(X_28,Y_29,Z_30)
| ~ u(X_28,Y_29,Z_30) ),
inference(negUnitSimplification,[status(thm)],[c_14,c_20]) ).
tff(c_29,plain,
t(c,c,c),
inference(resolution,[status(thm)],[c_16,c_25]) ).
tff(c_2,plain,
! [X_1,Y_2,Z_3] :
( ~ t(X_1,Y_2,Z_3)
| ~ p(X_1,Y_2,Z_3) ),
inference(cnfTransformation,[status(thm)],[f_29]) ).
tff(c_36,plain,
~ p(c,c,c),
inference(resolution,[status(thm)],[c_29,c_2]) ).
tff(c_4,plain,
! [X_4,Y_5,Z_6] :
( ~ t(X_4,Y_5,Z_6)
| ~ q(X_4,Y_5,Z_6) ),
inference(cnfTransformation,[status(thm)],[f_35]) ).
tff(c_37,plain,
~ q(c,c,c),
inference(resolution,[status(thm)],[c_29,c_4]) ).
tff(c_12,plain,
s(c),
inference(cnfTransformation,[status(thm)],[f_44]) ).
tff(c_43,plain,
! [X_34,Y_35,Z_36] :
( r(X_34,Y_35,Z_36)
| q(X_34,Y_35,Z_36)
| p(X_34,Y_35,Z_36)
| ~ s(Z_36)
| ~ s(Y_35)
| ~ s(X_34) ),
inference(cnfTransformation,[status(thm)],[f_63]) ).
tff(c_38,plain,
! [X_31,Y_32,Z_33] :
( ~ t(X_31,Y_32,Z_33)
| ~ r(X_31,Y_32,Z_33) ),
inference(cnfTransformation,[status(thm)],[f_41]) ).
tff(c_42,plain,
~ r(c,c,c),
inference(resolution,[status(thm)],[c_29,c_38]) ).
tff(c_46,plain,
( q(c,c,c)
| p(c,c,c)
| ~ s(c) ),
inference(resolution,[status(thm)],[c_43,c_42]) ).
tff(c_49,plain,
( q(c,c,c)
| p(c,c,c) ),
inference(demodulation,[status(thm),theory(equality)],[c_12,c_46]) ).
tff(c_51,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_36,c_37,c_49]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : SYN009-3 : TPTP v9.0.0. Released v2.5.0.
% 0.04/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.14/0.34 % Computer : n009.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Wed Apr 9 06:50:41 EDT 2025
% 0.14/0.34 % CPUTime :
% 2.79/1.68 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.79/1.69
% 2.79/1.69 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------