%------------------------------------------------------------------------------
% File : Beagle---0.9.52
% Problem : FLD010-3 : 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 : n015.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:37 PM UTC 2025
% Result : Unsatisfiable 3.72s 1.94s
% Output : CNFRefutation 3.72s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 5
% Syntax : Number of formulae : 14 ( 8 unt; 0 typ; 0 def)
% Number of atoms : 23 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 19 ( 10 ~; 9 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 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 : 5 ( 4 usr; 1 prp; 0-3 aty)
% Number of functors : 6 ( 6 usr; 2 con; 0-2 aty)
% Number of variables : 9 ( 9 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ sum > product > less_or_equal > defined > multiply > add > #nlpp > multiplicative_inverse > additive_inverse > multiplicative_identity > additive_identity
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(sum,type,
sum: ( $i * $i * $i ) > $o ).
tff(less_or_equal,type,
less_or_equal: ( $i * $i ) > $o ).
tff(product,type,
product: ( $i * $i * $i ) > $o ).
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(defined,type,
defined: $i > $o ).
tff(multiplicative_inverse,type,
multiplicative_inverse: $i > $i ).
tff(add,type,
add: ( $i * $i ) > $i ).
tff(f_250,axiom,
~ sum(additive_identity,multiplicative_identity,additive_identity),
file(unknown,unknown) ).
tff(f_173,axiom,
defined(multiplicative_identity),
file(unknown,unknown) ).
tff(f_117,axiom,
! [X] :
( product(multiplicative_inverse(X),X,multiplicative_identity)
| sum(additive_identity,X,additive_identity)
| ~ defined(X) ),
file(unknown,unknown) ).
tff(f_122,axiom,
! [Y,X,Z] :
( product(Y,X,Z)
| ~ product(X,Y,Z) ),
file(unknown,unknown) ).
tff(f_252,axiom,
~ product(multiplicative_identity,multiplicative_inverse(multiplicative_identity),multiplicative_identity),
file(unknown,unknown) ).
tff(c_54,plain,
~ sum(additive_identity,multiplicative_identity,additive_identity),
inference(cnfTransformation,[status(thm)],[f_250]) ).
tff(c_34,plain,
defined(multiplicative_identity),
inference(cnfTransformation,[status(thm)],[f_173]) ).
tff(c_134,plain,
! [X_104] :
( ~ defined(X_104)
| sum(additive_identity,X_104,additive_identity)
| product(multiplicative_inverse(X_104),X_104,multiplicative_identity) ),
inference(cnfTransformation,[status(thm)],[f_117]) ).
tff(c_20,plain,
! [X_33,Y_32,Z_34] :
( ~ product(X_33,Y_32,Z_34)
| product(Y_32,X_33,Z_34) ),
inference(cnfTransformation,[status(thm)],[f_122]) ).
tff(c_246,plain,
! [X_122] :
( product(X_122,multiplicative_inverse(X_122),multiplicative_identity)
| ~ defined(X_122)
| sum(additive_identity,X_122,additive_identity) ),
inference(resolution,[status(thm)],[c_134,c_20]) ).
tff(c_56,plain,
~ product(multiplicative_identity,multiplicative_inverse(multiplicative_identity),multiplicative_identity),
inference(cnfTransformation,[status(thm)],[f_252]) ).
tff(c_254,plain,
( ~ defined(multiplicative_identity)
| sum(additive_identity,multiplicative_identity,additive_identity) ),
inference(resolution,[status(thm)],[c_246,c_56]) ).
tff(c_260,plain,
sum(additive_identity,multiplicative_identity,additive_identity),
inference(demodulation,[status(thm),theory(equality)],[c_34,c_254]) ).
tff(c_262,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_54,c_260]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : FLD010-3 : TPTP v9.0.0. Bugfixed v2.1.0.
% 0.12/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.12/0.34 % Computer : n015.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:39:05 EDT 2025
% 0.12/0.34 % CPUTime :
% 3.72/1.94 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.72/1.94
% 3.72/1.94 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------