%------------------------------------------------------------------------------
% File : Beagle---0.9.52
% Problem : GRP466-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 : n010.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:18 PM UTC 2025
% Result : Unsatisfiable 3.09s 1.77s
% Output : CNFRefutation 3.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 3
% Syntax : Number of formulae : 17 ( 17 unt; 0 typ; 0 def)
% Number of atoms : 17 ( 16 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 4 ( 4 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 4 avg)
% Maximal term depth : 6 ( 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 : 41 ( 41 !; 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_25,axiom,
! [A,B] : ( multiply(A,B) = divide(A,inverse(B)) ),
file(unknown,unknown) ).
tff(f_23,axiom,
! [A,B,C,D] : ( divide(divide(A,A),divide(B,divide(divide(C,divide(D,B)),inverse(D)))) = C ),
file(unknown,unknown) ).
tff(f_27,axiom,
multiply(inverse(a1),a1) != multiply(inverse(b1),b1),
file(unknown,unknown) ).
tff(c_4,plain,
! [A_5,B_6] : ( divide(A_5,inverse(B_6)) = multiply(A_5,B_6) ),
inference(cnfTransformation,[status(thm)],[f_25]) ).
tff(c_2,plain,
! [A_1,B_2,C_3,D_4] : ( divide(divide(A_1,A_1),divide(B_2,divide(divide(C_3,divide(D_4,B_2)),inverse(D_4)))) = C_3 ),
inference(cnfTransformation,[status(thm)],[f_23]) ).
tff(c_17,plain,
! [A_9,B_10,C_11,D_12] : ( divide(divide(A_9,A_9),divide(B_10,multiply(divide(C_11,divide(D_12,B_10)),D_12))) = C_11 ),
inference(demodulation,[status(thm),theory(equality)],[c_4,c_2]) ).
tff(c_7,plain,
! [A_1,B_2,C_3,D_4] : ( divide(divide(A_1,A_1),divide(B_2,multiply(divide(C_3,divide(D_4,B_2)),D_4))) = C_3 ),
inference(demodulation,[status(thm),theory(equality)],[c_4,c_2]) ).
tff(c_106,plain,
! [A_24,A_25,C_22,D_23,B_21] : ( divide(divide(A_24,A_24),divide(multiply(divide(C_22,divide(D_23,B_21)),D_23),multiply(C_22,B_21))) = divide(A_25,A_25) ),
inference(superposition,[status(thm),theory(equality)],[c_17,c_7]) ).
tff(c_23,plain,
! [C_11,A_1,B_10,D_12,A_9] : ( divide(divide(A_1,A_1),divide(multiply(divide(C_11,divide(D_12,B_10)),D_12),multiply(C_11,B_10))) = divide(A_9,A_9) ),
inference(superposition,[status(thm),theory(equality)],[c_17,c_7]) ).
tff(c_212,plain,
! [A_27,A_26] : ( divide(A_27,A_27) = divide(A_26,A_26) ),
inference(superposition,[status(thm),theory(equality)],[c_106,c_23]) ).
tff(c_290,plain,
! [B_6,A_27] : ( multiply(inverse(B_6),B_6) = divide(A_27,A_27) ),
inference(superposition,[status(thm),theory(equality)],[c_212,c_4]) ).
tff(c_319,plain,
! [B_28,A_29] : ( multiply(inverse(B_28),B_28) = divide(A_29,A_29) ),
inference(superposition,[status(thm),theory(equality)],[c_212,c_4]) ).
tff(c_6,plain,
multiply(inverse(b1),b1) != multiply(inverse(a1),a1),
inference(cnfTransformation,[status(thm)],[f_27]) ).
tff(c_391,plain,
! [A_30] : ( multiply(inverse(a1),a1) != divide(A_30,A_30) ),
inference(superposition,[status(thm),theory(equality)],[c_319,c_6]) ).
tff(c_395,plain,
! [A_30,A_27] : ( divide(A_30,A_30) != divide(A_27,A_27) ),
inference(superposition,[status(thm),theory(equality)],[c_290,c_391]) ).
tff(c_125,plain,
! [A_9,A_25] : ( divide(A_9,A_9) = divide(A_25,A_25) ),
inference(superposition,[status(thm),theory(equality)],[c_106,c_23]) ).
tff(c_407,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_395,c_125]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : GRP466-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.13/0.34 % Computer : n010.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Mon Apr 7 21:51:47 EDT 2025
% 0.13/0.34 % CPUTime :
% 3.09/1.77 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.09/1.77
% 3.09/1.77 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------