TSTP Solution File: GRP036-3 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : GRP036-3 : 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:41 EDT 2023
% Result : Unsatisfiable 3.13s 1.85s
% Output : CNFRefutation 3.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 14
% Syntax : Number of formulae : 27 ( 11 unt; 7 typ; 0 def)
% Number of atoms : 35 ( 6 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 34 ( 19 ~; 15 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 8 ( 5 >; 3 *; 0 +; 0 <<)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 24 (; 24 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ product > subgroup_member > multiply > #nlpp > inverse > another_inverse > identity > another_identity
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(another_inverse,type,
another_inverse: $i > $i ).
tff(product,type,
product: ( $i * $i * $i ) > $o ).
tff(inverse,type,
inverse: $i > $i ).
tff(multiply,type,
multiply: ( $i * $i ) > $i ).
tff(another_identity,type,
another_identity: $i ).
tff(identity,type,
identity: $i ).
tff(subgroup_member,type,
subgroup_member: $i > $o ).
tff(f_157,axiom,
identity != another_identity,
file(unknown,unknown) ).
tff(f_134,axiom,
! [A] :
( ~ subgroup_member(A)
| product(another_identity,A,A) ),
file(unknown,unknown) ).
tff(f_53,axiom,
! [X] : product(X,identity,X),
file(unknown,unknown) ).
tff(f_69,axiom,
! [X,Y,Z,W] :
( ~ product(X,Y,Z)
| ~ product(X,Y,W)
| ( Z = W ) ),
file(unknown,unknown) ).
tff(f_57,axiom,
! [X] : product(X,inverse(X),identity),
file(unknown,unknown) ).
tff(f_127,axiom,
! [A,B,C] :
( ~ subgroup_member(A)
| ~ subgroup_member(B)
| ~ product(A,inverse(B),C)
| subgroup_member(C) ),
file(unknown,unknown) ).
tff(f_155,axiom,
subgroup_member(another_identity),
file(unknown,unknown) ).
tff(c_32,plain,
identity != another_identity,
inference(cnfTransformation,[status(thm)],[f_157]) ).
tff(c_20,plain,
! [A_26] :
( product(another_identity,A_26,A_26)
| ~ subgroup_member(A_26) ),
inference(cnfTransformation,[status(thm)],[f_134]) ).
tff(c_4,plain,
! [X_2] : product(X_2,identity,X_2),
inference(cnfTransformation,[status(thm)],[f_53]) ).
tff(c_43,plain,
! [Z_42,W_43,X_44,Y_45] :
( ( Z_42 = W_43 )
| ~ product(X_44,Y_45,W_43)
| ~ product(X_44,Y_45,Z_42) ),
inference(cnfTransformation,[status(thm)],[f_69]) ).
tff(c_71,plain,
! [Z_46,X_47] :
( ( Z_46 = X_47 )
| ~ product(X_47,identity,Z_46) ),
inference(resolution,[status(thm)],[c_4,c_43]) ).
tff(c_83,plain,
( ( identity = another_identity )
| ~ subgroup_member(identity) ),
inference(resolution,[status(thm)],[c_20,c_71]) ).
tff(c_99,plain,
~ subgroup_member(identity),
inference(negUnitSimplification,[status(thm)],[c_32,c_83]) ).
tff(c_8,plain,
! [X_4] : product(X_4,inverse(X_4),identity),
inference(cnfTransformation,[status(thm)],[f_57]) ).
tff(c_105,plain,
! [C_48,A_49,B_50] :
( subgroup_member(C_48)
| ~ product(A_49,inverse(B_50),C_48)
| ~ subgroup_member(B_50)
| ~ subgroup_member(A_49) ),
inference(cnfTransformation,[status(thm)],[f_127]) ).
tff(c_120,plain,
! [X_4] :
( subgroup_member(identity)
| ~ subgroup_member(X_4) ),
inference(resolution,[status(thm)],[c_8,c_105]) ).
tff(c_137,plain,
! [X_4] : ~ subgroup_member(X_4),
inference(negUnitSimplification,[status(thm)],[c_99,c_120]) ).
tff(c_30,plain,
subgroup_member(another_identity),
inference(cnfTransformation,[status(thm)],[f_155]) ).
tff(c_145,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_137,c_30]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : GRP036-3 : 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.13/0.34 % Computer : n004.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Thu Aug 3 22:01:41 EDT 2023
% 0.13/0.34 % CPUTime :
% 3.13/1.85 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.13/1.85
% 3.13/1.85 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.13/1.88
% 3.13/1.88 Inference rules
% 3.13/1.88 ----------------------
% 3.13/1.88 #Ref : 0
% 3.13/1.88 #Sup : 21
% 3.13/1.88 #Fact : 0
% 3.13/1.88 #Define : 0
% 3.13/1.88 #Split : 0
% 3.13/1.88 #Chain : 0
% 3.13/1.88 #Close : 0
% 3.13/1.88
% 3.13/1.88 Ordering : KBO
% 3.13/1.88
% 3.13/1.88 Simplification rules
% 3.13/1.88 ----------------------
% 3.13/1.89 #Subsume : 8
% 3.13/1.89 #Demod : 2
% 3.13/1.89 #Tautology : 4
% 3.13/1.89 #SimpNegUnit : 6
% 3.13/1.89 #BackRed : 1
% 3.13/1.89
% 3.13/1.89 #Partial instantiations: 0
% 3.13/1.89 #Strategies tried : 1
% 3.13/1.89
% 3.13/1.89 Timing (in seconds)
% 3.13/1.89 ----------------------
% 3.13/1.89 Preprocessing : 0.49
% 3.13/1.89 Parsing : 0.25
% 3.13/1.89 CNF conversion : 0.03
% 3.13/1.89 Main loop : 0.26
% 3.13/1.89 Inferencing : 0.11
% 3.13/1.89 Reduction : 0.07
% 3.13/1.89 Demodulation : 0.05
% 3.13/1.89 BG Simplification : 0.02
% 3.13/1.89 Subsumption : 0.05
% 3.13/1.89 Abstraction : 0.01
% 3.13/1.89 MUC search : 0.00
% 3.13/1.89 Cooper : 0.00
% 3.13/1.89 Total : 0.80
% 3.13/1.89 Index Insertion : 0.00
% 3.13/1.89 Index Deletion : 0.00
% 3.13/1.89 Index Matching : 0.00
% 3.13/1.89 BG Taut test : 0.00
%------------------------------------------------------------------------------