TSTP Solution File: GRP552-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : GRP552-1 : TPTP v8.1.2. Bugfixed v2.7.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 : Tue Aug 22 10:41:30 EDT 2023
% Result : Unsatisfiable 3.42s 2.04s
% Output : CNFRefutation 3.64s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 11
% Syntax : Number of formulae : 31 ( 25 unt; 6 typ; 0 def)
% Number of atoms : 25 ( 24 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 2 ( 2 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 5 ( 3 >; 2 *; 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 : 35 (; 35 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ multiply > divide > #nlpp > inverse > identity > b > a
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(a,type,
a: $i ).
tff(divide,type,
divide: ( $i * $i ) > $i ).
tff(inverse,type,
inverse: $i > $i ).
tff(multiply,type,
multiply: ( $i * $i ) > $i ).
tff(b,type,
b: $i ).
tff(identity,type,
identity: $i ).
tff(f_30,axiom,
! [A] : ( identity = divide(A,A) ),
file(unknown,unknown) ).
tff(f_28,axiom,
! [A] : ( inverse(A) = divide(identity,A) ),
file(unknown,unknown) ).
tff(f_24,axiom,
! [A,B,C] : ( divide(divide(identity,A),divide(divide(divide(B,A),C),B)) = C ),
file(unknown,unknown) ).
tff(f_26,axiom,
! [A,B] : ( multiply(A,B) = divide(A,divide(identity,B)) ),
file(unknown,unknown) ).
tff(f_32,axiom,
multiply(a,b) != multiply(b,a),
file(unknown,unknown) ).
tff(c_8,plain,
! [A_7] : ( divide(A_7,A_7) = identity ),
inference(cnfTransformation,[status(thm)],[f_30]) ).
tff(c_6,plain,
! [A_6] : ( divide(identity,A_6) = inverse(A_6) ),
inference(cnfTransformation,[status(thm)],[f_28]) ).
tff(c_2,plain,
! [A_1,B_2,C_3] : ( divide(divide(identity,A_1),divide(divide(divide(B_2,A_1),C_3),B_2)) = C_3 ),
inference(cnfTransformation,[status(thm)],[f_24]) ).
tff(c_183,plain,
! [A_17,B_18,C_19] : ( divide(inverse(A_17),divide(divide(divide(B_18,A_17),C_19),B_18)) = C_19 ),
inference(demodulation,[status(thm),theory(equality)],[c_6,c_2]) ).
tff(c_329,plain,
! [A_24,C_25] : ( divide(inverse(A_24),divide(divide(inverse(A_24),C_25),identity)) = C_25 ),
inference(superposition,[status(thm),theory(equality)],[c_6,c_183]) ).
tff(c_367,plain,
! [A_24] : ( divide(inverse(A_24),divide(identity,identity)) = inverse(A_24) ),
inference(superposition,[status(thm),theory(equality)],[c_8,c_329]) ).
tff(c_376,plain,
! [A_24] : ( divide(inverse(A_24),identity) = inverse(A_24) ),
inference(demodulation,[status(thm),theory(equality)],[c_8,c_367]) ).
tff(c_20,plain,
! [A_9] : ( divide(identity,A_9) = inverse(A_9) ),
inference(cnfTransformation,[status(thm)],[f_28]) ).
tff(c_27,plain,
inverse(identity) = identity,
inference(superposition,[status(thm),theory(equality)],[c_20,c_8]) ).
tff(c_360,plain,
! [C_25] : ( divide(identity,divide(divide(inverse(identity),C_25),identity)) = C_25 ),
inference(superposition,[status(thm),theory(equality)],[c_27,c_329]) ).
tff(c_374,plain,
! [C_25] : ( inverse(divide(inverse(C_25),identity)) = C_25 ),
inference(demodulation,[status(thm),theory(equality)],[c_6,c_6,c_27,c_360]) ).
tff(c_450,plain,
! [C_28] : ( inverse(inverse(C_28)) = C_28 ),
inference(demodulation,[status(thm),theory(equality)],[c_376,c_374]) ).
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_26]) ).
tff(c_11,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_222,plain,
! [A_17,B_18] : ( divide(inverse(A_17),divide(identity,B_18)) = divide(B_18,A_17) ),
inference(superposition,[status(thm),theory(equality)],[c_8,c_183]) ).
tff(c_230,plain,
! [A_17,B_18] : ( multiply(inverse(A_17),B_18) = divide(B_18,A_17) ),
inference(demodulation,[status(thm),theory(equality)],[c_11,c_6,c_222]) ).
tff(c_1101,plain,
! [B_47,C_48] : ( divide(B_47,inverse(C_48)) = multiply(C_48,B_47) ),
inference(superposition,[status(thm),theory(equality)],[c_450,c_230]) ).
tff(c_1144,plain,
! [C_48,B_47] : ( multiply(C_48,B_47) = multiply(B_47,C_48) ),
inference(superposition,[status(thm),theory(equality)],[c_1101,c_11]) ).
tff(c_10,plain,
multiply(b,a) != multiply(a,b),
inference(cnfTransformation,[status(thm)],[f_32]) ).
tff(c_1195,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_1144,c_10]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : GRP552-1 : TPTP v8.1.2. Bugfixed v2.7.0.
% 0.00/0.14 % 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.14/0.35 % Computer : n019.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Thu Aug 3 22:05:01 EDT 2023
% 0.14/0.36 % CPUTime :
% 3.42/2.04 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.42/2.04
% 3.42/2.04 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.64/2.07
% 3.64/2.07 Inference rules
% 3.64/2.07 ----------------------
% 3.64/2.07 #Ref : 0
% 3.64/2.07 #Sup : 288
% 3.64/2.07 #Fact : 0
% 3.64/2.07 #Define : 0
% 3.64/2.07 #Split : 0
% 3.64/2.07 #Chain : 0
% 3.64/2.07 #Close : 0
% 3.64/2.07
% 3.64/2.07 Ordering : KBO
% 3.64/2.07
% 3.64/2.07 Simplification rules
% 3.64/2.07 ----------------------
% 3.64/2.07 #Subsume : 0
% 3.64/2.07 #Demod : 229
% 3.64/2.07 #Tautology : 169
% 3.64/2.07 #SimpNegUnit : 0
% 3.64/2.07 #BackRed : 10
% 3.64/2.07
% 3.64/2.07 #Partial instantiations: 0
% 3.64/2.07 #Strategies tried : 1
% 3.64/2.07
% 3.64/2.07 Timing (in seconds)
% 3.64/2.07 ----------------------
% 3.64/2.07 Preprocessing : 0.41
% 3.64/2.07 Parsing : 0.22
% 3.64/2.07 CNF conversion : 0.02
% 3.64/2.07 Main loop : 0.47
% 3.64/2.07 Inferencing : 0.18
% 3.64/2.07 Reduction : 0.16
% 3.64/2.07 Demodulation : 0.12
% 3.64/2.07 BG Simplification : 0.02
% 3.64/2.07 Subsumption : 0.07
% 3.64/2.07 Abstraction : 0.03
% 3.64/2.07 MUC search : 0.00
% 3.64/2.07 Cooper : 0.00
% 3.64/2.07 Total : 0.92
% 3.64/2.07 Index Insertion : 0.00
% 3.64/2.07 Index Deletion : 0.00
% 3.64/2.07 Index Matching : 0.00
% 3.64/2.07 BG Taut test : 0.00
%------------------------------------------------------------------------------