%------------------------------------------------------------------------------
% File : Beagle---0.9.52
% Problem : KRS003-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 : n022.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:08 PM UTC 2025
% Result : Unsatisfiable 3.59s 2.30s
% Output : CNFRefutation 3.59s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 10
% Syntax : Number of formulae : 29 ( 8 unt; 0 typ; 0 def)
% Number of atoms : 57 ( 0 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 63 ( 35 ~; 28 |; 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 : 9 ( 8 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 1 con; 0-1 aty)
% Number of variables : 26 ( 26 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ s > equalish > s2least > s1most > f > e > d > c > #nlpp > u3r2 > u3r1 > u1r2 > u1r1 > exist
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(s,type,
s: ( $i * $i ) > $o ).
tff(s1most,type,
s1most: $i > $o ).
tff(d,type,
d: $i > $o ).
tff(u3r1,type,
u3r1: $i > $i ).
tff(u1r1,type,
u1r1: $i > $i ).
tff(u3r2,type,
u3r2: $i > $i ).
tff(c,type,
c: $i > $o ).
tff(e,type,
e: $i > $o ).
tff(s2least,type,
s2least: $i > $o ).
tff(exist,type,
exist: $i ).
tff(equalish,type,
equalish: ( $i * $i ) > $o ).
tff(u1r2,type,
u1r2: $i > $i ).
tff(f,type,
f: $i > $o ).
tff(f_22,axiom,
e(exist),
file(unknown,unknown) ).
tff(f_98,axiom,
! [X1] :
( c(X1)
| ~ e(X1) ),
file(unknown,unknown) ).
tff(f_23,axiom,
f(exist),
file(unknown,unknown) ).
tff(f_103,axiom,
! [X1] :
( d(X1)
| ~ f(X1) ),
file(unknown,unknown) ).
tff(f_64,axiom,
! [X1] :
( s1most(X1)
| ~ d(X1) ),
file(unknown,unknown) ).
tff(f_28,axiom,
! [X1] :
( s2least(X1)
| ~ c(X1) ),
file(unknown,unknown) ).
tff(f_49,axiom,
! [X1] :
( s(X1,u1r2(X1))
| ~ s2least(X1) ),
file(unknown,unknown) ).
tff(f_44,axiom,
! [X1] :
( s(X1,u1r1(X1))
| ~ s2least(X1) ),
file(unknown,unknown) ).
tff(f_80,axiom,
! [X3,X2,X1] :
( equalish(X3,X2)
| ~ s1most(X1)
| ~ s(X1,X3)
| ~ s(X1,X2) ),
file(unknown,unknown) ).
tff(f_39,axiom,
! [X1] :
( ~ s2least(X1)
| ~ equalish(u1r2(X1),u1r1(X1)) ),
file(unknown,unknown) ).
tff(c_2,plain,
e(exist),
inference(cnfTransformation,[status(thm)],[f_22]) ).
tff(c_34,plain,
! [X1_20] :
( ~ e(X1_20)
| c(X1_20) ),
inference(cnfTransformation,[status(thm)],[f_98]) ).
tff(c_38,plain,
c(exist),
inference(resolution,[status(thm)],[c_2,c_34]) ).
tff(c_4,plain,
f(exist),
inference(cnfTransformation,[status(thm)],[f_23]) ).
tff(c_45,plain,
! [X1_23] :
( ~ f(X1_23)
| d(X1_23) ),
inference(cnfTransformation,[status(thm)],[f_103]) ).
tff(c_49,plain,
d(exist),
inference(resolution,[status(thm)],[c_4,c_45]) ).
tff(c_18,plain,
! [X1_9] :
( ~ d(X1_9)
| s1most(X1_9) ),
inference(cnfTransformation,[status(thm)],[f_64]) ).
tff(c_6,plain,
! [X1_1] :
( ~ c(X1_1)
| s2least(X1_1) ),
inference(cnfTransformation,[status(thm)],[f_28]) ).
tff(c_14,plain,
! [X1_5] :
( ~ s2least(X1_5)
| s(X1_5,u1r2(X1_5)) ),
inference(cnfTransformation,[status(thm)],[f_49]) ).
tff(c_12,plain,
! [X1_4] :
( ~ s2least(X1_4)
| s(X1_4,u1r1(X1_4)) ),
inference(cnfTransformation,[status(thm)],[f_44]) ).
tff(c_74,plain,
! [X1_34,X2_35,X3_36] :
( ~ s(X1_34,X2_35)
| ~ s(X1_34,X3_36)
| ~ s1most(X1_34)
| equalish(X3_36,X2_35) ),
inference(cnfTransformation,[status(thm)],[f_80]) ).
tff(c_88,plain,
! [X1_39,X3_40] :
( ~ s(X1_39,X3_40)
| ~ s1most(X1_39)
| equalish(X3_40,u1r1(X1_39))
| ~ s2least(X1_39) ),
inference(resolution,[status(thm)],[c_12,c_74]) ).
tff(c_10,plain,
! [X1_3] :
( ~ equalish(u1r2(X1_3),u1r1(X1_3))
| ~ s2least(X1_3) ),
inference(cnfTransformation,[status(thm)],[f_39]) ).
tff(c_94,plain,
! [X1_41] :
( ~ s(X1_41,u1r2(X1_41))
| ~ s1most(X1_41)
| ~ s2least(X1_41) ),
inference(resolution,[status(thm)],[c_88,c_10]) ).
tff(c_99,plain,
! [X1_42] :
( ~ s1most(X1_42)
| ~ s2least(X1_42) ),
inference(resolution,[status(thm)],[c_14,c_94]) ).
tff(c_104,plain,
! [X1_43] :
( ~ s1most(X1_43)
| ~ c(X1_43) ),
inference(resolution,[status(thm)],[c_6,c_99]) ).
tff(c_109,plain,
! [X1_44] :
( ~ c(X1_44)
| ~ d(X1_44) ),
inference(resolution,[status(thm)],[c_18,c_104]) ).
tff(c_112,plain,
~ c(exist),
inference(resolution,[status(thm)],[c_49,c_109]) ).
tff(c_116,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_38,c_112]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.10 % Problem : KRS003-1 : TPTP v9.0.0. Released v2.0.0.
% 0.02/0.11 % 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.11/0.31 % Computer : n022.cluster.edu
% 0.11/0.31 % Model : x86_64 x86_64
% 0.11/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.31 % Memory : 8042.1875MB
% 0.11/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.31 % CPULimit : 300
% 0.11/0.31 % WCLimit : 300
% 0.11/0.31 % DateTime : Tue Apr 8 02:52:35 EDT 2025
% 0.11/0.31 % CPUTime :
% 3.59/2.30 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.59/2.31
% 3.59/2.31 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------