TSTP Solution File: GRP031-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : GRP031-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 : n031.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:40 EDT 2023
% Result : Unsatisfiable 3.17s 1.96s
% Output : CNFRefutation 3.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 10
% Syntax : Number of formulae : 28 ( 13 unt; 5 typ; 0 def)
% Number of atoms : 41 ( 4 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 38 ( 20 ~; 18 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 4 avg)
% Maximal term depth : 5 ( 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 : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 48 (; 48 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ product > 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(f_95,axiom,
! [A] : product(inverse(A),A,identity),
file(unknown,unknown) ).
tff(f_93,axiom,
! [A] : product(identity,A,A),
file(unknown,unknown) ).
tff(f_78,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_67,axiom,
! [X,Y,Z,W] :
( ~ product(X,Y,Z)
| ~ product(X,Y,W)
| ( Z = W ) ),
file(unknown,unknown) ).
tff(f_98,axiom,
! [A] : ~ product(a,A,identity),
file(unknown,unknown) ).
tff(c_12,plain,
! [A_20] : product(inverse(A_20),A_20,identity),
inference(cnfTransformation,[status(thm)],[f_95]) ).
tff(c_10,plain,
! [A_19] : product(identity,A_19,A_19),
inference(cnfTransformation,[status(thm)],[f_93]) ).
tff(c_29,plain,
! [Y_36,W_32,Z_31,U_33,V_34,X_35] :
( product(X_35,V_34,W_32)
| ~ product(U_33,Z_31,W_32)
| ~ product(Y_36,Z_31,V_34)
| ~ product(X_35,Y_36,U_33) ),
inference(cnfTransformation,[status(thm)],[f_78]) ).
tff(c_145,plain,
! [X_60,V_61,A_62,Y_63] :
( product(X_60,V_61,A_62)
| ~ product(Y_63,A_62,V_61)
| ~ product(X_60,Y_63,identity) ),
inference(resolution,[status(thm)],[c_10,c_29]) ).
tff(c_237,plain,
! [X_70,A_71] :
( product(X_70,identity,A_71)
| ~ product(X_70,inverse(A_71),identity) ),
inference(resolution,[status(thm)],[c_12,c_145]) ).
tff(c_242,plain,
! [A_71] : product(inverse(inverse(A_71)),identity,A_71),
inference(resolution,[status(thm)],[c_12,c_237]) ).
tff(c_346,plain,
! [X_75,V_76,Y_77,A_78] :
( product(X_75,V_76,identity)
| ~ product(Y_77,A_78,V_76)
| ~ product(X_75,Y_77,inverse(A_78)) ),
inference(resolution,[status(thm)],[c_12,c_29]) ).
tff(c_378,plain,
! [X_81,A_82] :
( product(X_81,A_82,identity)
| ~ product(X_81,identity,inverse(A_82)) ),
inference(resolution,[status(thm)],[c_10,c_346]) ).
tff(c_387,plain,
! [A_83] : product(inverse(inverse(inverse(A_83))),A_83,identity),
inference(resolution,[status(thm)],[c_242,c_378]) ).
tff(c_153,plain,
! [X_60,A_20] :
( product(X_60,identity,A_20)
| ~ product(X_60,inverse(A_20),identity) ),
inference(resolution,[status(thm)],[c_12,c_145]) ).
tff(c_455,plain,
! [A_85] : product(inverse(inverse(inverse(inverse(A_85)))),identity,A_85),
inference(resolution,[status(thm)],[c_387,c_153]) ).
tff(c_243,plain,
! [A_72] : product(inverse(inverse(A_72)),identity,A_72),
inference(resolution,[status(thm)],[c_12,c_237]) ).
tff(c_4,plain,
! [Z_5,W_6,X_3,Y_4] :
( ( Z_5 = W_6 )
| ~ product(X_3,Y_4,W_6)
| ~ product(X_3,Y_4,Z_5) ),
inference(cnfTransformation,[status(thm)],[f_67]) ).
tff(c_266,plain,
! [Z_5,A_72] :
( ( Z_5 = A_72 )
| ~ product(inverse(inverse(A_72)),identity,Z_5) ),
inference(resolution,[status(thm)],[c_243,c_4]) ).
tff(c_505,plain,
! [A_86] : ( inverse(inverse(A_86)) = A_86 ),
inference(resolution,[status(thm)],[c_455,c_266]) ).
tff(c_645,plain,
! [A_93] : product(A_93,inverse(A_93),identity),
inference(superposition,[status(thm),theory(equality)],[c_505,c_12]) ).
tff(c_14,plain,
! [A_21] : ~ product(a,A_21,identity),
inference(cnfTransformation,[status(thm)],[f_98]) ).
tff(c_700,plain,
$false,
inference(resolution,[status(thm)],[c_645,c_14]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13 % Problem : GRP031-1 : TPTP v8.1.2. Released v1.0.0.
% 0.12/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.36 % Computer : n031.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Thu Aug 3 22:42:30 EDT 2023
% 0.14/0.36 % CPUTime :
% 3.17/1.96 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.17/1.97
% 3.17/1.97 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.17/2.01
% 3.17/2.01 Inference rules
% 3.17/2.01 ----------------------
% 3.17/2.01 #Ref : 0
% 3.17/2.01 #Sup : 163
% 3.17/2.01 #Fact : 0
% 3.17/2.01 #Define : 0
% 3.17/2.01 #Split : 0
% 3.17/2.01 #Chain : 0
% 3.17/2.01 #Close : 0
% 3.17/2.01
% 3.17/2.01 Ordering : KBO
% 3.17/2.01
% 3.17/2.01 Simplification rules
% 3.17/2.01 ----------------------
% 3.17/2.01 #Subsume : 8
% 3.17/2.01 #Demod : 81
% 3.17/2.01 #Tautology : 79
% 3.17/2.01 #SimpNegUnit : 0
% 3.17/2.01 #BackRed : 10
% 3.17/2.01
% 3.17/2.01 #Partial instantiations: 0
% 3.17/2.01 #Strategies tried : 1
% 3.17/2.01
% 3.17/2.01 Timing (in seconds)
% 3.17/2.01 ----------------------
% 3.17/2.02 Preprocessing : 0.42
% 3.17/2.02 Parsing : 0.22
% 3.17/2.02 CNF conversion : 0.02
% 3.17/2.02 Main loop : 0.46
% 3.17/2.02 Inferencing : 0.18
% 3.17/2.02 Reduction : 0.12
% 3.17/2.02 Demodulation : 0.09
% 3.17/2.02 BG Simplification : 0.02
% 3.17/2.02 Subsumption : 0.10
% 3.17/2.02 Abstraction : 0.02
% 3.17/2.02 MUC search : 0.00
% 3.17/2.02 Cooper : 0.00
% 3.17/2.02 Total : 0.94
% 3.17/2.02 Index Insertion : 0.00
% 3.17/2.02 Index Deletion : 0.00
% 3.17/2.02 Index Matching : 0.00
% 3.17/2.02 BG Taut test : 0.00
%------------------------------------------------------------------------------