TSTP Solution File: GRP544-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : GRP544-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/sandbox/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s
% Computer : n025.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:29 EDT 2023
% Result : Unsatisfiable 3.31s 1.90s
% Output : CNFRefutation 3.38s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 11
% Syntax : Number of formulae : 39 ( 33 unt; 6 typ; 0 def)
% Number of atoms : 33 ( 32 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 2 ( 2 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 3 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 : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 51 (; 51 !; 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_28,axiom,
! [A] : ( inverse(A) = divide(identity,A) ),
file(unknown,unknown) ).
tff(f_26,axiom,
! [A,B] : ( multiply(A,B) = divide(A,divide(identity,B)) ),
file(unknown,unknown) ).
tff(f_30,axiom,
! [A] : ( identity = divide(A,A) ),
file(unknown,unknown) ).
tff(f_24,axiom,
! [A,B,C] : ( divide(divide(identity,divide(divide(divide(A,B),C),A)),C) = B ),
file(unknown,unknown) ).
tff(f_32,axiom,
multiply(a,b) != multiply(b,a),
file(unknown,unknown) ).
tff(c_6,plain,
! [A_6] : ( divide(identity,A_6) = inverse(A_6) ),
inference(cnfTransformation,[status(thm)],[f_28]) ).
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_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_63,plain,
! [B_11] : ( inverse(inverse(B_11)) = multiply(identity,B_11) ),
inference(superposition,[status(thm),theory(equality)],[c_6,c_42]) ).
tff(c_20,plain,
! [A_9] : ( divide(identity,A_9) = inverse(A_9) ),
inference(cnfTransformation,[status(thm)],[f_28]) ).
tff(c_8,plain,
! [A_7] : ( divide(A_7,A_7) = identity ),
inference(cnfTransformation,[status(thm)],[f_30]) ).
tff(c_27,plain,
inverse(identity) = identity,
inference(superposition,[status(thm),theory(equality)],[c_20,c_8]) ).
tff(c_70,plain,
! [B_12] : ( multiply(inverse(B_12),B_12) = identity ),
inference(superposition,[status(thm),theory(equality)],[c_42,c_8]) ).
tff(c_77,plain,
multiply(identity,identity) = identity,
inference(superposition,[status(thm),theory(equality)],[c_27,c_70]) ).
tff(c_2,plain,
! [A_1,B_2,C_3] : ( divide(divide(identity,divide(divide(divide(A_1,B_2),C_3),A_1)),C_3) = B_2 ),
inference(cnfTransformation,[status(thm)],[f_24]) ).
tff(c_183,plain,
! [A_17,B_18,C_19] : ( divide(inverse(divide(divide(divide(A_17,B_18),C_19),A_17)),C_19) = B_18 ),
inference(demodulation,[status(thm),theory(equality)],[c_6,c_2]) ).
tff(c_224,plain,
! [A_17,B_18] : ( divide(inverse(divide(identity,A_17)),divide(A_17,B_18)) = B_18 ),
inference(superposition,[status(thm),theory(equality)],[c_8,c_183]) ).
tff(c_305,plain,
! [A_23,B_24] : ( divide(multiply(identity,A_23),divide(A_23,B_24)) = B_24 ),
inference(demodulation,[status(thm),theory(equality)],[c_63,c_6,c_224]) ).
tff(c_345,plain,
! [A_6] : ( divide(multiply(identity,identity),inverse(A_6)) = A_6 ),
inference(superposition,[status(thm),theory(equality)],[c_6,c_305]) ).
tff(c_355,plain,
! [A_6] : ( multiply(identity,A_6) = A_6 ),
inference(demodulation,[status(thm),theory(equality)],[c_63,c_6,c_77,c_345]) ).
tff(c_419,plain,
! [B_11] : ( inverse(inverse(B_11)) = B_11 ),
inference(demodulation,[status(thm),theory(equality)],[c_355,c_63]) ).
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_232,plain,
! [A_17,B_18] : ( divide(multiply(identity,A_17),divide(A_17,B_18)) = B_18 ),
inference(demodulation,[status(thm),theory(equality)],[c_63,c_6,c_224]) ).
tff(c_656,plain,
! [A_35,B_36] : ( divide(A_35,divide(A_35,B_36)) = B_36 ),
inference(demodulation,[status(thm),theory(equality)],[c_355,c_232]) ).
tff(c_933,plain,
! [A_44,B_45] : ( divide(A_44,multiply(A_44,B_45)) = inverse(B_45) ),
inference(superposition,[status(thm),theory(equality)],[c_11,c_656]) ).
tff(c_214,plain,
! [A_17,B_18,B_5] : ( multiply(inverse(divide(divide(divide(A_17,B_18),inverse(B_5)),A_17)),B_5) = B_18 ),
inference(superposition,[status(thm),theory(equality)],[c_11,c_183]) ).
tff(c_567,plain,
! [A_31,B_32,B_33] : ( multiply(inverse(divide(multiply(divide(A_31,B_32),B_33),A_31)),B_33) = B_32 ),
inference(demodulation,[status(thm),theory(equality)],[c_11,c_214]) ).
tff(c_611,plain,
! [B_33,A_7] : ( multiply(inverse(divide(multiply(identity,B_33),A_7)),B_33) = A_7 ),
inference(superposition,[status(thm),theory(equality)],[c_8,c_567]) ).
tff(c_620,plain,
! [B_33,A_7] : ( multiply(inverse(divide(B_33,A_7)),B_33) = A_7 ),
inference(demodulation,[status(thm),theory(equality)],[c_355,c_611]) ).
tff(c_945,plain,
! [B_45,A_44] : ( multiply(inverse(inverse(B_45)),A_44) = multiply(A_44,B_45) ),
inference(superposition,[status(thm),theory(equality)],[c_933,c_620]) ).
tff(c_996,plain,
! [B_45,A_44] : ( multiply(B_45,A_44) = multiply(A_44,B_45) ),
inference(demodulation,[status(thm),theory(equality)],[c_419,c_945]) ).
tff(c_10,plain,
multiply(b,a) != multiply(a,b),
inference(cnfTransformation,[status(thm)],[f_32]) ).
tff(c_1008,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_996,c_10]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : GRP544-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/sandbox/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s
% 0.14/0.35 % Computer : n025.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:12:49 EDT 2023
% 0.20/0.35 % CPUTime :
% 3.31/1.90 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.36/1.91
% 3.36/1.91 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 3.38/1.94
% 3.38/1.94 Inference rules
% 3.38/1.94 ----------------------
% 3.38/1.94 #Ref : 0
% 3.38/1.94 #Sup : 245
% 3.38/1.94 #Fact : 0
% 3.38/1.94 #Define : 0
% 3.38/1.94 #Split : 0
% 3.38/1.94 #Chain : 0
% 3.38/1.94 #Close : 0
% 3.38/1.94
% 3.38/1.94 Ordering : KBO
% 3.38/1.94
% 3.38/1.94 Simplification rules
% 3.38/1.94 ----------------------
% 3.38/1.94 #Subsume : 0
% 3.38/1.94 #Demod : 168
% 3.38/1.94 #Tautology : 138
% 3.38/1.94 #SimpNegUnit : 0
% 3.38/1.94 #BackRed : 7
% 3.38/1.94
% 3.38/1.94 #Partial instantiations: 0
% 3.38/1.94 #Strategies tried : 1
% 3.38/1.94
% 3.38/1.94 Timing (in seconds)
% 3.38/1.94 ----------------------
% 3.38/1.94 Preprocessing : 0.41
% 3.38/1.94 Parsing : 0.22
% 3.38/1.94 CNF conversion : 0.02
% 3.38/1.94 Main loop : 0.43
% 3.38/1.94 Inferencing : 0.17
% 3.38/1.94 Reduction : 0.14
% 3.38/1.94 Demodulation : 0.10
% 3.38/1.94 BG Simplification : 0.02
% 3.38/1.94 Subsumption : 0.07
% 3.38/1.94 Abstraction : 0.03
% 3.38/1.94 MUC search : 0.00
% 3.38/1.94 Cooper : 0.00
% 3.38/1.94 Total : 0.89
% 3.38/1.94 Index Insertion : 0.00
% 3.38/1.94 Index Deletion : 0.00
% 3.38/1.94 Index Matching : 0.00
% 3.38/1.94 BG Taut test : 0.00
%------------------------------------------------------------------------------