%------------------------------------------------------------------------------
% File : Beagle---0.9.52
% Problem : GRP149-1 : 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 : n008.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:21 PM UTC 2025
% Result : Unsatisfiable 3.20s 1.81s
% Output : CNFRefutation 3.29s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 7
% Syntax : Number of formulae : 22 ( 22 unt; 0 typ; 0 def)
% Number of atoms : 22 ( 21 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 4 ( 4 ~; 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 : 8 ( 8 usr; 4 con; 0-2 aty)
% Number of variables : 20 ( 20 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ multiply > least_upper_bound > greatest_lower_bound > #nlpp > inverse > identity > c > 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(c,type,
c: $i ).
tff(f_93,axiom,
! [X,Y] : ( least_upper_bound(X,Y) = least_upper_bound(Y,X) ),
file(unknown,unknown) ).
tff(f_117,axiom,
greatest_lower_bound(a,c) = a,
file(unknown,unknown) ).
tff(f_91,axiom,
! [X,Y] : ( greatest_lower_bound(X,Y) = greatest_lower_bound(Y,X) ),
file(unknown,unknown) ).
tff(f_103,axiom,
! [X,Y] : ( least_upper_bound(X,greatest_lower_bound(X,Y)) = X ),
file(unknown,unknown) ).
tff(f_118,axiom,
greatest_lower_bound(b,c) = b,
file(unknown,unknown) ).
tff(f_97,axiom,
! [X,Y,Z] : ( least_upper_bound(X,least_upper_bound(Y,Z)) = least_upper_bound(least_upper_bound(X,Y),Z) ),
file(unknown,unknown) ).
tff(f_120,axiom,
least_upper_bound(least_upper_bound(a,b),c) != c,
file(unknown,unknown) ).
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_93]) ).
tff(c_32,plain,
greatest_lower_bound(a,c) = a,
inference(cnfTransformation,[status(thm)],[f_117]) ).
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_146,plain,
! [X_42,Y_43] : ( least_upper_bound(X_42,greatest_lower_bound(X_42,Y_43)) = X_42 ),
inference(cnfTransformation,[status(thm)],[f_103]) ).
tff(c_200,plain,
! [X_46,Y_47] : ( least_upper_bound(X_46,greatest_lower_bound(Y_47,X_46)) = X_46 ),
inference(superposition,[status(thm),theory(equality)],[c_8,c_146]) ).
tff(c_229,plain,
least_upper_bound(c,a) = c,
inference(superposition,[status(thm),theory(equality)],[c_32,c_200]) ).
tff(c_260,plain,
least_upper_bound(a,c) = c,
inference(superposition,[status(thm),theory(equality)],[c_10,c_229]) ).
tff(c_34,plain,
greatest_lower_bound(b,c) = b,
inference(cnfTransformation,[status(thm)],[f_118]) ).
tff(c_235,plain,
least_upper_bound(c,b) = c,
inference(superposition,[status(thm),theory(equality)],[c_34,c_200]) ).
tff(c_273,plain,
least_upper_bound(b,c) = c,
inference(superposition,[status(thm),theory(equality)],[c_235,c_10]) ).
tff(c_14,plain,
! [X_13,Y_14,Z_15] : ( least_upper_bound(least_upper_bound(X_13,Y_14),Z_15) = least_upper_bound(X_13,least_upper_bound(Y_14,Z_15)) ),
inference(cnfTransformation,[status(thm)],[f_97]) ).
tff(c_36,plain,
least_upper_bound(least_upper_bound(a,b),c) != c,
inference(cnfTransformation,[status(thm)],[f_120]) ).
tff(c_37,plain,
least_upper_bound(a,least_upper_bound(b,c)) != c,
inference(demodulation,[status(thm),theory(equality)],[c_14,c_36]) ).
tff(c_317,plain,
least_upper_bound(a,c) != c,
inference(demodulation,[status(thm),theory(equality)],[c_273,c_37]) ).
tff(c_320,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_260,c_317]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : GRP149-1 : TPTP v9.0.0. Bugfixed v1.2.1.
% 0.11/0.13 % 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.12/0.34 % Computer : n008.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 21:29:03 EDT 2025
% 0.12/0.34 % CPUTime :
% 3.20/1.81 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.20/1.82
% 3.20/1.82 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------