%------------------------------------------------------------------------------
% File : Beagle---0.9.52
% Problem : FLD067-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:53 PM UTC 2025
% Result : Unsatisfiable 18.50s 7.57s
% Output : CNFRefutation 18.50s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 7
% Syntax : Number of formulae : 20 ( 9 unt; 0 typ; 0 def)
% Number of atoms : 39 ( 0 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 43 ( 24 ~; 19 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 3 ( 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 : 20 ( 20 !; 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_236,axiom,
defined(a),
file(unknown,unknown) ).
tff(f_131,axiom,
! [X] :
( defined(additive_inverse(X))
| ~ defined(X) ),
file(unknown,unknown) ).
tff(f_238,axiom,
less_or_equal(a,b),
file(unknown,unknown) ).
tff(f_181,axiom,
! [X,Z,Y] :
( less_or_equal(add(X,Z),add(Y,Z))
| ~ defined(Z)
| ~ less_or_equal(X,Y) ),
file(unknown,unknown) ).
tff(f_67,axiom,
! [X] :
( equalish(add(X,additive_inverse(X)),additive_identity)
| ~ defined(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_240,axiom,
~ less_or_equal(additive_identity,add(b,additive_inverse(a))),
file(unknown,unknown) ).
tff(c_56,plain,
defined(a),
inference(cnfTransformation,[status(thm)],[f_236]) ).
tff(c_24,plain,
! [X_20] :
( ~ defined(X_20)
| defined(additive_inverse(X_20)) ),
inference(cnfTransformation,[status(thm)],[f_131]) ).
tff(c_60,plain,
less_or_equal(a,b),
inference(cnfTransformation,[status(thm)],[f_238]) ).
tff(c_38,plain,
! [X_31,Y_33,Z_32] :
( ~ less_or_equal(X_31,Y_33)
| ~ defined(Z_32)
| less_or_equal(add(X_31,Z_32),add(Y_33,Z_32)) ),
inference(cnfTransformation,[status(thm)],[f_181]) ).
tff(c_6,plain,
! [X_5] :
( ~ defined(X_5)
| equalish(add(X_5,additive_inverse(X_5)),additive_identity) ),
inference(cnfTransformation,[status(thm)],[f_67]) ).
tff(c_101,plain,
! [X_68,Y_69,Z_70] :
( ~ equalish(X_68,Y_69)
| ~ less_or_equal(X_68,Z_70)
| less_or_equal(Y_69,Z_70) ),
inference(cnfTransformation,[status(thm)],[f_231]) ).
tff(c_1047,plain,
! [X_133,Z_134] :
( ~ less_or_equal(add(X_133,additive_inverse(X_133)),Z_134)
| less_or_equal(additive_identity,Z_134)
| ~ defined(X_133) ),
inference(resolution,[status(thm)],[c_6,c_101]) ).
tff(c_37881,plain,
! [Y_578,X_579] :
( less_or_equal(additive_identity,add(Y_578,additive_inverse(X_579)))
| ~ defined(X_579)
| ~ less_or_equal(X_579,Y_578)
| ~ defined(additive_inverse(X_579)) ),
inference(resolution,[status(thm)],[c_38,c_1047]) ).
tff(c_62,plain,
~ less_or_equal(additive_identity,add(b,additive_inverse(a))),
inference(cnfTransformation,[status(thm)],[f_240]) ).
tff(c_37905,plain,
( ~ defined(a)
| ~ less_or_equal(a,b)
| ~ defined(additive_inverse(a)) ),
inference(resolution,[status(thm)],[c_37881,c_62]) ).
tff(c_37922,plain,
~ defined(additive_inverse(a)),
inference(demodulation,[status(thm),theory(equality)],[c_60,c_56,c_37905]) ).
tff(c_37925,plain,
~ defined(a),
inference(resolution,[status(thm)],[c_24,c_37922]) ).
tff(c_37929,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_56,c_37925]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : FLD067-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.12/0.34 % Computer : n008.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Mon Apr 7 18:56:47 EDT 2025
% 0.12/0.34 % CPUTime :
% 18.50/7.57 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 18.50/7.58
% 18.50/7.58 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------