TSTP Solution File: GRP034-3 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : GRP034-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/sandbox/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox/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:41 EDT 2023
% Result : Unsatisfiable 3.01s 1.78s
% Output : CNFRefutation 3.01s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 11
% Syntax : Number of formulae : 24 ( 13 unt; 6 typ; 0 def)
% Number of atoms : 28 ( 0 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 24 ( 14 ~; 10 |; 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 : 7 ( 4 >; 3 *; 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 : 14 (; 14 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ product > subgroup_member > 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(subgroup_member,type,
subgroup_member: $i > $o ).
tff(f_132,axiom,
subgroup_member(a),
file(unknown,unknown) ).
tff(f_59,axiom,
! [X] : product(X,inverse(X),identity),
file(unknown,unknown) ).
tff(f_129,axiom,
! [A,B,C] :
( ~ subgroup_member(A)
| ~ subgroup_member(B)
| ~ product(A,inverse(B),C)
| subgroup_member(C) ),
file(unknown,unknown) ).
tff(f_53,axiom,
! [X] : product(identity,X,X),
file(unknown,unknown) ).
tff(f_134,axiom,
~ subgroup_member(inverse(a)),
file(unknown,unknown) ).
tff(c_20,plain,
subgroup_member(a),
inference(cnfTransformation,[status(thm)],[f_132]) ).
tff(c_8,plain,
! [X_4] : product(X_4,inverse(X_4),identity),
inference(cnfTransformation,[status(thm)],[f_59]) ).
tff(c_66,plain,
! [C_38,A_39,B_40] :
( subgroup_member(C_38)
| ~ product(A_39,inverse(B_40),C_38)
| ~ subgroup_member(B_40)
| ~ subgroup_member(A_39) ),
inference(cnfTransformation,[status(thm)],[f_129]) ).
tff(c_83,plain,
! [X_4] :
( subgroup_member(identity)
| ~ subgroup_member(X_4) ),
inference(resolution,[status(thm)],[c_8,c_66]) ).
tff(c_101,plain,
! [X_4] : ~ subgroup_member(X_4),
inference(splitLeft,[status(thm)],[c_83]) ).
tff(c_104,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_101,c_20]) ).
tff(c_105,plain,
subgroup_member(identity),
inference(splitRight,[status(thm)],[c_83]) ).
tff(c_2,plain,
! [X_1] : product(identity,X_1,X_1),
inference(cnfTransformation,[status(thm)],[f_53]) ).
tff(c_85,plain,
! [B_40] :
( subgroup_member(inverse(B_40))
| ~ subgroup_member(B_40)
| ~ subgroup_member(identity) ),
inference(resolution,[status(thm)],[c_2,c_66]) ).
tff(c_183,plain,
! [B_51] :
( subgroup_member(inverse(B_51))
| ~ subgroup_member(B_51) ),
inference(demodulation,[status(thm),theory(equality)],[c_105,c_85]) ).
tff(c_22,plain,
~ subgroup_member(inverse(a)),
inference(cnfTransformation,[status(thm)],[f_134]) ).
tff(c_186,plain,
~ subgroup_member(a),
inference(resolution,[status(thm)],[c_183,c_22]) ).
tff(c_193,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_20,c_186]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : GRP034-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/sandbox/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s
% 0.13/0.35 % Computer : n017.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Thu Aug 3 21:42:21 EDT 2023
% 0.13/0.35 % CPUTime :
% 3.01/1.78 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.01/1.78
% 3.01/1.78 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 3.01/1.81
% 3.01/1.81 Inference rules
% 3.01/1.81 ----------------------
% 3.01/1.81 #Ref : 0
% 3.01/1.81 #Sup : 37
% 3.01/1.81 #Fact : 0
% 3.01/1.81 #Define : 0
% 3.01/1.82 #Split : 1
% 3.01/1.82 #Chain : 0
% 3.01/1.82 #Close : 0
% 3.01/1.82
% 3.01/1.82 Ordering : KBO
% 3.01/1.82
% 3.01/1.82 Simplification rules
% 3.01/1.82 ----------------------
% 3.01/1.82 #Subsume : 2
% 3.01/1.82 #Demod : 7
% 3.01/1.82 #Tautology : 17
% 3.01/1.82 #SimpNegUnit : 2
% 3.01/1.82 #BackRed : 1
% 3.01/1.82
% 3.01/1.82 #Partial instantiations: 0
% 3.01/1.82 #Strategies tried : 1
% 3.01/1.82
% 3.01/1.82 Timing (in seconds)
% 3.01/1.82 ----------------------
% 3.01/1.82 Preprocessing : 0.43
% 3.01/1.82 Parsing : 0.25
% 3.01/1.82 CNF conversion : 0.02
% 3.01/1.82 Main loop : 0.25
% 3.01/1.82 Inferencing : 0.10
% 3.01/1.82 Reduction : 0.06
% 3.01/1.82 Demodulation : 0.05
% 3.01/1.82 BG Simplification : 0.01
% 3.01/1.82 Subsumption : 0.05
% 3.01/1.82 Abstraction : 0.01
% 3.01/1.82 MUC search : 0.00
% 3.01/1.82 Cooper : 0.00
% 3.01/1.82 Total : 0.74
% 3.01/1.82 Index Insertion : 0.00
% 3.01/1.82 Index Deletion : 0.00
% 3.01/1.82 Index Matching : 0.00
% 3.01/1.82 BG Taut test : 0.00
%------------------------------------------------------------------------------