%------------------------------------------------------------------------------
% File : Beagle---0.9.52
% Problem : FLD055-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/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 : n025.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:50 PM UTC 2025
% Result : Unsatisfiable 4.85s 2.28s
% Output : CNFRefutation 5.28s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 10
% Syntax : Number of formulae : 42 ( 22 unt; 0 typ; 0 def)
% Number of atoms : 74 ( 0 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 66 ( 34 ~; 32 |; 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 : 9 ( 9 usr; 5 con; 0-2 aty)
% Number of variables : 32 ( 32 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ less_or_equal > equalish > defined > multiply > add > #nlpp > multiplicative_inverse > additive_inverse > multiplicative_identity > c > 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(c,type,
c: $i ).
tff(f_242,axiom,
~ less_or_equal(a,c),
file(unknown,unknown) ).
tff(f_238,axiom,
defined(c),
file(unknown,unknown) ).
tff(f_173,axiom,
! [X,Y] :
( less_or_equal(X,Y)
| less_or_equal(Y,X)
| ~ defined(X)
| ~ defined(Y) ),
file(unknown,unknown) ).
tff(f_240,axiom,
equalish(b,c),
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_236,axiom,
defined(a),
file(unknown,unknown) ).
tff(f_163,axiom,
! [X,Z,Y] :
( less_or_equal(X,Z)
| ~ less_or_equal(X,Y)
| ~ less_or_equal(Y,Z) ),
file(unknown,unknown) ).
tff(c_66,plain,
~ less_or_equal(a,c),
inference(cnfTransformation,[status(thm)],[f_242]) ).
tff(c_60,plain,
defined(c),
inference(cnfTransformation,[status(thm)],[f_238]) ).
tff(c_36,plain,
! [Y_30,X_29] :
( ~ defined(Y_30)
| ~ defined(X_29)
| less_or_equal(Y_30,X_29)
| less_or_equal(X_29,Y_30) ),
inference(cnfTransformation,[status(thm)],[f_173]) ).
tff(c_704,plain,
! [Y_97] :
( ~ defined(Y_97)
| less_or_equal(Y_97,Y_97) ),
inference(factorization,[status(thm),theory(equality)],[c_36]) ).
tff(c_64,plain,
equalish(b,c),
inference(cnfTransformation,[status(thm)],[f_240]) ).
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(c,b),
inference(resolution,[status(thm)],[c_64,c_69]) ).
tff(c_172,plain,
! [X_71,Y_72,Z_73] :
( ~ equalish(X_71,Y_72)
| ~ less_or_equal(X_71,Z_73)
| less_or_equal(Y_72,Z_73) ),
inference(cnfTransformation,[status(thm)],[f_231]) ).
tff(c_200,plain,
! [Z_73] :
( ~ less_or_equal(c,Z_73)
| less_or_equal(b,Z_73) ),
inference(resolution,[status(thm)],[c_75,c_172]) ).
tff(c_710,plain,
( less_or_equal(b,c)
| ~ defined(c) ),
inference(resolution,[status(thm)],[c_704,c_200]) ).
tff(c_716,plain,
less_or_equal(b,c),
inference(demodulation,[status(thm),theory(equality)],[c_60,c_710]) ).
tff(c_62,plain,
less_or_equal(a,b),
inference(cnfTransformation,[status(thm)],[f_239]) ).
tff(c_273,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_282,plain,
( ~ less_or_equal(b,a)
| equalish(b,a) ),
inference(resolution,[status(thm)],[c_62,c_273]) ).
tff(c_283,plain,
~ less_or_equal(b,a),
inference(splitLeft,[status(thm)],[c_282]) ).
tff(c_56,plain,
defined(a),
inference(cnfTransformation,[status(thm)],[f_236]) ).
tff(c_231,plain,
! [Y_74,Z_75,X_76] :
( ~ less_or_equal(Y_74,Z_75)
| ~ less_or_equal(X_76,Y_74)
| less_or_equal(X_76,Z_75) ),
inference(cnfTransformation,[status(thm)],[f_163]) ).
tff(c_234,plain,
! [X_76] :
( ~ less_or_equal(X_76,a)
| less_or_equal(X_76,b) ),
inference(resolution,[status(thm)],[c_62,c_231]) ).
tff(c_263,plain,
! [Z_79] :
( ~ less_or_equal(c,Z_79)
| less_or_equal(b,Z_79) ),
inference(resolution,[status(thm)],[c_75,c_172]) ).
tff(c_271,plain,
( less_or_equal(b,b)
| ~ less_or_equal(c,a) ),
inference(resolution,[status(thm)],[c_234,c_263]) ).
tff(c_584,plain,
~ less_or_equal(c,a),
inference(splitLeft,[status(thm)],[c_271]) ).
tff(c_587,plain,
( ~ defined(c)
| ~ defined(a)
| less_or_equal(a,c) ),
inference(resolution,[status(thm)],[c_36,c_584]) ).
tff(c_596,plain,
less_or_equal(a,c),
inference(demodulation,[status(thm),theory(equality)],[c_56,c_60,c_587]) ).
tff(c_598,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_66,c_596]) ).
tff(c_600,plain,
less_or_equal(c,a),
inference(splitRight,[status(thm)],[c_271]) ).
tff(c_613,plain,
less_or_equal(b,a),
inference(resolution,[status(thm)],[c_600,c_200]) ).
tff(c_620,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_283,c_613]) ).
tff(c_621,plain,
equalish(b,a),
inference(splitRight,[status(thm)],[c_282]) ).
tff(c_52,plain,
! [X_50,Y_48,Z_49] :
( ~ equalish(X_50,Y_48)
| ~ less_or_equal(X_50,Z_49)
| less_or_equal(Y_48,Z_49) ),
inference(cnfTransformation,[status(thm)],[f_231]) ).
tff(c_1197,plain,
! [Z_121] :
( ~ less_or_equal(b,Z_121)
| less_or_equal(a,Z_121) ),
inference(resolution,[status(thm)],[c_621,c_52]) ).
tff(c_1200,plain,
less_or_equal(a,c),
inference(resolution,[status(thm)],[c_716,c_1197]) ).
tff(c_1223,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_66,c_1200]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : FLD055-1 : TPTP v9.0.0. Bugfixed v2.1.0.
% 0.10/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.13/0.34 % Computer : n025.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:05 EDT 2025
% 0.13/0.34 % CPUTime :
% 4.85/2.28 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 4.85/2.29
% 4.85/2.29 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------