%------------------------------------------------------------------------------
% File : Beagle---0.9.52
% Problem : GRP154-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/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 : n031.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:22 PM UTC 2025
% Result : Unsatisfiable 2.65s 1.60s
% Output : CNFRefutation 2.65s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 3
% Syntax : Number of formulae : 8 ( 8 unt; 0 typ; 0 def)
% Number of atoms : 8 ( 7 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 3 ( 3 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 avg)
% Maximal term depth : 3 ( 2 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 : 6 ( 6 !; 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_117,axiom,
least_upper_bound(a,b) = b,
file(unknown,unknown) ).
tff(f_112,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_119,axiom,
least_upper_bound(multiply(a,c),multiply(b,c)) != multiply(b,c),
file(unknown,unknown) ).
tff(c_32,plain,
least_upper_bound(a,b) = b,
inference(cnfTransformation,[status(thm)],[f_117]) ).
tff(c_28,plain,
! [Y_28,X_30,Z_29] : ( least_upper_bound(multiply(Y_28,X_30),multiply(Z_29,X_30)) = multiply(least_upper_bound(Y_28,Z_29),X_30) ),
inference(cnfTransformation,[status(thm)],[f_112]) ).
tff(c_34,plain,
least_upper_bound(multiply(a,c),multiply(b,c)) != multiply(b,c),
inference(cnfTransformation,[status(thm)],[f_119]) ).
tff(c_35,plain,
multiply(least_upper_bound(a,b),c) != multiply(b,c),
inference(demodulation,[status(thm),theory(equality)],[c_28,c_34]) ).
tff(c_37,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_32,c_35]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : GRP154-1 : TPTP v9.0.0. Bugfixed v1.2.1.
% 0.07/0.14 % 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.35 % Computer : n031.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Mon Apr 7 21:29:22 EDT 2025
% 0.13/0.35 % CPUTime :
% 2.65/1.60 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.65/1.60
% 2.65/1.60 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------