%------------------------------------------------------------------------------
% File : Beagle---0.9.52
% Problem : FLD023-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 : n031.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:41 PM UTC 2025
% Result : Unsatisfiable 21.21s 9.39s
% Output : CNFRefutation 21.31s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 8
% Syntax : Number of formulae : 23 ( 9 unt; 0 typ; 0 def)
% Number of atoms : 46 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 51 ( 28 ~; 23 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 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 : 27 ( 27 !; 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,
equalish(a,b),
file(unknown,unknown) ).
tff(f_67,axiom,
! [X] :
( equalish(add(X,additive_inverse(X)),additive_identity)
| ~ defined(X) ),
file(unknown,unknown) ).
tff(f_199,axiom,
! [X,Y] :
( equalish(X,Y)
| ~ equalish(Y,X) ),
file(unknown,unknown) ).
tff(f_215,axiom,
! [X,Z,Y] :
( equalish(add(X,Z),add(Y,Z))
| ~ defined(Z)
| ~ equalish(X,Y) ),
file(unknown,unknown) ).
tff(f_207,axiom,
! [X,Z,Y] :
( equalish(X,Z)
| ~ equalish(X,Y)
| ~ equalish(Y,Z) ),
file(unknown,unknown) ).
tff(f_240,axiom,
~ equalish(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,
equalish(a,b),
inference(cnfTransformation,[status(thm)],[f_238]) ).
tff(c_95,plain,
! [X_64] :
( ~ defined(X_64)
| equalish(add(X_64,additive_inverse(X_64)),additive_identity) ),
inference(cnfTransformation,[status(thm)],[f_67]) ).
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_98,plain,
! [X_64] :
( equalish(additive_identity,add(X_64,additive_inverse(X_64)))
| ~ defined(X_64) ),
inference(resolution,[status(thm)],[c_95,c_44]) ).
tff(c_684,plain,
! [X_101,Y_102,Z_103] :
( ~ equalish(X_101,Y_102)
| ~ defined(Z_103)
| equalish(add(X_101,Z_103),add(Y_102,Z_103)) ),
inference(cnfTransformation,[status(thm)],[f_215]) ).
tff(c_46,plain,
! [Y_41,Z_40,X_39] :
( ~ equalish(Y_41,Z_40)
| ~ equalish(X_39,Y_41)
| equalish(X_39,Z_40) ),
inference(cnfTransformation,[status(thm)],[f_207]) ).
tff(c_7454,plain,
! [X_266,X_267,Z_268,Y_269] :
( ~ equalish(X_266,add(X_267,Z_268))
| equalish(X_266,add(Y_269,Z_268))
| ~ equalish(X_267,Y_269)
| ~ defined(Z_268) ),
inference(resolution,[status(thm)],[c_684,c_46]) ).
tff(c_42688,plain,
! [Y_625,X_626] :
( equalish(additive_identity,add(Y_625,additive_inverse(X_626)))
| ~ equalish(X_626,Y_625)
| ~ defined(additive_inverse(X_626))
| ~ defined(X_626) ),
inference(resolution,[status(thm)],[c_98,c_7454]) ).
tff(c_62,plain,
~ equalish(additive_identity,add(b,additive_inverse(a))),
inference(cnfTransformation,[status(thm)],[f_240]) ).
tff(c_42713,plain,
( ~ equalish(a,b)
| ~ defined(additive_inverse(a))
| ~ defined(a) ),
inference(resolution,[status(thm)],[c_42688,c_62]) ).
tff(c_42731,plain,
~ defined(additive_inverse(a)),
inference(demodulation,[status(thm),theory(equality)],[c_56,c_60,c_42713]) ).
tff(c_42735,plain,
~ defined(a),
inference(resolution,[status(thm)],[c_24,c_42731]) ).
tff(c_42739,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_56,c_42735]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10 % Problem : FLD023-1 : TPTP v9.0.0. Bugfixed v2.1.0.
% 0.00/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 : n031.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 : Mon Apr 7 18:42:52 EDT 2025
% 0.11/0.31 % CPUTime :
% 21.21/9.39 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 21.21/9.40
% 21.21/9.40 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------