%------------------------------------------------------------------------------
% File : Beagle---0.9.52
% Problem : GRP166-3 : TPTP v9.0.0. Bugfixed v1.2.1.
% 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 : n016.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:25:24 PM UTC 2025
% Result : Unsatisfiable 22.22s 9.75s
% Output : CNFRefutation 22.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 5
% Syntax : Number of formulae : 14 ( 14 unt; 0 typ; 0 def)
% Number of atoms : 14 ( 13 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 2 ( 2 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 3 con; 0-2 aty)
% Number of variables : 16 ( 16 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ multiply > least_upper_bound > greatest_lower_bound > #nlpp > inverse > identity > b > a
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(a,type,
a: $i ).
tff(inverse,type,
inverse: $i > $i ).
tff(greatest_lower_bound,type,
greatest_lower_bound: ( $i * $i ) > $i ).
tff(least_upper_bound,type,
least_upper_bound: ( $i * $i ) > $i ).
tff(multiply,type,
multiply: ( $i * $i ) > $i ).
tff(b,type,
b: $i ).
tff(identity,type,
identity: $i ).
tff(f_116,axiom,
least_upper_bound(b,identity) = b,
file(unknown,unknown) ).
tff(f_56,axiom,
! [X] : ( multiply(identity,X) = X ),
file(unknown,unknown) ).
tff(f_110,axiom,
! [Y,Z,X] : ( multiply(least_upper_bound(Y,Z),X) = least_upper_bound(multiply(Y,X),multiply(Z,X)) ),
file(unknown,unknown) ).
tff(f_91,axiom,
! [X,Y] : ( least_upper_bound(X,Y) = least_upper_bound(Y,X) ),
file(unknown,unknown) ).
tff(f_118,axiom,
least_upper_bound(a,multiply(b,a)) != multiply(b,a),
file(unknown,unknown) ).
tff(c_34,plain,
least_upper_bound(b,identity) = b,
inference(cnfTransformation,[status(thm)],[f_116]) ).
tff(c_2,plain,
! [X_1] : ( multiply(identity,X_1) = X_1 ),
inference(cnfTransformation,[status(thm)],[f_56]) ).
tff(c_787,plain,
! [Y_65,X_66,Z_67] : ( least_upper_bound(multiply(Y_65,X_66),multiply(Z_67,X_66)) = multiply(least_upper_bound(Y_65,Z_67),X_66) ),
inference(cnfTransformation,[status(thm)],[f_110]) ).
tff(c_5818,plain,
! [Y_126,X_127] : ( multiply(least_upper_bound(Y_126,identity),X_127) = least_upper_bound(multiply(Y_126,X_127),X_127) ),
inference(superposition,[status(thm),theory(equality)],[c_2,c_787]) ).
tff(c_8383,plain,
! [X_147] : ( least_upper_bound(multiply(b,X_147),X_147) = multiply(b,X_147) ),
inference(superposition,[status(thm),theory(equality)],[c_34,c_5818]) ).
tff(c_10,plain,
! [Y_9,X_8] : ( least_upper_bound(Y_9,X_8) = least_upper_bound(X_8,Y_9) ),
inference(cnfTransformation,[status(thm)],[f_91]) ).
tff(c_8454,plain,
! [X_147] : ( least_upper_bound(X_147,multiply(b,X_147)) = multiply(b,X_147) ),
inference(superposition,[status(thm),theory(equality)],[c_8383,c_10]) ).
tff(c_36,plain,
least_upper_bound(a,multiply(b,a)) != multiply(b,a),
inference(cnfTransformation,[status(thm)],[f_118]) ).
tff(c_51238,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_8454,c_36]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.10 % Problem : GRP166-3 : TPTP v9.0.0. Bugfixed v1.2.1.
% 0.02/0.10 % 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.09/0.30 % Computer : n016.cluster.edu
% 0.09/0.30 % Model : x86_64 x86_64
% 0.09/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.30 % Memory : 8042.1875MB
% 0.09/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.30 % CPULimit : 300
% 0.09/0.30 % WCLimit : 300
% 0.09/0.30 % DateTime : Mon Apr 7 21:30:23 EDT 2025
% 0.09/0.30 % CPUTime :
% 22.22/9.75 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 22.22/9.76
% 22.22/9.76 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------