%------------------------------------------------------------------------------
% File : Beagle---0.9.52
% Problem : GRP171-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 : n020.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:26 PM UTC 2025
% Result : Unsatisfiable 8.37s 3.03s
% Output : CNFRefutation 8.37s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 8
% Syntax : Number of formulae : 28 ( 28 unt; 0 typ; 0 def)
% Number of atoms : 28 ( 27 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 : 4 ( 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 : 32 ( 32 !; 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_118,axiom,
greatest_lower_bound(identity,multiply(a,b)) != identity,
file(unknown,unknown) ).
tff(f_89,axiom,
! [X,Y] : ( greatest_lower_bound(X,Y) = greatest_lower_bound(Y,X) ),
file(unknown,unknown) ).
tff(f_116,axiom,
least_upper_bound(identity,b) = b,
file(unknown,unknown) ).
tff(f_103,axiom,
! [X,Y] : ( greatest_lower_bound(X,least_upper_bound(X,Y)) = X ),
file(unknown,unknown) ).
tff(f_56,axiom,
! [X] : ( multiply(identity,X) = X ),
file(unknown,unknown) ).
tff(f_115,axiom,
least_upper_bound(identity,a) = a,
file(unknown,unknown) ).
tff(f_112,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_93,axiom,
! [X,Y,Z] : ( greatest_lower_bound(X,greatest_lower_bound(Y,Z)) = greatest_lower_bound(greatest_lower_bound(X,Y),Z) ),
file(unknown,unknown) ).
tff(c_36,plain,
greatest_lower_bound(identity,multiply(a,b)) != identity,
inference(cnfTransformation,[status(thm)],[f_118]) ).
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_89]) ).
tff(c_34,plain,
least_upper_bound(identity,b) = b,
inference(cnfTransformation,[status(thm)],[f_116]) ).
tff(c_202,plain,
! [X_44,Y_45] : ( greatest_lower_bound(X_44,least_upper_bound(X_44,Y_45)) = X_44 ),
inference(cnfTransformation,[status(thm)],[f_103]) ).
tff(c_235,plain,
greatest_lower_bound(identity,b) = identity,
inference(superposition,[status(thm),theory(equality)],[c_34,c_202]) ).
tff(c_284,plain,
greatest_lower_bound(b,identity) = identity,
inference(superposition,[status(thm),theory(equality)],[c_8,c_235]) ).
tff(c_2,plain,
! [X_1] : ( multiply(identity,X_1) = X_1 ),
inference(cnfTransformation,[status(thm)],[f_56]) ).
tff(c_32,plain,
least_upper_bound(identity,a) = a,
inference(cnfTransformation,[status(thm)],[f_115]) ).
tff(c_229,plain,
greatest_lower_bound(identity,a) = identity,
inference(superposition,[status(thm),theory(equality)],[c_32,c_202]) ).
tff(c_1208,plain,
! [Y_77,X_78,Z_79] : ( greatest_lower_bound(multiply(Y_77,X_78),multiply(Z_79,X_78)) = multiply(greatest_lower_bound(Y_77,Z_79),X_78) ),
inference(cnfTransformation,[status(thm)],[f_112]) ).
tff(c_6230,plain,
! [Z_137,X_138] : ( multiply(greatest_lower_bound(identity,Z_137),X_138) = greatest_lower_bound(X_138,multiply(Z_137,X_138)) ),
inference(superposition,[status(thm),theory(equality)],[c_2,c_1208]) ).
tff(c_6400,plain,
! [X_138] : ( greatest_lower_bound(X_138,multiply(a,X_138)) = multiply(identity,X_138) ),
inference(superposition,[status(thm),theory(equality)],[c_229,c_6230]) ).
tff(c_6448,plain,
! [X_138] : ( greatest_lower_bound(X_138,multiply(a,X_138)) = X_138 ),
inference(demodulation,[status(thm),theory(equality)],[c_2,c_6400]) ).
tff(c_22,plain,
! [X_20,Y_21] : ( greatest_lower_bound(X_20,least_upper_bound(X_20,Y_21)) = X_20 ),
inference(cnfTransformation,[status(thm)],[f_103]) ).
tff(c_402,plain,
! [X_52,Y_53,Z_54] : ( greatest_lower_bound(greatest_lower_bound(X_52,Y_53),Z_54) = greatest_lower_bound(X_52,greatest_lower_bound(Y_53,Z_54)) ),
inference(cnfTransformation,[status(thm)],[f_93]) ).
tff(c_11661,plain,
! [X_168,Y_169,Z_170] : ( greatest_lower_bound(X_168,greatest_lower_bound(least_upper_bound(X_168,Y_169),Z_170)) = greatest_lower_bound(X_168,Z_170) ),
inference(superposition,[status(thm),theory(equality)],[c_22,c_402]) ).
tff(c_12892,plain,
! [Z_175] : ( greatest_lower_bound(identity,greatest_lower_bound(b,Z_175)) = greatest_lower_bound(identity,Z_175) ),
inference(superposition,[status(thm),theory(equality)],[c_34,c_11661]) ).
tff(c_12978,plain,
greatest_lower_bound(identity,multiply(a,b)) = greatest_lower_bound(identity,b),
inference(superposition,[status(thm),theory(equality)],[c_6448,c_12892]) ).
tff(c_13075,plain,
greatest_lower_bound(identity,multiply(a,b)) = identity,
inference(demodulation,[status(thm),theory(equality)],[c_284,c_8,c_12978]) ).
tff(c_13077,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_36,c_13075]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : GRP171-2 : TPTP v9.0.0. Bugfixed v1.2.1.
% 0.11/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.13/0.34 % Computer : n020.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Mon Apr 7 21:31:04 EDT 2025
% 0.13/0.35 % CPUTime :
% 8.37/3.03 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 8.37/3.03
% 8.37/3.03 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------