%------------------------------------------------------------------------------
% File : Beagle---0.9.52
% Problem : FLD034-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/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 : n010.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:44 PM UTC 2025
% Result : Unsatisfiable 9.21s 3.76s
% Output : CNFRefutation 9.40s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 6
% Syntax : Number of formulae : 18 ( 9 unt; 0 typ; 0 def)
% Number of atoms : 34 ( 0 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 35 ( 19 ~; 16 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 4 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 : 5 ( 4 usr; 1 prp; 0-3 aty)
% Number of functors : 8 ( 8 usr; 4 con; 0-2 aty)
% Number of variables : 27 ( 27 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ sum > product > less_or_equal > defined > multiply > add > #nlpp > multiplicative_inverse > additive_inverse > multiplicative_identity > m > additive_identity > a
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(m,type,
m: $i ).
tff(sum,type,
sum: ( $i * $i * $i ) > $o ).
tff(less_or_equal,type,
less_or_equal: ( $i * $i ) > $o ).
tff(a,type,
a: $i ).
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_249,axiom,
defined(a),
file(unknown,unknown) ).
tff(f_251,axiom,
product(multiplicative_identity,m,multiplicative_identity),
file(unknown,unknown) ).
tff(f_122,axiom,
! [Y,X,Z] :
( product(Y,X,Z)
| ~ product(X,Y,Z) ),
file(unknown,unknown) ).
tff(f_110,axiom,
! [X] :
( product(multiplicative_identity,X,X)
| ~ defined(X) ),
file(unknown,unknown) ).
tff(f_94,axiom,
! [W,U,Z,X,Y,V] :
( product(X,V,W)
| ~ product(X,Y,U)
| ~ product(Y,Z,V)
| ~ product(U,Z,W) ),
file(unknown,unknown) ).
tff(f_253,axiom,
~ product(m,a,a),
file(unknown,unknown) ).
tff(c_54,plain,
defined(a),
inference(cnfTransformation,[status(thm)],[f_249]) ).
tff(c_58,plain,
product(multiplicative_identity,m,multiplicative_identity),
inference(cnfTransformation,[status(thm)],[f_251]) ).
tff(c_66,plain,
! [X_80,Y_81,Z_82] :
( ~ product(X_80,Y_81,Z_82)
| product(Y_81,X_80,Z_82) ),
inference(cnfTransformation,[status(thm)],[f_122]) ).
tff(c_72,plain,
product(m,multiplicative_identity,multiplicative_identity),
inference(resolution,[status(thm)],[c_58,c_66]) ).
tff(c_16,plain,
! [X_30] :
( ~ defined(X_30)
| product(multiplicative_identity,X_30,X_30) ),
inference(cnfTransformation,[status(thm)],[f_110]) ).
tff(c_285,plain,
! [Y_130,Z_126,X_128,U_125,V_129,W_127] :
( ~ product(U_125,Z_126,W_127)
| ~ product(Y_130,Z_126,V_129)
| ~ product(X_128,Y_130,U_125)
| product(X_128,V_129,W_127) ),
inference(cnfTransformation,[status(thm)],[f_94]) ).
tff(c_2735,plain,
! [Y_246,X_247,V_248,X_249] :
( ~ product(Y_246,X_247,V_248)
| ~ product(X_249,Y_246,multiplicative_identity)
| product(X_249,V_248,X_247)
| ~ defined(X_247) ),
inference(resolution,[status(thm)],[c_16,c_285]) ).
tff(c_3575,plain,
! [X_257,X_258] :
( ~ product(X_257,multiplicative_identity,multiplicative_identity)
| product(X_257,X_258,X_258)
| ~ defined(X_258) ),
inference(resolution,[status(thm)],[c_16,c_2735]) ).
tff(c_3649,plain,
! [X_259] :
( product(m,X_259,X_259)
| ~ defined(X_259) ),
inference(resolution,[status(thm)],[c_72,c_3575]) ).
tff(c_60,plain,
~ product(m,a,a),
inference(cnfTransformation,[status(thm)],[f_253]) ).
tff(c_3693,plain,
~ defined(a),
inference(resolution,[status(thm)],[c_3649,c_60]) ).
tff(c_3728,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_54,c_3693]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : FLD034-3 : TPTP v9.0.0. Bugfixed v2.1.0.
% 0.03/0.12 % 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.32 % Computer : n010.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Mon Apr 7 18:46:02 EDT 2025
% 0.11/0.32 % CPUTime :
% 9.21/3.76 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 9.21/3.77
% 9.21/3.77 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------