%------------------------------------------------------------------------------
% File : Beagle---0.9.52
% Problem : GRP557-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/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 : n014.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:30 PM UTC 2025
% Result : Unsatisfiable 6.71s 2.60s
% Output : CNFRefutation 7.06s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 3
% Syntax : Number of formulae : 33 ( 33 unt; 0 typ; 0 def)
% Number of atoms : 33 ( 32 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 5 ( 5 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 avg)
% Maximal term depth : 8 ( 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 : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 68 ( 68 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ multiply > divide > #nlpp > inverse > b1 > a1
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(a1,type,
a1: $i ).
tff(divide,type,
divide: ( $i * $i ) > $i ).
tff(inverse,type,
inverse: $i > $i ).
tff(multiply,type,
multiply: ( $i * $i ) > $i ).
tff(b1,type,
b1: $i ).
tff(f_23,axiom,
! [A,B,C] : ( divide(A,inverse(divide(divide(B,C),divide(A,C)))) = B ),
file(unknown,unknown) ).
tff(f_25,axiom,
! [A,B] : ( multiply(A,B) = divide(A,inverse(B)) ),
file(unknown,unknown) ).
tff(f_27,axiom,
multiply(inverse(a1),a1) != multiply(inverse(b1),b1),
file(unknown,unknown) ).
tff(c_16,plain,
! [A_8,B_9,C_10] : ( divide(A_8,inverse(divide(divide(B_9,C_10),divide(A_8,C_10)))) = B_9 ),
inference(cnfTransformation,[status(thm)],[f_23]) ).
tff(c_4,plain,
! [A_4,B_5] : ( divide(A_4,inverse(B_5)) = multiply(A_4,B_5) ),
inference(cnfTransformation,[status(thm)],[f_25]) ).
tff(c_28,plain,
! [A_8,B_9,C_10] : ( multiply(A_8,divide(divide(B_9,C_10),divide(A_8,C_10))) = B_9 ),
inference(superposition,[status(thm),theory(equality)],[c_16,c_4]) ).
tff(c_2,plain,
! [A_1,B_2,C_3] : ( divide(A_1,inverse(divide(divide(B_2,C_3),divide(A_1,C_3)))) = B_2 ),
inference(cnfTransformation,[status(thm)],[f_23]) ).
tff(c_22,plain,
! [A_8,B_2,B_9,C_10] : ( divide(A_8,inverse(divide(divide(B_2,inverse(divide(divide(B_9,C_10),divide(A_8,C_10)))),B_9))) = B_2 ),
inference(superposition,[status(thm),theory(equality)],[c_16,c_2]) ).
tff(c_112,plain,
! [A_17,B_18,B_19,C_20] : ( multiply(A_17,divide(multiply(B_18,divide(divide(B_19,C_20),divide(A_17,C_20))),B_19)) = B_18 ),
inference(demodulation,[status(thm),theory(equality)],[c_4,c_4,c_22]) ).
tff(c_127,plain,
! [A_8,B_9] : ( multiply(A_8,divide(B_9,B_9)) = A_8 ),
inference(superposition,[status(thm),theory(equality)],[c_28,c_112]) ).
tff(c_150,plain,
! [A_21,B_22] : ( multiply(A_21,divide(B_22,B_22)) = A_21 ),
inference(superposition,[status(thm),theory(equality)],[c_28,c_112]) ).
tff(c_49,plain,
! [A_8,B_2,B_9,C_10] : ( multiply(A_8,divide(multiply(B_2,divide(divide(B_9,C_10),divide(A_8,C_10))),B_9)) = B_2 ),
inference(demodulation,[status(thm),theory(equality)],[c_4,c_4,c_22]) ).
tff(c_195,plain,
! [B_23,A_24] : ( multiply(B_23,divide(A_24,B_23)) = A_24 ),
inference(superposition,[status(thm),theory(equality)],[c_150,c_49]) ).
tff(c_315,plain,
! [B_31,A_32] : ( multiply(inverse(B_31),multiply(A_32,B_31)) = A_32 ),
inference(superposition,[status(thm),theory(equality)],[c_4,c_195]) ).
tff(c_353,plain,
! [B_9,A_8] : ( multiply(inverse(divide(B_9,B_9)),A_8) = A_8 ),
inference(superposition,[status(thm),theory(equality)],[c_127,c_315]) ).
tff(c_503,plain,
! [B_39,A_40] : ( multiply(inverse(divide(B_39,B_39)),A_40) = A_40 ),
inference(superposition,[status(thm),theory(equality)],[c_127,c_315]) ).
tff(c_40,plain,
! [A_8,A_4,B_5] : ( divide(A_8,inverse(divide(multiply(A_4,B_5),divide(A_8,inverse(B_5))))) = A_4 ),
inference(superposition,[status(thm),theory(equality)],[c_4,c_16]) ).
tff(c_54,plain,
! [A_8,A_4,B_5] : ( multiply(A_8,divide(multiply(A_4,B_5),multiply(A_8,B_5))) = A_4 ),
inference(demodulation,[status(thm),theory(equality)],[c_4,c_4,c_40]) ).
tff(c_571,plain,
! [A_4,B_5,B_39] : ( divide(multiply(A_4,B_5),multiply(inverse(divide(B_39,B_39)),B_5)) = A_4 ),
inference(superposition,[status(thm),theory(equality)],[c_503,c_54]) ).
tff(c_639,plain,
! [A_41,B_42] : ( divide(multiply(A_41,B_42),B_42) = A_41 ),
inference(demodulation,[status(thm),theory(equality)],[c_353,c_571]) ).
tff(c_936,plain,
! [A_47,B_48] : ( divide(A_47,divide(B_48,B_48)) = A_47 ),
inference(superposition,[status(thm),theory(equality)],[c_127,c_639]) ).
tff(c_157,plain,
! [B_9,A_21] : ( multiply(B_9,divide(A_21,B_9)) = A_21 ),
inference(superposition,[status(thm),theory(equality)],[c_150,c_49]) ).
tff(c_703,plain,
! [A_21,B_9] : ( divide(A_21,divide(A_21,B_9)) = B_9 ),
inference(superposition,[status(thm),theory(equality)],[c_157,c_639]) ).
tff(c_946,plain,
! [B_48,A_47] : ( divide(B_48,B_48) = divide(A_47,A_47) ),
inference(superposition,[status(thm),theory(equality)],[c_936,c_703]) ).
tff(c_1178,plain,
! [A_51,B_52] : ( multiply(multiply(A_51,inverse(B_52)),B_52) = A_51 ),
inference(superposition,[status(thm),theory(equality)],[c_4,c_639]) ).
tff(c_633,plain,
! [A_4,B_5] : ( divide(multiply(A_4,B_5),B_5) = A_4 ),
inference(demodulation,[status(thm),theory(equality)],[c_353,c_571]) ).
tff(c_1194,plain,
! [A_51,B_52] : ( multiply(A_51,inverse(B_52)) = divide(A_51,B_52) ),
inference(superposition,[status(thm),theory(equality)],[c_1178,c_633]) ).
tff(c_654,plain,
! [B_42,A_41] : ( multiply(B_42,A_41) = multiply(A_41,B_42) ),
inference(superposition,[status(thm),theory(equality)],[c_639,c_157]) ).
tff(c_6,plain,
multiply(inverse(b1),b1) != multiply(inverse(a1),a1),
inference(cnfTransformation,[status(thm)],[f_27]) ).
tff(c_725,plain,
multiply(b1,inverse(b1)) != multiply(a1,inverse(a1)),
inference(demodulation,[status(thm),theory(equality)],[c_654,c_654,c_6]) ).
tff(c_7705,plain,
divide(b1,b1) != divide(a1,a1),
inference(demodulation,[status(thm),theory(equality)],[c_1194,c_1194,c_725]) ).
tff(c_7707,plain,
! [B_48] : ( divide(a1,a1) != divide(B_48,B_48) ),
inference(superposition,[status(thm),theory(equality)],[c_946,c_7705]) ).
tff(c_7713,plain,
$false,
inference(reflexivity,[status(thm),theory(equality)],[c_7707]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.07 % Problem : GRP557-1 : TPTP v9.0.0. Released v2.6.0.
% 0.02/0.08 % 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.07/0.28 % Computer : n014.cluster.edu
% 0.07/0.28 % Model : x86_64 x86_64
% 0.07/0.28 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.28 % Memory : 8042.1875MB
% 0.07/0.28 % OS : Linux 3.10.0-693.el7.x86_64
% 0.07/0.28 % CPULimit : 300
% 0.07/0.28 % WCLimit : 300
% 0.07/0.28 % DateTime : Mon Apr 7 21:55:49 EDT 2025
% 0.07/0.28 % CPUTime :
% 6.71/2.60 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 7.06/2.60
% 7.06/2.60 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------