TSTP Solution File: GRP037-3 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : GRP037-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 : n012.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.47s 1.88s
% Output : CNFRefutation 3.47s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 16
% Syntax : Number of formulae : 32 ( 13 unt; 8 typ; 0 def)
% Number of atoms : 37 ( 11 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 28 ( 15 ~; 13 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 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 : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 23 (; 23 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ product > subgroup_member > multiply > #nlpp > inverse > another_inverse > identity > another_identity > a
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(another_inverse,type,
another_inverse: $i > $i ).
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(another_identity,type,
another_identity: $i ).
tff(identity,type,
identity: $i ).
tff(subgroup_member,type,
subgroup_member: $i > $o ).
tff(f_174,axiom,
inverse(a) != another_inverse(a),
file(unknown,unknown) ).
tff(f_171,axiom,
subgroup_member(a),
file(unknown,unknown) ).
tff(f_149,axiom,
! [A] :
( ~ subgroup_member(A)
| product(another_inverse(A),A,another_identity) ),
file(unknown,unknown) ).
tff(f_172,axiom,
subgroup_member(another_identity),
file(unknown,unknown) ).
tff(f_139,axiom,
! [A] :
( ~ subgroup_member(A)
| product(A,another_identity,A) ),
file(unknown,unknown) ).
tff(f_51,axiom,
! [X] : product(identity,X,X),
file(unknown,unknown) ).
tff(f_170,axiom,
! [A,B,C,D] :
( ~ product(A,B,C)
| ~ product(D,B,C)
| ( D = A ) ),
file(unknown,unknown) ).
tff(f_55,axiom,
! [X] : product(inverse(X),X,identity),
file(unknown,unknown) ).
tff(c_38,plain,
inverse(a) != another_inverse(a),
inference(cnfTransformation,[status(thm)],[f_174]) ).
tff(c_34,plain,
subgroup_member(a),
inference(cnfTransformation,[status(thm)],[f_171]) ).
tff(c_26,plain,
! [A_29] :
( product(another_inverse(A_29),A_29,another_identity)
| ~ subgroup_member(A_29) ),
inference(cnfTransformation,[status(thm)],[f_149]) ).
tff(c_36,plain,
subgroup_member(another_identity),
inference(cnfTransformation,[status(thm)],[f_172]) ).
tff(c_22,plain,
! [A_27] :
( product(A_27,another_identity,A_27)
| ~ subgroup_member(A_27) ),
inference(cnfTransformation,[status(thm)],[f_139]) ).
tff(c_2,plain,
! [X_1] : product(identity,X_1,X_1),
inference(cnfTransformation,[status(thm)],[f_51]) ).
tff(c_49,plain,
! [D_50,A_51,B_52,C_53] :
( ( D_50 = A_51 )
| ~ product(D_50,B_52,C_53)
| ~ product(A_51,B_52,C_53) ),
inference(cnfTransformation,[status(thm)],[f_170]) ).
tff(c_77,plain,
! [A_54,X_55] :
( ( identity = A_54 )
| ~ product(A_54,X_55,X_55) ),
inference(resolution,[status(thm)],[c_2,c_49]) ).
tff(c_85,plain,
( ( identity = another_identity )
| ~ subgroup_member(another_identity) ),
inference(resolution,[status(thm)],[c_22,c_77]) ).
tff(c_105,plain,
identity = another_identity,
inference(demodulation,[status(thm),theory(equality)],[c_36,c_85]) ).
tff(c_6,plain,
! [X_3] : product(inverse(X_3),X_3,identity),
inference(cnfTransformation,[status(thm)],[f_55]) ).
tff(c_74,plain,
! [X_3,A_51] :
( ( inverse(X_3) = A_51 )
| ~ product(A_51,X_3,identity) ),
inference(resolution,[status(thm)],[c_6,c_49]) ).
tff(c_536,plain,
! [X_97,A_98] :
( ( inverse(X_97) = A_98 )
| ~ product(A_98,X_97,another_identity) ),
inference(demodulation,[status(thm),theory(equality)],[c_105,c_74]) ).
tff(c_615,plain,
! [A_101] :
( ( inverse(A_101) = another_inverse(A_101) )
| ~ subgroup_member(A_101) ),
inference(resolution,[status(thm)],[c_26,c_536]) ).
tff(c_624,plain,
inverse(a) = another_inverse(a),
inference(resolution,[status(thm)],[c_34,c_615]) ).
tff(c_634,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_38,c_624]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : GRP037-3 : 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.36 % Computer : n012.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:22:52 EDT 2023
% 0.14/0.36 % CPUTime :
% 3.47/1.88 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.47/1.88
% 3.47/1.88 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.47/1.91
% 3.47/1.91 Inference rules
% 3.47/1.91 ----------------------
% 3.47/1.91 #Ref : 0
% 3.47/1.91 #Sup : 136
% 3.47/1.91 #Fact : 0
% 3.47/1.91 #Define : 0
% 3.47/1.91 #Split : 0
% 3.47/1.91 #Chain : 0
% 3.47/1.91 #Close : 0
% 3.47/1.91
% 3.47/1.91 Ordering : KBO
% 3.47/1.91
% 3.47/1.91 Simplification rules
% 3.47/1.91 ----------------------
% 3.47/1.91 #Subsume : 11
% 3.47/1.91 #Demod : 58
% 3.47/1.91 #Tautology : 62
% 3.47/1.91 #SimpNegUnit : 1
% 3.47/1.91 #BackRed : 5
% 3.47/1.91
% 3.47/1.91 #Partial instantiations: 0
% 3.47/1.91 #Strategies tried : 1
% 3.47/1.91
% 3.47/1.91 Timing (in seconds)
% 3.47/1.91 ----------------------
% 3.68/1.91 Preprocessing : 0.45
% 3.68/1.91 Parsing : 0.23
% 3.68/1.91 CNF conversion : 0.03
% 3.68/1.91 Main loop : 0.39
% 3.68/1.91 Inferencing : 0.15
% 3.68/1.91 Reduction : 0.11
% 3.68/1.91 Demodulation : 0.08
% 3.68/1.91 BG Simplification : 0.02
% 3.68/1.91 Subsumption : 0.08
% 3.68/1.91 Abstraction : 0.02
% 3.68/1.91 MUC search : 0.00
% 3.68/1.91 Cooper : 0.00
% 3.68/1.91 Total : 0.89
% 3.68/1.91 Index Insertion : 0.00
% 3.68/1.91 Index Deletion : 0.00
% 3.68/1.92 Index Matching : 0.00
% 3.68/1.92 BG Taut test : 0.00
%------------------------------------------------------------------------------