TSTP Solution File: GRP038-3 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : GRP038-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 : n013.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 2.82s 1.64s
% Output : CNFRefutation 2.82s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 13
% Syntax : Number of formulae : 21 ( 10 unt; 8 typ; 0 def)
% Number of atoms : 21 ( 0 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 18 ( 10 ~; 8 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 2 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 : 6 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 6 (; 6 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ product > subgroup_member > multiply > #nlpp > inverse > identity > c > b > 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(b,type,
b: $i ).
tff(identity,type,
identity: $i ).
tff(subgroup_member,type,
subgroup_member: $i > $o ).
tff(c,type,
c: $i ).
tff(f_142,axiom,
~ subgroup_member(c),
file(unknown,unknown) ).
tff(f_138,axiom,
subgroup_member(a),
file(unknown,unknown) ).
tff(f_139,axiom,
subgroup_member(b),
file(unknown,unknown) ).
tff(f_140,axiom,
product(a,inverse(b),c),
file(unknown,unknown) ).
tff(f_128,axiom,
! [A,B,C] :
( ~ subgroup_member(A)
| ~ subgroup_member(B)
| ~ product(A,inverse(B),C)
| subgroup_member(C) ),
file(unknown,unknown) ).
tff(c_30,plain,
~ subgroup_member(c),
inference(cnfTransformation,[status(thm)],[f_142]) ).
tff(c_24,plain,
subgroup_member(a),
inference(cnfTransformation,[status(thm)],[f_138]) ).
tff(c_26,plain,
subgroup_member(b),
inference(cnfTransformation,[status(thm)],[f_139]) ).
tff(c_28,plain,
product(a,inverse(b),c),
inference(cnfTransformation,[status(thm)],[f_140]) ).
tff(c_108,plain,
! [C_41,A_42,B_43] :
( subgroup_member(C_41)
| ~ product(A_42,inverse(B_43),C_41)
| ~ subgroup_member(B_43)
| ~ subgroup_member(A_42) ),
inference(cnfTransformation,[status(thm)],[f_128]) ).
tff(c_125,plain,
( subgroup_member(c)
| ~ subgroup_member(b)
| ~ subgroup_member(a) ),
inference(resolution,[status(thm)],[c_28,c_108]) ).
tff(c_139,plain,
subgroup_member(c),
inference(demodulation,[status(thm),theory(equality)],[c_24,c_26,c_125]) ).
tff(c_141,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_30,c_139]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : GRP038-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.16/0.36 % Computer : n013.cluster.edu
% 0.16/0.36 % Model : x86_64 x86_64
% 0.16/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.36 % Memory : 8042.1875MB
% 0.16/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.36 % CPULimit : 300
% 0.16/0.36 % WCLimit : 300
% 0.16/0.36 % DateTime : Thu Aug 3 22:15:18 EDT 2023
% 0.16/0.36 % CPUTime :
% 2.82/1.64 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.82/1.64
% 2.82/1.64 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 2.82/1.67
% 2.82/1.67 Inference rules
% 2.82/1.67 ----------------------
% 2.82/1.67 #Ref : 0
% 2.82/1.67 #Sup : 24
% 2.82/1.67 #Fact : 0
% 2.82/1.67 #Define : 0
% 2.82/1.67 #Split : 0
% 2.82/1.67 #Chain : 0
% 2.82/1.67 #Close : 0
% 2.82/1.67
% 2.82/1.67 Ordering : KBO
% 2.82/1.67
% 2.82/1.67 Simplification rules
% 2.82/1.67 ----------------------
% 2.82/1.67 #Subsume : 0
% 2.82/1.67 #Demod : 10
% 2.82/1.67 #Tautology : 12
% 2.82/1.67 #SimpNegUnit : 1
% 2.82/1.67 #BackRed : 0
% 2.82/1.67
% 2.82/1.67 #Partial instantiations: 0
% 2.82/1.67 #Strategies tried : 1
% 2.82/1.67
% 2.82/1.67 Timing (in seconds)
% 2.82/1.67 ----------------------
% 2.82/1.67 Preprocessing : 0.41
% 2.82/1.67 Parsing : 0.22
% 2.82/1.67 CNF conversion : 0.02
% 2.82/1.67 Main loop : 0.21
% 2.82/1.68 Inferencing : 0.08
% 2.82/1.68 Reduction : 0.06
% 2.82/1.68 Demodulation : 0.04
% 2.82/1.68 BG Simplification : 0.01
% 2.82/1.68 Subsumption : 0.04
% 2.82/1.68 Abstraction : 0.01
% 2.82/1.68 MUC search : 0.00
% 2.82/1.68 Cooper : 0.00
% 2.82/1.68 Total : 0.67
% 2.82/1.68 Index Insertion : 0.00
% 2.82/1.68 Index Deletion : 0.00
% 2.82/1.68 Index Matching : 0.00
% 2.82/1.68 BG Taut test : 0.00
%------------------------------------------------------------------------------