TSTP Solution File: GRP003-2 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : GRP003-2 : 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 : 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:39:35 EDT 2023
% Result : Unsatisfiable 4.64s 2.33s
% Output : CNFRefutation 4.98s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 13
% Syntax : Number of formulae : 33 ( 11 unt; 6 typ; 0 def)
% Number of atoms : 57 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 62 ( 32 ~; 30 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 8 ( 4 >; 4 *; 0 +; 0 <<)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 67 (; 67 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ product > equalish > multiply > #nlpp > inverse > identity > 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(identity,type,
identity: $i ).
tff(equalish,type,
equalish: ( $i * $i ) > $o ).
tff(f_51,axiom,
! [X] : product(identity,X,X),
file(unknown,unknown) ).
tff(f_65,axiom,
! [X,Y,Z,W] :
( ~ product(X,Y,Z)
| ~ product(X,Y,W)
| equalish(Z,W) ),
file(unknown,unknown) ).
tff(f_53,axiom,
! [X] : product(inverse(X),X,identity),
file(unknown,unknown) ).
tff(f_95,axiom,
! [X,Y,W,Z] :
( ~ equalish(X,Y)
| ~ product(W,Z,X)
| product(W,Z,Y) ),
file(unknown,unknown) ).
tff(f_76,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_87,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_99,axiom,
~ product(a,identity,a),
file(unknown,unknown) ).
tff(c_2,plain,
! [X_1] : product(identity,X_1,X_1),
inference(cnfTransformation,[status(thm)],[f_51]) ).
tff(c_20,plain,
! [Z_29,W_30,X_31,Y_32] :
( equalish(Z_29,W_30)
| ~ product(X_31,Y_32,W_30)
| ~ product(X_31,Y_32,Z_29) ),
inference(cnfTransformation,[status(thm)],[f_65]) ).
tff(c_40,plain,
! [Z_37,X_38] :
( equalish(Z_37,X_38)
| ~ product(identity,X_38,Z_37) ),
inference(resolution,[status(thm)],[c_2,c_20]) ).
tff(c_49,plain,
! [X_1] : equalish(X_1,X_1),
inference(resolution,[status(thm)],[c_2,c_40]) ).
tff(c_4,plain,
! [X_2] : product(inverse(X_2),X_2,identity),
inference(cnfTransformation,[status(thm)],[f_53]) ).
tff(c_30,plain,
! [W_33,Z_34,Y_35,X_36] :
( product(W_33,Z_34,Y_35)
| ~ product(W_33,Z_34,X_36)
| ~ equalish(X_36,Y_35) ),
inference(cnfTransformation,[status(thm)],[f_95]) ).
tff(c_38,plain,
! [X_2,Y_35] :
( product(inverse(X_2),X_2,Y_35)
| ~ equalish(identity,Y_35) ),
inference(resolution,[status(thm)],[c_4,c_30]) ).
tff(c_52,plain,
! [U_45,Y_43,Z_46,X_42,W_41,V_44] :
( product(X_42,V_44,W_41)
| ~ product(U_45,Z_46,W_41)
| ~ product(Y_43,Z_46,V_44)
| ~ product(X_42,Y_43,U_45) ),
inference(cnfTransformation,[status(thm)],[f_76]) ).
tff(c_237,plain,
! [X_76,V_77,X_78,Y_79] :
( product(X_76,V_77,X_78)
| ~ product(Y_79,X_78,V_77)
| ~ product(X_76,Y_79,identity) ),
inference(resolution,[status(thm)],[c_2,c_52]) ).
tff(c_512,plain,
! [X_99,X_100] :
( product(X_99,identity,X_100)
| ~ product(X_99,inverse(X_100),identity) ),
inference(resolution,[status(thm)],[c_4,c_237]) ).
tff(c_520,plain,
! [X_100] :
( product(inverse(inverse(X_100)),identity,X_100)
| ~ equalish(identity,identity) ),
inference(resolution,[status(thm)],[c_38,c_512]) ).
tff(c_532,plain,
! [X_100] : product(inverse(inverse(X_100)),identity,X_100),
inference(demodulation,[status(thm),theory(equality)],[c_49,c_520]) ).
tff(c_114,plain,
! [V_60,X_58,Z_57,Y_61,W_56,U_59] :
( product(U_59,Z_57,W_56)
| ~ product(X_58,V_60,W_56)
| ~ product(Y_61,Z_57,V_60)
| ~ product(X_58,Y_61,U_59) ),
inference(cnfTransformation,[status(thm)],[f_87]) ).
tff(c_836,plain,
! [U_115,Z_116,Y_117,X_118] :
( product(U_115,Z_116,identity)
| ~ product(Y_117,Z_116,X_118)
| ~ product(inverse(X_118),Y_117,U_115) ),
inference(resolution,[status(thm)],[c_4,c_114]) ).
tff(c_1729,plain,
! [U_144,X_145] :
( product(U_144,X_145,identity)
| ~ product(inverse(X_145),identity,U_144) ),
inference(resolution,[status(thm)],[c_2,c_836]) ).
tff(c_1799,plain,
! [X_146] : product(X_146,inverse(X_146),identity),
inference(resolution,[status(thm)],[c_532,c_1729]) ).
tff(c_257,plain,
! [X_76,X_2] :
( product(X_76,identity,X_2)
| ~ product(X_76,inverse(X_2),identity) ),
inference(resolution,[status(thm)],[c_4,c_237]) ).
tff(c_1841,plain,
! [X_146] : product(X_146,identity,X_146),
inference(resolution,[status(thm)],[c_1799,c_257]) ).
tff(c_16,plain,
~ product(a,identity,a),
inference(cnfTransformation,[status(thm)],[f_99]) ).
tff(c_1854,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_1841,c_16]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : GRP003-2 : 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.12/0.34 % Computer : n004.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Thu Aug 3 22:15:26 EDT 2023
% 0.12/0.34 % CPUTime :
% 4.64/2.33 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 4.64/2.33
% 4.64/2.33 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 4.98/2.36
% 4.98/2.36 Inference rules
% 4.98/2.36 ----------------------
% 4.98/2.36 #Ref : 0
% 4.98/2.36 #Sup : 479
% 4.98/2.36 #Fact : 0
% 4.98/2.36 #Define : 0
% 4.98/2.36 #Split : 0
% 4.98/2.36 #Chain : 0
% 4.98/2.36 #Close : 0
% 4.98/2.36
% 4.98/2.36 Ordering : KBO
% 4.98/2.36
% 4.98/2.36 Simplification rules
% 4.98/2.36 ----------------------
% 4.98/2.36 #Subsume : 14
% 4.98/2.36 #Demod : 107
% 4.98/2.36 #Tautology : 88
% 4.98/2.36 #SimpNegUnit : 0
% 4.98/2.36 #BackRed : 1
% 4.98/2.36
% 4.98/2.36 #Partial instantiations: 0
% 4.98/2.36 #Strategies tried : 1
% 4.98/2.36
% 4.98/2.36 Timing (in seconds)
% 4.98/2.36 ----------------------
% 4.98/2.36 Preprocessing : 0.43
% 4.98/2.36 Parsing : 0.24
% 4.98/2.36 CNF conversion : 0.02
% 4.98/2.37 Main loop : 0.73
% 4.98/2.37 Inferencing : 0.26
% 4.98/2.37 Reduction : 0.21
% 4.98/2.37 Demodulation : 0.16
% 4.98/2.37 BG Simplification : 0.03
% 4.98/2.37 Subsumption : 0.18
% 4.98/2.37 Abstraction : 0.03
% 4.98/2.37 MUC search : 0.00
% 4.98/2.37 Cooper : 0.00
% 4.98/2.37 Total : 1.21
% 4.98/2.37 Index Insertion : 0.00
% 4.98/2.37 Index Deletion : 0.00
% 4.98/2.37 Index Matching : 0.00
% 4.98/2.37 BG Taut test : 0.00
%------------------------------------------------------------------------------