%------------------------------------------------------------------------------
% File : Beagle---0.9.52
% Problem : FLD017-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 : n019.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:39 PM UTC 2025
% Result : Unsatisfiable 4.67s 2.03s
% Output : CNFRefutation 4.67s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 7
% Syntax : Number of formulae : 20 ( 11 unt; 0 typ; 0 def)
% Number of atoms : 34 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 31 ( 17 ~; 14 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 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 : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 6 con; 0-2 aty)
% Number of variables : 19 ( 19 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ less_or_equal > equalish > defined > multiply > add > #nlpp > multiplicative_inverse > additive_inverse > x > 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(x,type,
x: $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_240,axiom,
equalish(a,x),
file(unknown,unknown) ).
tff(f_199,axiom,
! [X,Y] :
( equalish(X,Y)
| ~ equalish(Y,X) ),
file(unknown,unknown) ).
tff(f_237,axiom,
defined(b),
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_241,axiom,
equalish(add(a,b),c),
file(unknown,unknown) ).
tff(f_207,axiom,
! [X,Z,Y] :
( equalish(X,Z)
| ~ equalish(X,Y)
| ~ equalish(Y,Z) ),
file(unknown,unknown) ).
tff(f_243,axiom,
~ equalish(add(x,b),c),
file(unknown,unknown) ).
tff(c_64,plain,
equalish(a,x),
inference(cnfTransformation,[status(thm)],[f_240]) ).
tff(c_71,plain,
! [Y_53,X_54] :
( ~ equalish(Y_53,X_54)
| equalish(X_54,Y_53) ),
inference(cnfTransformation,[status(thm)],[f_199]) ).
tff(c_80,plain,
equalish(x,a),
inference(resolution,[status(thm)],[c_64,c_71]) ).
tff(c_58,plain,
defined(b),
inference(cnfTransformation,[status(thm)],[f_237]) ).
tff(c_712,plain,
! [X_103,Y_104,Z_105] :
( ~ equalish(X_103,Y_104)
| ~ defined(Z_105)
| equalish(add(X_103,Z_105),add(Y_104,Z_105)) ),
inference(cnfTransformation,[status(thm)],[f_215]) ).
tff(c_66,plain,
equalish(add(a,b),c),
inference(cnfTransformation,[status(thm)],[f_241]) ).
tff(c_176,plain,
! [Y_78,Z_79,X_80] :
( ~ equalish(Y_78,Z_79)
| ~ equalish(X_80,Y_78)
| equalish(X_80,Z_79) ),
inference(cnfTransformation,[status(thm)],[f_207]) ).
tff(c_207,plain,
! [X_80] :
( ~ equalish(X_80,add(a,b))
| equalish(X_80,c) ),
inference(resolution,[status(thm)],[c_66,c_176]) ).
tff(c_716,plain,
! [X_103] :
( equalish(add(X_103,b),c)
| ~ equalish(X_103,a)
| ~ defined(b) ),
inference(resolution,[status(thm)],[c_712,c_207]) ).
tff(c_736,plain,
! [X_107] :
( equalish(add(X_107,b),c)
| ~ equalish(X_107,a) ),
inference(demodulation,[status(thm),theory(equality)],[c_58,c_716]) ).
tff(c_68,plain,
~ equalish(add(x,b),c),
inference(cnfTransformation,[status(thm)],[f_243]) ).
tff(c_745,plain,
~ equalish(x,a),
inference(resolution,[status(thm)],[c_736,c_68]) ).
tff(c_752,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_80,c_745]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.12 % Problem : FLD017-1 : TPTP v9.0.0. Bugfixed v2.1.0.
% 0.12/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 : n019.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:41:32 EDT 2025
% 0.12/0.34 % CPUTime :
% 4.67/2.03 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 4.67/2.04
% 4.67/2.04 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------