TSTP Solution File: GRP009-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : GRP009-1 : TPTP v8.1.2. Released v1.0.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 : n021.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:39:36 EDT 2023
% Result : Unsatisfiable 4.76s 2.22s
% Output : CNFRefutation 5.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 16
% Syntax : Number of formulae : 45 ( 23 unt; 7 typ; 0 def)
% Number of atoms : 60 ( 18 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 46 ( 24 ~; 22 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 6 ( 3 >; 3 *; 0 +; 0 <<)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-3 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 52 (; 52 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ product > multiply > #nlpp > inverse > identity > c > b > a
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(a,type,
a: $i ).
tff(product,type,
product: ( $i * $i * $i ) > $o ).
tff(inverse,type,
inverse: $i > $i ).
tff(multiply,type,
multiply: ( $i * $i ) > $i ).
tff(b,type,
b: $i ).
tff(identity,type,
identity: $i ).
tff(c,type,
c: $i ).
tff(f_98,axiom,
a != c,
file(unknown,unknown) ).
tff(f_56,axiom,
! [X] : product(inverse(X),X,identity),
file(unknown,unknown) ).
tff(f_61,axiom,
! [X,Y] : product(X,Y,multiply(X,Y)),
file(unknown,unknown) ).
tff(f_54,axiom,
! [X] : product(X,identity,X),
file(unknown,unknown) ).
tff(f_70,axiom,
! [X,Y,Z,W] :
( ~ product(X,Y,Z)
| ~ product(X,Y,W)
| ( Z = W ) ),
file(unknown,unknown) ).
tff(f_95,axiom,
product(a,b,identity),
file(unknown,unknown) ).
tff(f_52,axiom,
! [X] : product(identity,X,X),
file(unknown,unknown) ).
tff(f_81,axiom,
! [W,U,Z,X,Y,V] :
( ~ product(X,Y,U)
| ~ product(Y,Z,V)
| ~ product(U,Z,W)
| product(X,V,W) ),
file(unknown,unknown) ).
tff(f_96,axiom,
product(c,b,identity),
file(unknown,unknown) ).
tff(c_22,plain,
c != a,
inference(cnfTransformation,[status(thm)],[f_98]) ).
tff(c_6,plain,
! [X_3] : product(inverse(X_3),X_3,identity),
inference(cnfTransformation,[status(thm)],[f_56]) ).
tff(c_10,plain,
! [X_5,Y_6] : product(X_5,Y_6,multiply(X_5,Y_6)),
inference(cnfTransformation,[status(thm)],[f_61]) ).
tff(c_4,plain,
! [X_2] : product(X_2,identity,X_2),
inference(cnfTransformation,[status(thm)],[f_54]) ).
tff(c_28,plain,
! [Z_29,W_30,X_31,Y_32] :
( ( Z_29 = W_30 )
| ~ product(X_31,Y_32,W_30)
| ~ product(X_31,Y_32,Z_29) ),
inference(cnfTransformation,[status(thm)],[f_70]) ).
tff(c_160,plain,
! [Z_49,X_50] :
( ( Z_49 = X_50 )
| ~ product(X_50,identity,Z_49) ),
inference(resolution,[status(thm)],[c_4,c_28]) ).
tff(c_176,plain,
! [X_5] : ( multiply(X_5,identity) = X_5 ),
inference(resolution,[status(thm)],[c_10,c_160]) ).
tff(c_18,plain,
product(a,b,identity),
inference(cnfTransformation,[status(thm)],[f_95]) ).
tff(c_2,plain,
! [X_1] : product(identity,X_1,X_1),
inference(cnfTransformation,[status(thm)],[f_52]) ).
tff(c_138,plain,
! [U_45,W_43,Z_47,Y_44,X_46,V_48] :
( product(X_46,V_48,W_43)
| ~ product(U_45,Z_47,W_43)
| ~ product(Y_44,Z_47,V_48)
| ~ product(X_46,Y_44,U_45) ),
inference(cnfTransformation,[status(thm)],[f_81]) ).
tff(c_483,plain,
! [X_74,V_75,X_76,Y_77] :
( product(X_74,V_75,X_76)
| ~ product(Y_77,X_76,V_75)
| ~ product(X_74,Y_77,identity) ),
inference(resolution,[status(thm)],[c_2,c_138]) ).
tff(c_518,plain,
! [X_79] :
( product(X_79,identity,b)
| ~ product(X_79,a,identity) ),
inference(resolution,[status(thm)],[c_18,c_483]) ).
tff(c_43,plain,
! [X_5,Y_6,Z_29] :
( ( multiply(X_5,Y_6) = Z_29 )
| ~ product(X_5,Y_6,Z_29) ),
inference(resolution,[status(thm)],[c_10,c_28]) ).
tff(c_528,plain,
! [X_79] :
( ( multiply(X_79,identity) = b )
| ~ product(X_79,a,identity) ),
inference(resolution,[status(thm)],[c_518,c_43]) ).
tff(c_558,plain,
! [X_80] :
( ( b = X_80 )
| ~ product(X_80,a,identity) ),
inference(demodulation,[status(thm),theory(equality)],[c_176,c_528]) ).
tff(c_563,plain,
inverse(a) = b,
inference(resolution,[status(thm)],[c_6,c_558]) ).
tff(c_1650,plain,
! [X_163,X_164] :
( product(X_163,identity,X_164)
| ~ product(X_163,inverse(X_164),identity) ),
inference(resolution,[status(thm)],[c_6,c_483]) ).
tff(c_1670,plain,
! [X_165] : product(inverse(inverse(X_165)),identity,X_165),
inference(resolution,[status(thm)],[c_6,c_1650]) ).
tff(c_47,plain,
! [Z_29,X_2] :
( ( Z_29 = X_2 )
| ~ product(X_2,identity,Z_29) ),
inference(resolution,[status(thm)],[c_4,c_28]) ).
tff(c_1758,plain,
! [X_166] : ( inverse(inverse(X_166)) = X_166 ),
inference(resolution,[status(thm)],[c_1670,c_47]) ).
tff(c_1801,plain,
inverse(b) = a,
inference(superposition,[status(thm),theory(equality)],[c_563,c_1758]) ).
tff(c_20,plain,
product(c,b,identity),
inference(cnfTransformation,[status(thm)],[f_96]) ).
tff(c_649,plain,
! [X_85] :
( product(X_85,identity,b)
| ~ product(X_85,c,identity) ),
inference(resolution,[status(thm)],[c_20,c_483]) ).
tff(c_659,plain,
! [X_85] :
( ( multiply(X_85,identity) = b )
| ~ product(X_85,c,identity) ),
inference(resolution,[status(thm)],[c_649,c_43]) ).
tff(c_689,plain,
! [X_86] :
( ( b = X_86 )
| ~ product(X_86,c,identity) ),
inference(demodulation,[status(thm),theory(equality)],[c_176,c_659]) ).
tff(c_694,plain,
inverse(c) = b,
inference(resolution,[status(thm)],[c_6,c_689]) ).
tff(c_1798,plain,
inverse(b) = c,
inference(superposition,[status(thm),theory(equality)],[c_694,c_1758]) ).
tff(c_1853,plain,
c = a,
inference(demodulation,[status(thm),theory(equality)],[c_1801,c_1798]) ).
tff(c_1855,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_22,c_1853]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : GRP009-1 : TPTP v8.1.2. Released v1.0.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.18/0.35 % Computer : n021.cluster.edu
% 0.18/0.35 % Model : x86_64 x86_64
% 0.18/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.35 % Memory : 8042.1875MB
% 0.18/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.18/0.35 % CPULimit : 300
% 0.18/0.35 % WCLimit : 300
% 0.18/0.35 % DateTime : Thu Aug 3 22:10:52 EDT 2023
% 0.18/0.35 % CPUTime :
% 4.76/2.22 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 4.76/2.23
% 4.76/2.23 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 5.17/2.26
% 5.17/2.26 Inference rules
% 5.17/2.26 ----------------------
% 5.17/2.26 #Ref : 0
% 5.17/2.26 #Sup : 449
% 5.17/2.26 #Fact : 0
% 5.17/2.26 #Define : 0
% 5.17/2.26 #Split : 13
% 5.17/2.26 #Chain : 0
% 5.17/2.26 #Close : 0
% 5.17/2.26
% 5.17/2.26 Ordering : KBO
% 5.17/2.26
% 5.17/2.26 Simplification rules
% 5.17/2.26 ----------------------
% 5.17/2.26 #Subsume : 60
% 5.17/2.26 #Demod : 185
% 5.17/2.26 #Tautology : 179
% 5.17/2.26 #SimpNegUnit : 1
% 5.17/2.26 #BackRed : 4
% 5.17/2.26
% 5.17/2.26 #Partial instantiations: 0
% 5.17/2.26 #Strategies tried : 1
% 5.17/2.26
% 5.17/2.26 Timing (in seconds)
% 5.17/2.26 ----------------------
% 5.17/2.26 Preprocessing : 0.43
% 5.17/2.26 Parsing : 0.23
% 5.17/2.26 CNF conversion : 0.02
% 5.17/2.26 Main loop : 0.78
% 5.17/2.26 Inferencing : 0.28
% 5.17/2.26 Reduction : 0.22
% 5.17/2.26 Demodulation : 0.15
% 5.17/2.26 BG Simplification : 0.03
% 5.17/2.26 Subsumption : 0.19
% 5.17/2.26 Abstraction : 0.03
% 5.17/2.26 MUC search : 0.00
% 5.17/2.26 Cooper : 0.00
% 5.17/2.26 Total : 1.26
% 5.17/2.26 Index Insertion : 0.00
% 5.17/2.26 Index Deletion : 0.00
% 5.17/2.26 Index Matching : 0.00
% 5.17/2.26 BG Taut test : 0.00
%------------------------------------------------------------------------------