%------------------------------------------------------------------------------
% File : Beagle---0.9.52
% Problem : GRP165-2 : 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/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 : n018.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:23 PM UTC 2025
% Result : Unsatisfiable 5.98s 2.58s
% Output : CNFRefutation 6.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 5
% Syntax : Number of formulae : 15 ( 15 unt; 0 typ; 0 def)
% Number of atoms : 15 ( 14 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 : 6 ( 6 usr; 2 con; 0-2 aty)
% Number of variables : 17 ( 17 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ multiply > least_upper_bound > greatest_lower_bound > #nlpp > inverse > identity > 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(identity,type,
identity: $i ).
tff(f_58,axiom,
! [X] : ( multiply(identity,X) = X ),
file(unknown,unknown) ).
tff(f_117,axiom,
greatest_lower_bound(a,identity) = identity,
file(unknown,unknown) ).
tff(f_114,axiom,
! [Y,Z,X] : ( multiply(greatest_lower_bound(Y,Z),X) = greatest_lower_bound(multiply(Y,X),multiply(Z,X)) ),
file(unknown,unknown) ).
tff(f_91,axiom,
! [X,Y] : ( greatest_lower_bound(X,Y) = greatest_lower_bound(Y,X) ),
file(unknown,unknown) ).
tff(f_119,axiom,
greatest_lower_bound(a,multiply(a,a)) != a,
file(unknown,unknown) ).
tff(c_2,plain,
! [X_1] : ( multiply(identity,X_1) = X_1 ),
inference(cnfTransformation,[status(thm)],[f_58]) ).
tff(c_32,plain,
greatest_lower_bound(a,identity) = identity,
inference(cnfTransformation,[status(thm)],[f_117]) ).
tff(c_992,plain,
! [Y_72,X_73,Z_74] : ( greatest_lower_bound(multiply(Y_72,X_73),multiply(Z_74,X_73)) = multiply(greatest_lower_bound(Y_72,Z_74),X_73) ),
inference(cnfTransformation,[status(thm)],[f_114]) ).
tff(c_4545,plain,
! [Y_128,X_129] : ( multiply(greatest_lower_bound(Y_128,identity),X_129) = greatest_lower_bound(multiply(Y_128,X_129),X_129) ),
inference(superposition,[status(thm),theory(equality)],[c_2,c_992]) ).
tff(c_4738,plain,
! [X_129] : ( greatest_lower_bound(multiply(a,X_129),X_129) = multiply(identity,X_129) ),
inference(superposition,[status(thm),theory(equality)],[c_32,c_4545]) ).
tff(c_4775,plain,
! [X_130] : ( greatest_lower_bound(multiply(a,X_130),X_130) = X_130 ),
inference(demodulation,[status(thm),theory(equality)],[c_2,c_4738]) ).
tff(c_8,plain,
! [Y_7,X_6] : ( greatest_lower_bound(Y_7,X_6) = greatest_lower_bound(X_6,Y_7) ),
inference(cnfTransformation,[status(thm)],[f_91]) ).
tff(c_4853,plain,
! [X_130] : ( greatest_lower_bound(X_130,multiply(a,X_130)) = X_130 ),
inference(superposition,[status(thm),theory(equality)],[c_4775,c_8]) ).
tff(c_34,plain,
greatest_lower_bound(a,multiply(a,a)) != a,
inference(cnfTransformation,[status(thm)],[f_119]) ).
tff(c_5165,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_4853,c_34]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : GRP165-2 : TPTP v9.0.0. Bugfixed v1.2.1.
% 0.03/0.12 % 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.33 % Computer : n018.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Mon Apr 7 21:30:32 EDT 2025
% 0.12/0.33 % CPUTime :
% 5.98/2.58 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 5.98/2.59
% 5.98/2.59 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------