TSTP Solution File: GRP032-3 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : GRP032-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 : n022.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 2.80s 1.75s
% Output : CNFRefutation 3.05s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 10
% Syntax : Number of formulae : 17 ( 8 unt; 6 typ; 0 def)
% Number of atoms : 18 ( 0 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 17 ( 10 ~; 7 |; 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 : 10 (; 10 !; 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(identity),
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_130,axiom,
subgroup_member(a),
file(unknown,unknown) ).
tff(c_22,plain,
~ subgroup_member(identity),
inference(cnfTransformation,[status(thm)],[f_132]) ).
tff(c_8,plain,
! [X_4] : product(X_4,inverse(X_4),identity),
inference(cnfTransformation,[status(thm)],[f_57]) ).
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_127]) ).
tff(c_73,plain,
! [X_4] :
( subgroup_member(identity)
| ~ subgroup_member(X_4) ),
inference(resolution,[status(thm)],[c_8,c_66]) ).
tff(c_85,plain,
! [X_4] : ~ subgroup_member(X_4),
inference(negUnitSimplification,[status(thm)],[c_22,c_73]) ).
tff(c_20,plain,
subgroup_member(a),
inference(cnfTransformation,[status(thm)],[f_130]) ).
tff(c_92,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_85,c_20]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : GRP032-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.14/0.35 % Computer : n022.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Thu Aug 3 22:11:33 EDT 2023
% 0.14/0.35 % CPUTime :
% 2.80/1.75 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.80/1.75
% 2.80/1.75 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 3.05/1.79
% 3.05/1.79 Inference rules
% 3.05/1.79 ----------------------
% 3.05/1.79 #Ref : 0
% 3.05/1.79 #Sup : 13
% 3.05/1.79 #Fact : 0
% 3.05/1.79 #Define : 0
% 3.05/1.79 #Split : 0
% 3.05/1.79 #Chain : 0
% 3.05/1.79 #Close : 0
% 3.05/1.79
% 3.05/1.79 Ordering : KBO
% 3.05/1.79
% 3.05/1.79 Simplification rules
% 3.05/1.79 ----------------------
% 3.05/1.79 #Subsume : 3
% 3.05/1.79 #Demod : 0
% 3.05/1.79 #Tautology : 2
% 3.05/1.79 #SimpNegUnit : 4
% 3.05/1.79 #BackRed : 1
% 3.05/1.79
% 3.05/1.79 #Partial instantiations: 0
% 3.05/1.79 #Strategies tried : 1
% 3.05/1.79
% 3.05/1.79 Timing (in seconds)
% 3.05/1.79 ----------------------
% 3.05/1.79 Preprocessing : 0.44
% 3.05/1.79 Parsing : 0.24
% 3.05/1.79 CNF conversion : 0.02
% 3.05/1.79 Main loop : 0.19
% 3.05/1.79 Inferencing : 0.07
% 3.05/1.79 Reduction : 0.05
% 3.05/1.79 Demodulation : 0.03
% 3.05/1.79 BG Simplification : 0.02
% 3.05/1.79 Subsumption : 0.04
% 3.05/1.79 Abstraction : 0.01
% 3.05/1.79 MUC search : 0.00
% 3.05/1.79 Cooper : 0.00
% 3.05/1.79 Total : 0.69
% 3.05/1.79 Index Insertion : 0.00
% 3.05/1.79 Index Deletion : 0.00
% 3.05/1.79 Index Matching : 0.00
% 3.05/1.79 BG Taut test : 0.00
%------------------------------------------------------------------------------