%------------------------------------------------------------------------------
% File : Beagle---0.9.52
% Problem : GRP481-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 : n019.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:19 PM UTC 2025
% Result : Unsatisfiable 2.64s 1.69s
% Output : CNFRefutation 2.84s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 5
% Syntax : Number of formulae : 21 ( 21 unt; 0 typ; 0 def)
% Number of atoms : 21 ( 20 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 3 ( 3 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 avg)
% Maximal term depth : 7 ( 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 : 30 ( 30 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ multiply > double_divide > #nlpp > inverse > identity > a1
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(a1,type,
a1: $i ).
tff(inverse,type,
inverse: $i > $i ).
tff(double_divide,type,
double_divide: ( $i * $i ) > $i ).
tff(multiply,type,
multiply: ( $i * $i ) > $i ).
tff(identity,type,
identity: $i ).
tff(f_28,axiom,
! [A] : ( inverse(A) = double_divide(A,identity) ),
file(unknown,unknown) ).
tff(f_30,axiom,
! [A] : ( identity = double_divide(A,inverse(A)) ),
file(unknown,unknown) ).
tff(f_26,axiom,
! [A,B] : ( multiply(A,B) = double_divide(double_divide(B,A),identity) ),
file(unknown,unknown) ).
tff(f_32,axiom,
multiply(inverse(a1),a1) != identity,
file(unknown,unknown) ).
tff(f_24,axiom,
! [A,B,C,D] : ( double_divide(double_divide(double_divide(A,double_divide(B,identity)),double_divide(double_divide(C,double_divide(D,double_divide(D,identity))),double_divide(A,identity))),B) = C ),
file(unknown,unknown) ).
tff(c_6,plain,
! [A_7] : ( double_divide(A_7,identity) = inverse(A_7) ),
inference(cnfTransformation,[status(thm)],[f_28]) ).
tff(c_8,plain,
! [A_8] : ( double_divide(A_8,inverse(A_8)) = identity ),
inference(cnfTransformation,[status(thm)],[f_30]) ).
tff(c_28,plain,
! [B_11,A_12] : ( double_divide(double_divide(B_11,A_12),identity) = multiply(A_12,B_11) ),
inference(cnfTransformation,[status(thm)],[f_26]) ).
tff(c_52,plain,
! [A_8] : ( multiply(inverse(A_8),A_8) = double_divide(identity,identity) ),
inference(superposition,[status(thm),theory(equality)],[c_8,c_28]) ).
tff(c_57,plain,
! [A_8] : ( multiply(inverse(A_8),A_8) = inverse(identity) ),
inference(demodulation,[status(thm),theory(equality)],[c_6,c_52]) ).
tff(c_10,plain,
multiply(inverse(a1),a1) != identity,
inference(cnfTransformation,[status(thm)],[f_32]) ).
tff(c_58,plain,
inverse(identity) != identity,
inference(demodulation,[status(thm),theory(equality)],[c_57,c_10]) ).
tff(c_49,plain,
! [B_11,A_12] : ( inverse(double_divide(B_11,A_12)) = multiply(A_12,B_11) ),
inference(superposition,[status(thm),theory(equality)],[c_6,c_28]) ).
tff(c_2,plain,
! [A_1,B_2,C_3,D_4] : ( double_divide(double_divide(double_divide(A_1,double_divide(B_2,identity)),double_divide(double_divide(C_3,double_divide(D_4,double_divide(D_4,identity))),double_divide(A_1,identity))),B_2) = C_3 ),
inference(cnfTransformation,[status(thm)],[f_24]) ).
tff(c_66,plain,
! [A_14,B_15,C_16] : ( double_divide(double_divide(double_divide(A_14,inverse(B_15)),double_divide(inverse(C_16),inverse(A_14))),B_15) = C_16 ),
inference(demodulation,[status(thm),theory(equality)],[c_6,c_6,c_8,c_6,c_6,c_2]) ).
tff(c_106,plain,
! [C_16,B_15] : ( double_divide(double_divide(double_divide(inverse(C_16),inverse(B_15)),identity),B_15) = C_16 ),
inference(superposition,[status(thm),theory(equality)],[c_8,c_66]) ).
tff(c_110,plain,
! [C_16,B_15] : ( double_divide(inverse(double_divide(inverse(C_16),inverse(B_15))),B_15) = C_16 ),
inference(demodulation,[status(thm),theory(equality)],[c_6,c_106]) ).
tff(c_304,plain,
! [B_25,C_26] : ( double_divide(multiply(inverse(B_25),inverse(C_26)),B_25) = C_26 ),
inference(demodulation,[status(thm),theory(equality)],[c_49,c_110]) ).
tff(c_352,plain,
! [C_27] : ( double_divide(inverse(identity),inverse(C_27)) = C_27 ),
inference(superposition,[status(thm),theory(equality)],[c_57,c_304]) ).
tff(c_374,plain,
inverse(identity) = identity,
inference(superposition,[status(thm),theory(equality)],[c_352,c_8]) ).
tff(c_392,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_58,c_374]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : GRP481-1 : TPTP v9.0.0. Released v2.6.0.
% 0.10/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.33 % Computer : n019.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Mon Apr 7 21:52:02 EDT 2025
% 0.12/0.33 % CPUTime :
% 2.64/1.69 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.84/1.69
% 2.84/1.69 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------