%------------------------------------------------------------------------------
% File : Beagle---0.9.52
% Problem : SYN325-1 : TPTP v9.0.0. Released v1.2.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 : 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:03:11 PM UTC 2025
% Result : Unsatisfiable 2.50s 1.55s
% Output : CNFRefutation 2.50s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 3
% Syntax : Number of formulae : 9 ( 4 unt; 0 typ; 0 def)
% Number of atoms : 14 ( 0 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 9 ( 4 ~; 5 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 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 : 1 ( 1 usr; 0 con; 1-1 aty)
% Number of variables : 8 ( 8 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ f > g > #nlpp > y
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(f,type,
f: ( $i * $i ) > $o ).
tff(y,type,
y: $i > $i ).
tff(g,type,
g: $i > $o ).
tff(f_47,axiom,
! [X] : ~ g(y(X)),
file(unknown,unknown) ).
tff(f_34,axiom,
! [X] :
( f(X,X)
| g(X) ),
file(unknown,unknown) ).
tff(f_44,axiom,
! [X] :
( ~ f(y(X),y(X))
| g(X) ),
file(unknown,unknown) ).
tff(c_10,plain,
! [X_5] : ~ g(y(X_5)),
inference(cnfTransformation,[status(thm)],[f_47]) ).
tff(c_4,plain,
! [X_2] :
( g(X_2)
| f(X_2,X_2) ),
inference(cnfTransformation,[status(thm)],[f_34]) ).
tff(c_13,plain,
! [X_8] :
( g(X_8)
| ~ f(y(X_8),y(X_8)) ),
inference(cnfTransformation,[status(thm)],[f_44]) ).
tff(c_16,plain,
! [X_8] :
( g(X_8)
| g(y(X_8)) ),
inference(resolution,[status(thm)],[c_4,c_13]) ).
tff(c_19,plain,
! [X_8] : g(X_8),
inference(negUnitSimplification,[status(thm)],[c_10,c_16]) ).
tff(c_24,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_19,c_10]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : SYN325-1 : TPTP v9.0.0. Released v1.2.0.
% 0.10/0.13 % 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.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 07:17:11 EDT 2025
% 0.14/0.34 % CPUTime :
% 2.50/1.55 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.50/1.55
% 2.50/1.55 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------