TSTP Solution File: GRP461-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : GRP461-1 : TPTP v8.1.2. 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 : n004.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:18 EDT 2023
% Result : Unsatisfiable 2.98s 1.79s
% Output : CNFRefutation 2.98s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 10
% Syntax : Number of formulae : 32 ( 27 unt; 5 typ; 0 def)
% Number of atoms : 27 ( 26 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 : 6 ( 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 : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 36 (; 36 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ multiply > divide > #nlpp > inverse > identity > a2
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(divide,type,
divide: ( $i * $i ) > $i ).
tff(inverse,type,
inverse: $i > $i ).
tff(multiply,type,
multiply: ( $i * $i ) > $i ).
tff(a2,type,
a2: $i ).
tff(identity,type,
identity: $i ).
tff(f_29,axiom,
! [A] : ( identity = divide(A,A) ),
file(unknown,unknown) ).
tff(f_27,axiom,
! [A] : ( inverse(A) = divide(identity,A) ),
file(unknown,unknown) ).
tff(f_23,axiom,
! [A,B,C] : ( divide(A,divide(divide(divide(identity,B),C),divide(divide(divide(A,A),A),C))) = B ),
file(unknown,unknown) ).
tff(f_25,axiom,
! [A,B] : ( multiply(A,B) = divide(A,divide(identity,B)) ),
file(unknown,unknown) ).
tff(f_31,axiom,
multiply(identity,a2) != a2,
file(unknown,unknown) ).
tff(c_8,plain,
! [A_7] : ( divide(A_7,A_7) = identity ),
inference(cnfTransformation,[status(thm)],[f_29]) ).
tff(c_6,plain,
! [A_6] : ( divide(identity,A_6) = inverse(A_6) ),
inference(cnfTransformation,[status(thm)],[f_27]) ).
tff(c_2,plain,
! [A_1,B_2,C_3] : ( divide(A_1,divide(divide(divide(identity,B_2),C_3),divide(divide(divide(A_1,A_1),A_1),C_3))) = B_2 ),
inference(cnfTransformation,[status(thm)],[f_23]) ).
tff(c_183,plain,
! [A_17,B_18,C_19] : ( divide(A_17,divide(divide(inverse(B_18),C_19),divide(inverse(A_17),C_19))) = B_18 ),
inference(demodulation,[status(thm),theory(equality)],[c_6,c_6,c_8,c_2]) ).
tff(c_245,plain,
! [B_18] : ( divide(B_18,identity) = B_18 ),
inference(superposition,[status(thm),theory(equality)],[c_8,c_183]) ).
tff(c_20,plain,
! [A_9] : ( divide(identity,A_9) = inverse(A_9) ),
inference(cnfTransformation,[status(thm)],[f_27]) ).
tff(c_27,plain,
inverse(identity) = identity,
inference(superposition,[status(thm),theory(equality)],[c_20,c_8]) ).
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_25]) ).
tff(c_42,plain,
! [A_10,B_11] : ( divide(A_10,inverse(B_11)) = multiply(A_10,B_11) ),
inference(demodulation,[status(thm),theory(equality)],[c_6,c_4]) ).
tff(c_59,plain,
! [A_10] : ( multiply(A_10,identity) = divide(A_10,identity) ),
inference(superposition,[status(thm),theory(equality)],[c_27,c_42]) ).
tff(c_260,plain,
! [A_10] : ( multiply(A_10,identity) = A_10 ),
inference(demodulation,[status(thm),theory(equality)],[c_245,c_59]) ).
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_237,plain,
! [A_17,B_18] : ( divide(A_17,divide(identity,divide(inverse(A_17),inverse(B_18)))) = B_18 ),
inference(superposition,[status(thm),theory(equality)],[c_8,c_183]) ).
tff(c_325,plain,
! [A_22,B_23] : ( multiply(A_22,multiply(inverse(A_22),B_23)) = B_23 ),
inference(demodulation,[status(thm),theory(equality)],[c_11,c_11,c_6,c_237]) ).
tff(c_396,plain,
! [A_25] : ( multiply(A_25,inverse(A_25)) = identity ),
inference(superposition,[status(thm),theory(equality)],[c_260,c_325]) ).
tff(c_258,plain,
! [A_17,B_18] : ( multiply(A_17,multiply(inverse(A_17),B_18)) = B_18 ),
inference(demodulation,[status(thm),theory(equality)],[c_11,c_11,c_6,c_237]) ).
tff(c_406,plain,
! [A_17] : ( inverse(inverse(A_17)) = multiply(A_17,identity) ),
inference(superposition,[status(thm),theory(equality)],[c_396,c_258]) ).
tff(c_429,plain,
! [A_17] : ( inverse(inverse(A_17)) = A_17 ),
inference(demodulation,[status(thm),theory(equality)],[c_260,c_406]) ).
tff(c_63,plain,
! [B_11] : ( inverse(inverse(B_11)) = multiply(identity,B_11) ),
inference(superposition,[status(thm),theory(equality)],[c_6,c_42]) ).
tff(c_435,plain,
! [B_11] : ( multiply(identity,B_11) = B_11 ),
inference(demodulation,[status(thm),theory(equality)],[c_429,c_63]) ).
tff(c_10,plain,
multiply(identity,a2) != a2,
inference(cnfTransformation,[status(thm)],[f_31]) ).
tff(c_491,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_435,c_10]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : GRP461-1 : TPTP v8.1.2. Released v2.6.0.
% 0.00/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 : n004.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 : Thu Aug 3 21:52:56 EDT 2023
% 0.13/0.35 % CPUTime :
% 2.98/1.79 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.98/1.79
% 2.98/1.79 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 2.98/1.82
% 2.98/1.82 Inference rules
% 2.98/1.82 ----------------------
% 2.98/1.82 #Ref : 0
% 2.98/1.82 #Sup : 113
% 2.98/1.82 #Fact : 0
% 2.98/1.82 #Define : 0
% 2.98/1.82 #Split : 0
% 2.98/1.82 #Chain : 0
% 2.98/1.82 #Close : 0
% 2.98/1.82
% 2.98/1.82 Ordering : KBO
% 2.98/1.82
% 2.98/1.82 Simplification rules
% 2.98/1.82 ----------------------
% 2.98/1.82 #Subsume : 0
% 2.98/1.82 #Demod : 93
% 2.98/1.82 #Tautology : 76
% 2.98/1.82 #SimpNegUnit : 0
% 2.98/1.82 #BackRed : 4
% 2.98/1.82
% 2.98/1.82 #Partial instantiations: 0
% 2.98/1.82 #Strategies tried : 1
% 2.98/1.82
% 2.98/1.82 Timing (in seconds)
% 2.98/1.82 ----------------------
% 2.98/1.82 Preprocessing : 0.41
% 2.98/1.82 Parsing : 0.21
% 2.98/1.82 CNF conversion : 0.02
% 2.98/1.82 Main loop : 0.33
% 2.98/1.82 Inferencing : 0.13
% 2.98/1.82 Reduction : 0.12
% 2.98/1.82 Demodulation : 0.09
% 2.98/1.82 BG Simplification : 0.02
% 2.98/1.82 Subsumption : 0.05
% 2.98/1.82 Abstraction : 0.02
% 2.98/1.82 MUC search : 0.00
% 2.98/1.82 Cooper : 0.00
% 2.98/1.82 Total : 0.79
% 2.98/1.82 Index Insertion : 0.00
% 2.98/1.82 Index Deletion : 0.00
% 2.98/1.82 Index Matching : 0.00
% 2.98/1.82 BG Taut test : 0.00
%------------------------------------------------------------------------------