%------------------------------------------------------------------------------
% File : Beagle---0.9.52
% Problem : GRP546-1 : TPTP v9.0.0. Released v2.6.0.
% 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:26:29 PM UTC 2025
% Result : Unsatisfiable 2.92s 1.78s
% Output : CNFRefutation 2.96s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 5
% 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 : 3 ( 3 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 avg)
% Maximal term depth : 4 ( 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 : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 28 ( 28 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ multiply > divide > #nlpp > inverse > identity > b2 > a2
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(divide,type,
divide: ( $i * $i ) > $i ).
tff(b2,type,
b2: $i ).
tff(inverse,type,
inverse: $i > $i ).
tff(multiply,type,
multiply: ( $i * $i ) > $i ).
tff(a2,type,
a2: $i ).
tff(identity,type,
identity: $i ).
tff(f_27,axiom,
! [A] : ( inverse(A) = divide(identity,A) ),
file(unknown,unknown) ).
tff(f_25,axiom,
! [A,B] : ( multiply(A,B) = divide(A,divide(identity,B)) ),
file(unknown,unknown) ).
tff(f_29,axiom,
! [A] : ( identity = divide(A,A) ),
file(unknown,unknown) ).
tff(f_23,axiom,
! [A,B,C] : ( divide(divide(identity,divide(A,B)),divide(divide(B,C),A)) = C ),
file(unknown,unknown) ).
tff(f_31,axiom,
multiply(multiply(inverse(b2),b2),a2) != a2,
file(unknown,unknown) ).
tff(c_6,plain,
! [A_6] : ( divide(identity,A_6) = inverse(A_6) ),
inference(cnfTransformation,[status(thm)],[f_27]) ).
tff(c_4,plain,
! [A_4,B_5] : ( divide(A_4,divide(identity,B_5)) = multiply(A_4,B_5) ),
inference(cnfTransformation,[status(thm)],[f_25]) ).
tff(c_42,plain,
! [A_10,B_11] : ( divide(A_10,inverse(B_11)) = multiply(A_10,B_11) ),
inference(demodulation,[status(thm),theory(equality)],[c_6,c_4]) ).
tff(c_63,plain,
! [B_11] : ( inverse(inverse(B_11)) = multiply(identity,B_11) ),
inference(superposition,[status(thm),theory(equality)],[c_6,c_42]) ).
tff(c_8,plain,
! [A_7] : ( divide(A_7,A_7) = identity ),
inference(cnfTransformation,[status(thm)],[f_29]) ).
tff(c_20,plain,
! [A_9] : ( divide(identity,A_9) = inverse(A_9) ),
inference(cnfTransformation,[status(thm)],[f_27]) ).
tff(c_27,plain,
inverse(identity) = identity,
inference(superposition,[status(thm),theory(equality)],[c_20,c_8]) ).
tff(c_2,plain,
! [A_1,B_2,C_3] : ( divide(divide(identity,divide(A_1,B_2)),divide(divide(B_2,C_3),A_1)) = C_3 ),
inference(cnfTransformation,[status(thm)],[f_23]) ).
tff(c_183,plain,
! [A_17,B_18,C_19] : ( divide(inverse(divide(A_17,B_18)),divide(divide(B_18,C_19),A_17)) = C_19 ),
inference(demodulation,[status(thm),theory(equality)],[c_6,c_2]) ).
tff(c_220,plain,
! [A_7,C_19] : ( divide(inverse(identity),divide(divide(A_7,C_19),A_7)) = C_19 ),
inference(superposition,[status(thm),theory(equality)],[c_8,c_183]) ).
tff(c_237,plain,
! [A_20,C_21] : ( inverse(divide(divide(A_20,C_21),A_20)) = C_21 ),
inference(demodulation,[status(thm),theory(equality)],[c_6,c_27,c_220]) ).
tff(c_277,plain,
! [A_7] : ( inverse(divide(identity,A_7)) = A_7 ),
inference(superposition,[status(thm),theory(equality)],[c_8,c_237]) ).
tff(c_281,plain,
! [A_7] : ( multiply(identity,A_7) = A_7 ),
inference(demodulation,[status(thm),theory(equality)],[c_63,c_6,c_277]) ).
tff(c_53,plain,
! [B_11] : ( multiply(inverse(B_11),B_11) = identity ),
inference(superposition,[status(thm),theory(equality)],[c_42,c_8]) ).
tff(c_10,plain,
multiply(multiply(inverse(b2),b2),a2) != a2,
inference(cnfTransformation,[status(thm)],[f_31]) ).
tff(c_70,plain,
multiply(identity,a2) != a2,
inference(demodulation,[status(thm),theory(equality)],[c_53,c_10]) ).
tff(c_288,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_281,c_70]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : GRP546-1 : TPTP v9.0.0. Released v2.6.0.
% 0.03/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 : n016.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:55:38 EDT 2025
% 0.12/0.34 % CPUTime :
% 2.92/1.78 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.92/1.79
% 2.92/1.79 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------