TSTP Solution File: GRP135-1.002 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : GRP135-1.002 : TPTP v8.1.2. Released v1.2.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 : n016.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:40:15 EDT 2023
% Result : Unsatisfiable 4.65s 2.11s
% Output : CNFRefutation 4.65s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 14
% Syntax : Number of formulae : 61 ( 24 unt; 5 typ; 0 def)
% Number of atoms : 130 ( 0 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 131 ( 57 ~; 74 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 6 ( 3 >; 3 *; 0 +; 0 <<)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 59 (; 59 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ product > equalish > group_element > #nlpp > e_2 > e_1
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(group_element,type,
group_element: $i > $o ).
tff(e_2,type,
e_2: $i ).
tff(product,type,
product: ( $i * $i * $i ) > $o ).
tff(equalish,type,
equalish: ( $i * $i ) > $o ).
tff(e_1,type,
e_1: $i ).
tff(f_35,axiom,
~ equalish(e_2,e_1),
file(unknown,unknown) ).
tff(f_33,axiom,
~ equalish(e_1,e_2),
file(unknown,unknown) ).
tff(f_30,axiom,
group_element(e_1),
file(unknown,unknown) ).
tff(f_31,axiom,
group_element(e_2),
file(unknown,unknown) ).
tff(f_45,axiom,
! [X,Y] :
( ~ group_element(X)
| ~ group_element(Y)
| product(X,Y,e_1)
| product(X,Y,e_2) ),
file(unknown,unknown) ).
tff(f_77,axiom,
! [Y,X,Z1,Z2] :
( ~ product(Y,X,Z1)
| ~ product(Z1,Y,Z2)
| product(Z2,Y,X) ),
file(unknown,unknown) ).
tff(f_61,axiom,
! [X,W,Y,Z] :
( ~ product(X,W,Y)
| ~ product(X,Z,Y)
| equalish(W,Z) ),
file(unknown,unknown) ).
tff(f_69,axiom,
! [W,Y,X,Z] :
( ~ product(W,Y,X)
| ~ product(Z,Y,X)
| equalish(W,Z) ),
file(unknown,unknown) ).
tff(f_53,axiom,
! [X,Y,W,Z] :
( ~ product(X,Y,W)
| ~ product(X,Y,Z)
| equalish(W,Z) ),
file(unknown,unknown) ).
tff(c_8,plain,
~ equalish(e_2,e_1),
inference(cnfTransformation,[status(thm)],[f_35]) ).
tff(c_6,plain,
~ equalish(e_1,e_2),
inference(cnfTransformation,[status(thm)],[f_33]) ).
tff(c_2,plain,
group_element(e_1),
inference(cnfTransformation,[status(thm)],[f_30]) ).
tff(c_4,plain,
group_element(e_2),
inference(cnfTransformation,[status(thm)],[f_31]) ).
tff(c_10,plain,
! [X_1,Y_2] :
( product(X_1,Y_2,e_2)
| product(X_1,Y_2,e_1)
| ~ group_element(Y_2)
| ~ group_element(X_1) ),
inference(cnfTransformation,[status(thm)],[f_45]) ).
tff(c_32,plain,
! [Z2_33,Y_34,X_35,Z1_36] :
( product(Z2_33,Y_34,X_35)
| ~ product(Z1_36,Y_34,Z2_33)
| ~ product(Y_34,X_35,Z1_36) ),
inference(cnfTransformation,[status(thm)],[f_77]) ).
tff(c_49,plain,
! [Y_46,X_47,X_48] :
( product(e_2,Y_46,X_47)
| ~ product(Y_46,X_47,X_48)
| product(X_48,Y_46,e_1)
| ~ group_element(Y_46)
| ~ group_element(X_48) ),
inference(resolution,[status(thm)],[c_10,c_32]) ).
tff(c_51,plain,
! [X_1,Y_2] :
( product(e_2,X_1,Y_2)
| product(e_2,X_1,e_1)
| ~ group_element(e_2)
| product(X_1,Y_2,e_1)
| ~ group_element(Y_2)
| ~ group_element(X_1) ),
inference(resolution,[status(thm)],[c_10,c_49]) ).
tff(c_54,plain,
! [X_1,Y_2] :
( product(e_2,X_1,Y_2)
| product(e_2,X_1,e_1)
| product(X_1,Y_2,e_1)
| ~ group_element(Y_2)
| ~ group_element(X_1) ),
inference(demodulation,[status(thm),theory(equality)],[c_4,c_51]) ).
tff(c_66,plain,
! [X_1] :
( product(X_1,e_1,e_1)
| ~ group_element(e_1)
| ~ group_element(X_1)
| product(e_2,X_1,e_1) ),
inference(factorization,[status(thm),theory(equality)],[c_54]) ).
tff(c_154,plain,
! [X_51] :
( product(X_51,e_1,e_1)
| ~ group_element(X_51)
| product(e_2,X_51,e_1) ),
inference(demodulation,[status(thm),theory(equality)],[c_2,c_66]) ).
tff(c_35,plain,
! [Y_2,X_35,X_1] :
( product(e_2,Y_2,X_35)
| ~ product(Y_2,X_35,X_1)
| product(X_1,Y_2,e_1)
| ~ group_element(Y_2)
| ~ group_element(X_1) ),
inference(resolution,[status(thm)],[c_10,c_32]) ).
tff(c_156,plain,
! [X_51] :
( product(e_1,X_51,e_1)
| ~ group_element(e_1)
| ~ group_element(X_51)
| product(e_2,X_51,e_1) ),
inference(resolution,[status(thm)],[c_154,c_35]) ).
tff(c_181,plain,
! [X_51] :
( product(e_1,X_51,e_1)
| ~ group_element(X_51)
| product(e_2,X_51,e_1) ),
inference(demodulation,[status(thm),theory(equality)],[c_2,c_156]) ).
tff(c_14,plain,
! [W_8,Z_10,X_7,Y_9] :
( equalish(W_8,Z_10)
| ~ product(X_7,Z_10,Y_9)
| ~ product(X_7,W_8,Y_9) ),
inference(cnfTransformation,[status(thm)],[f_61]) ).
tff(c_243,plain,
! [W_55,X_56] :
( equalish(W_55,e_1)
| ~ product(X_56,W_55,e_1)
| ~ group_element(X_56)
| product(e_2,X_56,e_1) ),
inference(resolution,[status(thm)],[c_154,c_14]) ).
tff(c_245,plain,
! [X_51] :
( equalish(X_51,e_1)
| ~ group_element(e_2)
| product(e_2,e_2,e_1)
| product(e_1,X_51,e_1)
| ~ group_element(X_51) ),
inference(resolution,[status(thm)],[c_181,c_243]) ).
tff(c_257,plain,
! [X_51] :
( equalish(X_51,e_1)
| product(e_2,e_2,e_1)
| product(e_1,X_51,e_1)
| ~ group_element(X_51) ),
inference(demodulation,[status(thm),theory(equality)],[c_4,c_245]) ).
tff(c_592,plain,
product(e_2,e_2,e_1),
inference(splitLeft,[status(thm)],[c_257]) ).
tff(c_604,plain,
( product(e_2,e_2,e_2)
| product(e_1,e_2,e_1)
| ~ group_element(e_2)
| ~ group_element(e_1) ),
inference(resolution,[status(thm)],[c_592,c_35]) ).
tff(c_631,plain,
( product(e_2,e_2,e_2)
| product(e_1,e_2,e_1) ),
inference(demodulation,[status(thm),theory(equality)],[c_2,c_4,c_604]) ).
tff(c_994,plain,
product(e_1,e_2,e_1),
inference(splitLeft,[status(thm)],[c_631]) ).
tff(c_16,plain,
! [W_11,Z_14,Y_12,X_13] :
( equalish(W_11,Z_14)
| ~ product(Z_14,Y_12,X_13)
| ~ product(W_11,Y_12,X_13) ),
inference(cnfTransformation,[status(thm)],[f_69]) ).
tff(c_637,plain,
! [W_11] :
( equalish(W_11,e_2)
| ~ product(W_11,e_2,e_1) ),
inference(resolution,[status(thm)],[c_592,c_16]) ).
tff(c_1075,plain,
equalish(e_1,e_2),
inference(resolution,[status(thm)],[c_994,c_637]) ).
tff(c_1097,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_6,c_1075]) ).
tff(c_1098,plain,
product(e_2,e_2,e_2),
inference(splitRight,[status(thm)],[c_631]) ).
tff(c_12,plain,
! [W_5,Z_6,X_3,Y_4] :
( equalish(W_5,Z_6)
| ~ product(X_3,Y_4,Z_6)
| ~ product(X_3,Y_4,W_5) ),
inference(cnfTransformation,[status(thm)],[f_53]) ).
tff(c_638,plain,
! [W_5] :
( equalish(W_5,e_1)
| ~ product(e_2,e_2,W_5) ),
inference(resolution,[status(thm)],[c_592,c_12]) ).
tff(c_1105,plain,
equalish(e_2,e_1),
inference(resolution,[status(thm)],[c_1098,c_638]) ).
tff(c_1128,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_8,c_1105]) ).
tff(c_1130,plain,
~ product(e_2,e_2,e_1),
inference(splitRight,[status(thm)],[c_257]) ).
tff(c_1142,plain,
( product(e_1,e_2,e_1)
| ~ group_element(e_2) ),
inference(resolution,[status(thm)],[c_181,c_1130]) ).
tff(c_1162,plain,
product(e_1,e_2,e_1),
inference(demodulation,[status(thm),theory(equality)],[c_4,c_1142]) ).
tff(c_1176,plain,
( product(e_2,e_1,e_2)
| product(e_1,e_1,e_1)
| ~ group_element(e_1) ),
inference(resolution,[status(thm)],[c_1162,c_35]) ).
tff(c_1201,plain,
( product(e_2,e_1,e_2)
| product(e_1,e_1,e_1) ),
inference(demodulation,[status(thm),theory(equality)],[c_2,c_1176]) ).
tff(c_1797,plain,
product(e_1,e_1,e_1),
inference(splitLeft,[status(thm)],[c_1201]) ).
tff(c_71,plain,
! [X_1] :
( product(X_1,e_1,e_1)
| ~ group_element(X_1)
| product(e_2,X_1,e_1) ),
inference(demodulation,[status(thm),theory(equality)],[c_2,c_66]) ).
tff(c_1145,plain,
( product(e_2,e_1,e_1)
| ~ group_element(e_2) ),
inference(resolution,[status(thm)],[c_71,c_1130]) ).
tff(c_1165,plain,
product(e_2,e_1,e_1),
inference(demodulation,[status(thm),theory(equality)],[c_4,c_1145]) ).
tff(c_1264,plain,
! [W_11] :
( equalish(W_11,e_2)
| ~ product(W_11,e_1,e_1) ),
inference(resolution,[status(thm)],[c_1165,c_16]) ).
tff(c_1903,plain,
equalish(e_1,e_2),
inference(resolution,[status(thm)],[c_1797,c_1264]) ).
tff(c_1932,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_6,c_1903]) ).
tff(c_1933,plain,
product(e_2,e_1,e_2),
inference(splitRight,[status(thm)],[c_1201]) ).
tff(c_1265,plain,
! [W_5] :
( equalish(W_5,e_1)
| ~ product(e_2,e_1,W_5) ),
inference(resolution,[status(thm)],[c_1165,c_12]) ).
tff(c_1937,plain,
equalish(e_2,e_1),
inference(resolution,[status(thm)],[c_1933,c_1265]) ).
tff(c_1961,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_8,c_1937]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : GRP135-1.002 : TPTP v8.1.2. Released v1.2.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.13/0.35 % Computer : n016.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 22:39:53 EDT 2023
% 0.13/0.35 % CPUTime :
% 4.65/2.11 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 4.65/2.12
% 4.65/2.12 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 4.65/2.16
% 4.65/2.16 Inference rules
% 4.65/2.16 ----------------------
% 4.65/2.16 #Ref : 0
% 4.65/2.16 #Sup : 380
% 4.65/2.16 #Fact : 8
% 4.65/2.16 #Define : 0
% 4.65/2.16 #Split : 5
% 4.65/2.16 #Chain : 0
% 4.65/2.16 #Close : 0
% 4.65/2.16
% 4.65/2.16 Ordering : KBO
% 4.65/2.16
% 4.65/2.16 Simplification rules
% 4.65/2.16 ----------------------
% 4.65/2.16 #Subsume : 19
% 4.65/2.16 #Demod : 330
% 4.65/2.16 #Tautology : 112
% 4.65/2.16 #SimpNegUnit : 37
% 4.65/2.16 #BackRed : 0
% 4.65/2.16
% 4.65/2.16 #Partial instantiations: 0
% 4.65/2.16 #Strategies tried : 1
% 4.65/2.16
% 4.65/2.16 Timing (in seconds)
% 4.65/2.16 ----------------------
% 4.65/2.16 Preprocessing : 0.41
% 4.65/2.16 Parsing : 0.23
% 4.65/2.16 CNF conversion : 0.02
% 4.65/2.16 Main loop : 0.66
% 4.65/2.16 Inferencing : 0.25
% 4.65/2.16 Reduction : 0.15
% 4.65/2.16 Demodulation : 0.10
% 4.65/2.16 BG Simplification : 0.03
% 4.65/2.16 Subsumption : 0.19
% 4.65/2.16 Abstraction : 0.03
% 4.65/2.16 MUC search : 0.00
% 4.65/2.16 Cooper : 0.00
% 4.65/2.16 Total : 1.13
% 4.65/2.16 Index Insertion : 0.00
% 4.65/2.16 Index Deletion : 0.00
% 4.65/2.16 Index Matching : 0.00
% 4.65/2.16 BG Taut test : 0.00
%------------------------------------------------------------------------------