%------------------------------------------------------------------------------
% File : Beagle---0.9.52
% Problem : FLD058-1 : TPTP v9.0.0. Bugfixed v2.1.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 : n008.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 06:10:51 PM UTC 2025
% Result : Unsatisfiable 3.87s 2.01s
% Output : CNFRefutation 3.87s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 8
% Syntax : Number of formulae : 28 ( 16 unt; 0 typ; 0 def)
% Number of atoms : 46 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 40 ( 22 ~; 18 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 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 : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 4 con; 0-2 aty)
% Number of variables : 24 ( 24 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ less_or_equal > equalish > defined > multiply > add > #nlpp > multiplicative_inverse > additive_inverse > multiplicative_identity > b > additive_identity > a
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(less_or_equal,type,
less_or_equal: ( $i * $i ) > $o ).
tff(a,type,
a: $i ).
tff(additive_identity,type,
additive_identity: $i ).
tff(multiplicative_identity,type,
multiplicative_identity: $i ).
tff(multiply,type,
multiply: ( $i * $i ) > $i ).
tff(additive_inverse,type,
additive_inverse: $i > $i ).
tff(b,type,
b: $i ).
tff(defined,type,
defined: $i > $o ).
tff(multiplicative_inverse,type,
multiplicative_inverse: $i > $i ).
tff(add,type,
add: ( $i * $i ) > $i ).
tff(equalish,type,
equalish: ( $i * $i ) > $o ).
tff(f_241,axiom,
~ equalish(a,additive_identity),
file(unknown,unknown) ).
tff(f_238,axiom,
less_or_equal(additive_identity,a),
file(unknown,unknown) ).
tff(f_242,axiom,
equalish(b,additive_identity),
file(unknown,unknown) ).
tff(f_199,axiom,
! [X,Y] :
( equalish(X,Y)
| ~ equalish(Y,X) ),
file(unknown,unknown) ).
tff(f_231,axiom,
! [Y,Z,X] :
( less_or_equal(Y,Z)
| ~ less_or_equal(X,Z)
| ~ equalish(X,Y) ),
file(unknown,unknown) ).
tff(f_239,axiom,
less_or_equal(a,b),
file(unknown,unknown) ).
tff(f_155,axiom,
! [X,Y] :
( equalish(X,Y)
| ~ less_or_equal(X,Y)
| ~ less_or_equal(Y,X) ),
file(unknown,unknown) ).
tff(f_207,axiom,
! [X,Z,Y] :
( equalish(X,Z)
| ~ equalish(X,Y)
| ~ equalish(Y,Z) ),
file(unknown,unknown) ).
tff(c_64,plain,
~ equalish(a,additive_identity),
inference(cnfTransformation,[status(thm)],[f_241]) ).
tff(c_60,plain,
less_or_equal(additive_identity,a),
inference(cnfTransformation,[status(thm)],[f_238]) ).
tff(c_66,plain,
equalish(b,additive_identity),
inference(cnfTransformation,[status(thm)],[f_242]) ).
tff(c_69,plain,
! [Y_53,X_54] :
( ~ equalish(Y_53,X_54)
| equalish(X_54,Y_53) ),
inference(cnfTransformation,[status(thm)],[f_199]) ).
tff(c_75,plain,
equalish(additive_identity,b),
inference(resolution,[status(thm)],[c_66,c_69]) ).
tff(c_168,plain,
! [X_70,Y_71,Z_72] :
( ~ equalish(X_70,Y_71)
| ~ less_or_equal(X_70,Z_72)
| less_or_equal(Y_71,Z_72) ),
inference(cnfTransformation,[status(thm)],[f_231]) ).
tff(c_196,plain,
! [Z_72] :
( ~ less_or_equal(additive_identity,Z_72)
| less_or_equal(b,Z_72) ),
inference(resolution,[status(thm)],[c_75,c_168]) ).
tff(c_62,plain,
less_or_equal(a,b),
inference(cnfTransformation,[status(thm)],[f_239]) ).
tff(c_268,plain,
! [Y_80,X_81] :
( ~ less_or_equal(Y_80,X_81)
| ~ less_or_equal(X_81,Y_80)
| equalish(X_81,Y_80) ),
inference(cnfTransformation,[status(thm)],[f_155]) ).
tff(c_279,plain,
( ~ less_or_equal(b,a)
| equalish(b,a) ),
inference(resolution,[status(thm)],[c_62,c_268]) ).
tff(c_283,plain,
~ less_or_equal(b,a),
inference(splitLeft,[status(thm)],[c_279]) ).
tff(c_286,plain,
~ less_or_equal(additive_identity,a),
inference(resolution,[status(thm)],[c_196,c_283]) ).
tff(c_290,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_60,c_286]) ).
tff(c_291,plain,
equalish(b,a),
inference(splitRight,[status(thm)],[c_279]) ).
tff(c_44,plain,
! [Y_38,X_37] :
( ~ equalish(Y_38,X_37)
| equalish(X_37,Y_38) ),
inference(cnfTransformation,[status(thm)],[f_199]) ).
tff(c_358,plain,
equalish(a,b),
inference(resolution,[status(thm)],[c_291,c_44]) ).
tff(c_107,plain,
! [Y_66,Z_67,X_68] :
( ~ equalish(Y_66,Z_67)
| ~ equalish(X_68,Y_66)
| equalish(X_68,Z_67) ),
inference(cnfTransformation,[status(thm)],[f_207]) ).
tff(c_134,plain,
! [X_68] :
( ~ equalish(X_68,b)
| equalish(X_68,additive_identity) ),
inference(resolution,[status(thm)],[c_66,c_107]) ).
tff(c_376,plain,
equalish(a,additive_identity),
inference(resolution,[status(thm)],[c_358,c_134]) ).
tff(c_385,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_64,c_376]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : FLD058-1 : TPTP v9.0.0. Bugfixed v2.1.0.
% 0.07/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.13/0.34 % Computer : n008.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Mon Apr 7 18:54:32 EDT 2025
% 0.13/0.34 % CPUTime :
% 3.87/2.01 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.87/2.02
% 3.87/2.02 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------