%------------------------------------------------------------------------------
% File : Beagle---0.9.52
% Problem : KRS017-1 : TPTP v9.0.0. Released v2.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 : n017.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:07:10 PM UTC 2025
% Result : Unsatisfiable 2.50s 1.56s
% Output : CNFRefutation 2.50s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 4
% Syntax : Number of formulae : 12 ( 6 unt; 0 typ; 0 def)
% Number of atoms : 24 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 26 ( 14 ~; 12 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 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 : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 1 con; 0-1 aty)
% Number of variables : 11 ( 11 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ r > e > a > #nlpp > u0r3 > u0r2 > u0r1 > exists
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(u0r1,type,
u0r1: $i > $i ).
tff(u0r3,type,
u0r3: $i > $i ).
tff(e,type,
e: $i > $o ).
tff(exists,type,
exists: $i ).
tff(a,type,
a: $i > $o ).
tff(u0r2,type,
u0r2: $i > $i ).
tff(r,type,
r: ( $i * $i ) > $o ).
tff(f_24,axiom,
~ a(exists),
file(unknown,unknown) ).
tff(f_22,axiom,
e(exists),
file(unknown,unknown) ).
tff(f_29,axiom,
! [X1] :
( r(X1,u0r3(X1))
| ~ e(X1) ),
file(unknown,unknown) ).
tff(f_40,axiom,
! [X3,X1,X2] :
( a(X3)
| ~ e(X1)
| ~ r(X1,X2)
| ~ r(X3,X2) ),
file(unknown,unknown) ).
tff(c_4,plain,
~ a(exists),
inference(cnfTransformation,[status(thm)],[f_24]) ).
tff(c_2,plain,
e(exists),
inference(cnfTransformation,[status(thm)],[f_22]) ).
tff(c_6,plain,
! [X1_1] :
( ~ e(X1_1)
| r(X1_1,u0r3(X1_1)) ),
inference(cnfTransformation,[status(thm)],[f_29]) ).
tff(c_24,plain,
! [X3_16,X2_17,X1_18] :
( ~ r(X3_16,X2_17)
| ~ r(X1_18,X2_17)
| ~ e(X1_18)
| a(X3_16) ),
inference(cnfTransformation,[status(thm)],[f_40]) ).
tff(c_32,plain,
! [X1_21,X1_22] :
( ~ r(X1_21,u0r3(X1_22))
| ~ e(X1_21)
| a(X1_22)
| ~ e(X1_22) ),
inference(resolution,[status(thm)],[c_6,c_24]) ).
tff(c_37,plain,
! [X1_23] :
( a(X1_23)
| ~ e(X1_23) ),
inference(resolution,[status(thm)],[c_6,c_32]) ).
tff(c_40,plain,
a(exists),
inference(resolution,[status(thm)],[c_2,c_37]) ).
tff(c_44,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_4,c_40]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11 % Problem : KRS017-1 : TPTP v9.0.0. Released v2.0.0.
% 0.11/0.12 % 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.33 % Computer : n017.cluster.edu
% 0.14/0.33 % Model : x86_64 x86_64
% 0.14/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.33 % Memory : 8042.1875MB
% 0.14/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.33 % CPULimit : 300
% 0.14/0.33 % WCLimit : 300
% 0.14/0.33 % DateTime : Tue Apr 8 02:53:55 EDT 2025
% 0.14/0.34 % CPUTime :
% 2.50/1.56 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.50/1.56
% 2.50/1.56 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------