%------------------------------------------------------------------------------
% File : Beagle---0.9.52
% Problem : GRP526-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 : n021.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:26 PM UTC 2025
% Result : Unsatisfiable 3.71s 1.93s
% Output : CNFRefutation 3.71s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 4
% 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 : 3 ( 3 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 3 avg)
% Maximal term depth : 5 ( 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 : 63 ( 63 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ multiply > divide > #nlpp > inverse > 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(f_27,axiom,
! [A,B] : ( inverse(A) = divide(divide(B,B),A) ),
file(unknown,unknown) ).
tff(f_23,axiom,
! [A,B,C] : ( divide(A,divide(divide(A,B),divide(C,B))) = C ),
file(unknown,unknown) ).
tff(f_25,axiom,
! [A,B,C] : ( multiply(A,B) = divide(A,divide(divide(C,C),B)) ),
file(unknown,unknown) ).
tff(f_29,axiom,
multiply(multiply(inverse(b2),b2),a2) != a2,
file(unknown,unknown) ).
tff(c_6,plain,
! [B_8,A_7] : ( divide(divide(B_8,B_8),A_7) = inverse(A_7) ),
inference(cnfTransformation,[status(thm)],[f_27]) ).
tff(c_106,plain,
! [A_17,B_18,C_19] : ( divide(A_17,divide(divide(A_17,B_18),divide(C_19,B_18))) = C_19 ),
inference(cnfTransformation,[status(thm)],[f_23]) ).
tff(c_181,plain,
! [B_20,C_21] : ( divide(B_20,inverse(divide(C_21,B_20))) = C_21 ),
inference(superposition,[status(thm),theory(equality)],[c_6,c_106]) ).
tff(c_4,plain,
! [A_4,C_6,B_5] : ( divide(A_4,divide(divide(C_6,C_6),B_5)) = multiply(A_4,B_5) ),
inference(cnfTransformation,[status(thm)],[f_25]) ).
tff(c_9,plain,
! [A_4,B_5] : ( divide(A_4,inverse(B_5)) = multiply(A_4,B_5) ),
inference(demodulation,[status(thm),theory(equality)],[c_6,c_4]) ).
tff(c_241,plain,
! [B_22,C_23] : ( multiply(B_22,divide(C_23,B_22)) = C_23 ),
inference(superposition,[status(thm),theory(equality)],[c_181,c_9]) ).
tff(c_274,plain,
! [A_24,B_25] : ( multiply(A_24,inverse(A_24)) = divide(B_25,B_25) ),
inference(superposition,[status(thm),theory(equality)],[c_6,c_241]) ).
tff(c_200,plain,
! [B_20,C_21] : ( multiply(B_20,divide(C_21,B_20)) = C_21 ),
inference(superposition,[status(thm),theory(equality)],[c_181,c_9]) ).
tff(c_281,plain,
! [B_25,A_24] : ( multiply(B_25,multiply(A_24,inverse(A_24))) = B_25 ),
inference(superposition,[status(thm),theory(equality)],[c_274,c_200]) ).
tff(c_27,plain,
! [A_11,B_12] : ( divide(A_11,inverse(B_12)) = multiply(A_11,B_12) ),
inference(demodulation,[status(thm),theory(equality)],[c_6,c_4]) ).
tff(c_34,plain,
! [B_12,A_7] : ( divide(multiply(inverse(B_12),B_12),A_7) = inverse(A_7) ),
inference(superposition,[status(thm),theory(equality)],[c_27,c_6]) ).
tff(c_270,plain,
! [A_7,B_8] : ( multiply(A_7,inverse(A_7)) = divide(B_8,B_8) ),
inference(superposition,[status(thm),theory(equality)],[c_6,c_241]) ).
tff(c_337,plain,
! [B_27,B_26] : ( divide(B_27,B_27) = divide(B_26,B_26) ),
inference(superposition,[status(thm),theory(equality)],[c_274,c_270]) ).
tff(c_2,plain,
! [A_1,B_2,C_3] : ( divide(A_1,divide(divide(A_1,B_2),divide(C_3,B_2))) = C_3 ),
inference(cnfTransformation,[status(thm)],[f_23]) ).
tff(c_510,plain,
! [A_30,B_31] : ( divide(A_30,divide(B_31,B_31)) = A_30 ),
inference(superposition,[status(thm),theory(equality)],[c_337,c_2]) ).
tff(c_743,plain,
! [A_34,B_35] : ( divide(A_34,divide(A_34,B_35)) = B_35 ),
inference(superposition,[status(thm),theory(equality)],[c_510,c_2]) ).
tff(c_753,plain,
! [B_12,B_35] : ( inverse(divide(multiply(inverse(B_12),B_12),B_35)) = B_35 ),
inference(superposition,[status(thm),theory(equality)],[c_743,c_34]) ).
tff(c_836,plain,
! [B_35] : ( inverse(inverse(B_35)) = B_35 ),
inference(demodulation,[status(thm),theory(equality)],[c_34,c_753]) ).
tff(c_170,plain,
! [B_8,B_18,C_19] : ( inverse(divide(divide(divide(B_8,B_8),B_18),divide(C_19,B_18))) = C_19 ),
inference(superposition,[status(thm),theory(equality)],[c_6,c_106]) ).
tff(c_1465,plain,
! [B_51,C_52] : ( inverse(divide(inverse(B_51),divide(C_52,B_51))) = C_52 ),
inference(demodulation,[status(thm),theory(equality)],[c_6,c_170]) ).
tff(c_166,plain,
! [B_8,C_19] : ( divide(B_8,inverse(divide(C_19,B_8))) = C_19 ),
inference(superposition,[status(thm),theory(equality)],[c_6,c_106]) ).
tff(c_1583,plain,
! [C_53,B_54] : ( divide(divide(C_53,B_54),C_53) = inverse(B_54) ),
inference(superposition,[status(thm),theory(equality)],[c_1465,c_166]) ).
tff(c_1683,plain,
! [A_4,B_5] : ( divide(multiply(A_4,B_5),A_4) = inverse(inverse(B_5)) ),
inference(superposition,[status(thm),theory(equality)],[c_9,c_1583]) ).
tff(c_1711,plain,
! [A_55,B_56] : ( divide(multiply(A_55,B_56),A_55) = B_56 ),
inference(demodulation,[status(thm),theory(equality)],[c_836,c_1683]) ).
tff(c_760,plain,
! [A_34,B_35] : ( multiply(divide(A_34,B_35),B_35) = A_34 ),
inference(superposition,[status(thm),theory(equality)],[c_743,c_200]) ).
tff(c_1726,plain,
! [B_56,A_55] : ( multiply(B_56,A_55) = multiply(A_55,B_56) ),
inference(superposition,[status(thm),theory(equality)],[c_1711,c_760]) ).
tff(c_8,plain,
multiply(multiply(inverse(b2),b2),a2) != a2,
inference(cnfTransformation,[status(thm)],[f_29]) ).
tff(c_1817,plain,
multiply(a2,multiply(b2,inverse(b2))) != a2,
inference(demodulation,[status(thm),theory(equality)],[c_1726,c_1726,c_8]) ).
tff(c_1820,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_281,c_1817]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : GRP526-1 : TPTP v9.0.0. Released v2.6.0.
% 0.07/0.12 % 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.13/0.33 % Computer : n021.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 300
% 0.13/0.33 % DateTime : Mon Apr 7 21:55:13 EDT 2025
% 0.13/0.33 % CPUTime :
% 3.71/1.93 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.71/1.94
% 3.71/1.94 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------