TSTP Solution File: GRP012-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : GRP012-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 : n017.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.47s 2.33s
% Output : CNFRefutation 4.84s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 18
% Syntax : Number of formulae : 53 ( 29 unt; 8 typ; 0 def)
% Number of atoms : 70 ( 12 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 52 ( 27 ~; 25 |; 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 : 7 ( 7 usr; 5 con; 0-2 aty)
% Number of variables : 66 (; 66 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ product > multiply > #nlpp > inverse > identity > d > 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(d,type,
d: $i ).
tff(identity,type,
identity: $i ).
tff(c,type,
c: $i ).
tff(f_100,axiom,
~ product(c,d,identity),
file(unknown,unknown) ).
tff(f_63,axiom,
! [X,Y] : product(X,Y,multiply(X,Y)),
file(unknown,unknown) ).
tff(f_97,axiom,
product(a,b,c),
file(unknown,unknown) ).
tff(f_72,axiom,
! [X,Y,Z,W] :
( ~ product(X,Y,Z)
| ~ product(X,Y,W)
| ( Z = W ) ),
file(unknown,unknown) ).
tff(f_54,axiom,
! [X] : product(identity,X,X),
file(unknown,unknown) ).
tff(f_58,axiom,
! [X] : product(inverse(X),X,identity),
file(unknown,unknown) ).
tff(f_56,axiom,
! [X] : product(X,identity,X),
file(unknown,unknown) ).
tff(f_94,axiom,
! [W,U,Z,X,Y,V] :
( ~ product(X,Y,U)
| ~ product(Y,Z,V)
| ~ product(X,V,W)
| product(U,Z,W) ),
file(unknown,unknown) ).
tff(f_98,axiom,
product(inverse(b),inverse(a),d),
file(unknown,unknown) ).
tff(f_60,axiom,
! [X] : product(X,inverse(X),identity),
file(unknown,unknown) ).
tff(c_22,plain,
~ product(c,d,identity),
inference(cnfTransformation,[status(thm)],[f_100]) ).
tff(c_10,plain,
! [X_5,Y_6] : product(X_5,Y_6,multiply(X_5,Y_6)),
inference(cnfTransformation,[status(thm)],[f_63]) ).
tff(c_18,plain,
product(a,b,c),
inference(cnfTransformation,[status(thm)],[f_97]) ).
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_72]) ).
tff(c_72,plain,
! [Z_39] :
( ( c = Z_39 )
| ~ product(a,b,Z_39) ),
inference(resolution,[status(thm)],[c_18,c_28]) ).
tff(c_80,plain,
multiply(a,b) = c,
inference(resolution,[status(thm)],[c_10,c_72]) ).
tff(c_2,plain,
! [X_1] : product(identity,X_1,X_1),
inference(cnfTransformation,[status(thm)],[f_54]) ).
tff(c_91,plain,
! [Z_40,X_41] :
( ( Z_40 = X_41 )
| ~ product(identity,X_41,Z_40) ),
inference(resolution,[status(thm)],[c_2,c_28]) ).
tff(c_107,plain,
! [Y_6] : ( multiply(identity,Y_6) = Y_6 ),
inference(resolution,[status(thm)],[c_10,c_91]) ).
tff(c_6,plain,
! [X_3] : product(inverse(X_3),X_3,identity),
inference(cnfTransformation,[status(thm)],[f_58]) ).
tff(c_4,plain,
! [X_2] : product(X_2,identity,X_2),
inference(cnfTransformation,[status(thm)],[f_56]) ).
tff(c_50,plain,
! [U_35,Y_33,V_36,X_34,W_37,Z_38] :
( product(U_35,Z_38,W_37)
| ~ product(X_34,V_36,W_37)
| ~ product(Y_33,Z_38,V_36)
| ~ product(X_34,Y_33,U_35) ),
inference(cnfTransformation,[status(thm)],[f_94]) ).
tff(c_351,plain,
! [U_62,Z_63,X_64,Y_65] :
( product(U_62,Z_63,X_64)
| ~ product(Y_65,Z_63,identity)
| ~ product(X_64,Y_65,U_62) ),
inference(resolution,[status(thm)],[c_4,c_50]) ).
tff(c_427,plain,
! [U_71,X_72,X_73] :
( product(U_71,X_72,X_73)
| ~ product(X_73,inverse(X_72),U_71) ),
inference(resolution,[status(thm)],[c_6,c_351]) ).
tff(c_504,plain,
! [X_76] : product(identity,X_76,inverse(inverse(X_76))),
inference(resolution,[status(thm)],[c_6,c_427]) ).
tff(c_44,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_514,plain,
! [X_76] : ( inverse(inverse(X_76)) = multiply(identity,X_76) ),
inference(resolution,[status(thm)],[c_504,c_44]) ).
tff(c_539,plain,
! [X_76] : ( inverse(inverse(X_76)) = X_76 ),
inference(demodulation,[status(thm),theory(equality)],[c_107,c_514]) ).
tff(c_20,plain,
product(inverse(b),inverse(a),d),
inference(cnfTransformation,[status(thm)],[f_98]) ).
tff(c_453,plain,
product(d,a,inverse(b)),
inference(resolution,[status(thm)],[c_20,c_427]) ).
tff(c_1747,plain,
! [U_139,Z_140,Y_141,X_142] :
( product(U_139,Z_140,identity)
| ~ product(Y_141,Z_140,X_142)
| ~ product(inverse(X_142),Y_141,U_139) ),
inference(resolution,[status(thm)],[c_6,c_50]) ).
tff(c_1763,plain,
! [U_139] :
( product(U_139,a,identity)
| ~ product(inverse(inverse(b)),d,U_139) ),
inference(resolution,[status(thm)],[c_453,c_1747]) ).
tff(c_2038,plain,
! [U_152] :
( product(U_152,a,identity)
| ~ product(b,d,U_152) ),
inference(demodulation,[status(thm),theory(equality)],[c_539,c_1763]) ).
tff(c_2042,plain,
product(multiply(b,d),a,identity),
inference(resolution,[status(thm)],[c_10,c_2038]) ).
tff(c_8,plain,
! [X_4] : product(X_4,inverse(X_4),identity),
inference(cnfTransformation,[status(thm)],[f_60]) ).
tff(c_386,plain,
! [U_68,X_69,X_70] :
( product(U_68,inverse(X_69),X_70)
| ~ product(X_70,X_69,U_68) ),
inference(resolution,[status(thm)],[c_8,c_351]) ).
tff(c_419,plain,
! [U_68,X_69,X_70] :
( ( multiply(U_68,inverse(X_69)) = X_70 )
| ~ product(X_70,X_69,U_68) ),
inference(resolution,[status(thm)],[c_386,c_44]) ).
tff(c_2051,plain,
multiply(identity,inverse(a)) = multiply(b,d),
inference(resolution,[status(thm)],[c_2042,c_419]) ).
tff(c_2073,plain,
multiply(b,d) = inverse(a),
inference(demodulation,[status(thm),theory(equality)],[c_107,c_2051]) ).
tff(c_2095,plain,
product(b,d,inverse(a)),
inference(superposition,[status(thm),theory(equality)],[c_2073,c_10]) ).
tff(c_67,plain,
! [U_35,Z_38,Y_33,X_4] :
( product(U_35,Z_38,identity)
| ~ product(Y_33,Z_38,inverse(X_4))
| ~ product(X_4,Y_33,U_35) ),
inference(resolution,[status(thm)],[c_8,c_50]) ).
tff(c_2416,plain,
! [U_167] :
( product(U_167,d,identity)
| ~ product(a,b,U_167) ),
inference(resolution,[status(thm)],[c_2095,c_67]) ).
tff(c_2419,plain,
product(multiply(a,b),d,identity),
inference(resolution,[status(thm)],[c_10,c_2416]) ).
tff(c_2423,plain,
product(c,d,identity),
inference(demodulation,[status(thm),theory(equality)],[c_80,c_2419]) ).
tff(c_2425,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_22,c_2423]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : GRP012-1 : TPTP v8.1.2. Released v1.0.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 : n017.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 21:45:07 EDT 2023
% 0.14/0.35 % CPUTime :
% 4.47/2.33 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 4.47/2.33
% 4.47/2.33 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 4.84/2.36
% 4.84/2.36 Inference rules
% 4.84/2.36 ----------------------
% 4.84/2.36 #Ref : 0
% 4.84/2.36 #Sup : 577
% 4.84/2.36 #Fact : 0
% 4.84/2.36 #Define : 0
% 4.84/2.36 #Split : 6
% 4.84/2.36 #Chain : 0
% 4.84/2.36 #Close : 0
% 4.84/2.36
% 4.84/2.36 Ordering : KBO
% 4.84/2.36
% 4.84/2.36 Simplification rules
% 4.84/2.36 ----------------------
% 4.84/2.36 #Subsume : 68
% 4.84/2.36 #Demod : 308
% 4.84/2.36 #Tautology : 270
% 4.84/2.36 #SimpNegUnit : 1
% 4.84/2.36 #BackRed : 2
% 4.84/2.36
% 4.84/2.36 #Partial instantiations: 0
% 4.84/2.36 #Strategies tried : 1
% 4.84/2.36
% 4.84/2.36 Timing (in seconds)
% 4.84/2.36 ----------------------
% 4.84/2.37 Preprocessing : 0.43
% 4.84/2.37 Parsing : 0.24
% 4.84/2.37 CNF conversion : 0.02
% 4.84/2.37 Main loop : 0.76
% 4.84/2.37 Inferencing : 0.29
% 4.84/2.37 Reduction : 0.22
% 4.84/2.37 Demodulation : 0.16
% 4.84/2.37 BG Simplification : 0.03
% 4.84/2.37 Subsumption : 0.17
% 4.84/2.37 Abstraction : 0.03
% 4.84/2.37 MUC search : 0.00
% 4.84/2.37 Cooper : 0.00
% 4.84/2.37 Total : 1.24
% 4.84/2.37 Index Insertion : 0.00
% 4.84/2.37 Index Deletion : 0.00
% 5.29/2.37 Index Matching : 0.00
% 5.29/2.37 BG Taut test : 0.00
%------------------------------------------------------------------------------