TSTP Solution File: HWV052-1.002.001 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : HWV052-1.002.001 : TPTP v8.1.2. Released v4.1.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 : 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:42:42 EDT 2023
% Result : Unsatisfiable 3.79s 2.17s
% Output : CNFRefutation 3.79s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 13
% Syntax : Number of formulae : 34 ( 17 unt; 6 typ; 0 def)
% Number of atoms : 41 ( 40 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 18 ( 5 ~; 13 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 9 ( 4 >; 5 *; 0 +; 0 <<)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 2 con; 0-3 aty)
% Number of variables : 49 (; 49 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ unpack2 > unpack1 > pack1 > #nlpp > inv > o > i
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(i,type,
i: $i ).
tff(unpack2,type,
unpack2: ( $i * $i * $i ) > $i ).
tff(pack1,type,
pack1: ( $i * $i ) > $i ).
tff(inv,type,
inv: $i > $i ).
tff(unpack1,type,
unpack1: ( $i * $i * $i ) > $i ).
tff(o,type,
o: $i ).
tff(f_31,axiom,
! [X] : ( inv(X) != X ),
file(unknown,unknown) ).
tff(f_28,axiom,
! [X] :
( ( X = o )
| ( X = i ) ),
file(unknown,unknown) ).
tff(f_45,axiom,
! [X1,X2] : ( unpack2(X1,inv(X2),pack1(X1,X2)) = X2 ),
file(unknown,unknown) ).
tff(f_41,axiom,
! [X1,X2] : ( unpack2(X1,X2,pack1(X1,X2)) = X2 ),
file(unknown,unknown) ).
tff(f_47,axiom,
! [X1,X2] : ( unpack2(X1,X2,inv(pack1(X1,X2))) = X2 ),
file(unknown,unknown) ).
tff(f_35,axiom,
! [X1,X2] : ( unpack1(inv(X1),X2,pack1(X1,X2)) = X1 ),
file(unknown,unknown) ).
tff(f_33,axiom,
! [X1,X2] : ( unpack1(X1,X2,pack1(X1,X2)) = X1 ),
file(unknown,unknown) ).
tff(c_4,plain,
! [X_2] : ( inv(X_2) != X_2 ),
inference(cnfTransformation,[status(thm)],[f_31]) ).
tff(c_2,plain,
! [X_1] :
( ( i = X_1 )
| ( o = X_1 ) ),
inference(cnfTransformation,[status(thm)],[f_28]) ).
tff(c_121,plain,
! [X1_128,X2_129] : ( unpack2(X1_128,inv(X2_129),pack1(X1_128,X2_129)) = X2_129 ),
inference(cnfTransformation,[status(thm)],[f_45]) ).
tff(c_509,plain,
! [X1_315,X2_316] :
( ( unpack2(X1_315,inv(X2_316),o) = X2_316 )
| ( pack1(X1_315,X2_316) = i ) ),
inference(superposition,[status(thm),theory(equality)],[c_2,c_121]) ).
tff(c_82,plain,
! [X1_106,X2_107] : ( unpack2(X1_106,X2_107,pack1(X1_106,X2_107)) = X2_107 ),
inference(cnfTransformation,[status(thm)],[f_41]) ).
tff(c_91,plain,
! [X1_106,X2_107] :
( ( unpack2(X1_106,X2_107,o) = X2_107 )
| ( pack1(X1_106,X2_107) = i ) ),
inference(superposition,[status(thm),theory(equality)],[c_2,c_82]) ).
tff(c_519,plain,
! [X2_316,X1_315] :
( ( inv(X2_316) = X2_316 )
| ( pack1(X1_315,inv(X2_316)) = i )
| ( pack1(X1_315,X2_316) = i ) ),
inference(superposition,[status(thm),theory(equality)],[c_509,c_91]) ).
tff(c_545,plain,
! [X1_315,X2_316] :
( ( pack1(X1_315,inv(X2_316)) = i )
| ( pack1(X1_315,X2_316) = i ) ),
inference(negUnitSimplification,[status(thm)],[c_4,c_519]) ).
tff(c_187,plain,
! [X1_161,X2_162] : ( unpack2(X1_161,X2_162,inv(pack1(X1_161,X2_162))) = X2_162 ),
inference(cnfTransformation,[status(thm)],[f_47]) ).
tff(c_793,plain,
! [X1_381,X2_382] :
( ( unpack2(X1_381,X2_382,o) = X2_382 )
| ( inv(pack1(X1_381,X2_382)) = i ) ),
inference(superposition,[status(thm),theory(equality)],[c_2,c_187]) ).
tff(c_864,plain,
! [X1_392,X2_393] :
( ( pack1(X1_392,X2_393) != i )
| ( unpack2(X1_392,X2_393,o) = X2_393 ) ),
inference(superposition,[status(thm),theory(equality)],[c_793,c_4]) ).
tff(c_136,plain,
! [X1_128,X2_129] :
( ( unpack2(X1_128,inv(X2_129),o) = X2_129 )
| ( pack1(X1_128,X2_129) = i ) ),
inference(superposition,[status(thm),theory(equality)],[c_2,c_121]) ).
tff(c_871,plain,
! [X2_129,X1_392] :
( ( inv(X2_129) = X2_129 )
| ( pack1(X1_392,X2_129) = i )
| ( pack1(X1_392,inv(X2_129)) != i ) ),
inference(superposition,[status(thm),theory(equality)],[c_864,c_136]) ).
tff(c_964,plain,
! [X1_414,X2_415] :
( ( pack1(X1_414,X2_415) = i )
| ( pack1(X1_414,inv(X2_415)) != i ) ),
inference(negUnitSimplification,[status(thm)],[c_4,c_871]) ).
tff(c_983,plain,
! [X1_315,X2_316] : ( pack1(X1_315,X2_316) = i ),
inference(superposition,[status(thm),theory(equality)],[c_545,c_964]) ).
tff(c_8,plain,
! [X1_5,X2_6] : ( unpack1(inv(X1_5),X2_6,pack1(X1_5,X2_6)) = X1_5 ),
inference(cnfTransformation,[status(thm)],[f_35]) ).
tff(c_1094,plain,
! [X1_480,X2_481] : ( unpack1(inv(X1_480),X2_481,i) = X1_480 ),
inference(demodulation,[status(thm),theory(equality)],[c_983,c_8]) ).
tff(c_6,plain,
! [X1_3,X2_4] : ( unpack1(X1_3,X2_4,pack1(X1_3,X2_4)) = X1_3 ),
inference(cnfTransformation,[status(thm)],[f_33]) ).
tff(c_1016,plain,
! [X1_3,X2_4] : ( unpack1(X1_3,X2_4,i) = X1_3 ),
inference(demodulation,[status(thm),theory(equality)],[c_983,c_6]) ).
tff(c_1100,plain,
! [X1_480] : ( inv(X1_480) = X1_480 ),
inference(superposition,[status(thm),theory(equality)],[c_1094,c_1016]) ).
tff(c_1119,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_4,c_1100]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : HWV052-1.002.001 : TPTP v8.1.2. Released v4.1.0.
% 0.00/0.13 % 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.34 % Computer : n022.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Thu Aug 3 23:54:18 EDT 2023
% 0.13/0.34 % CPUTime :
% 3.79/2.17 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.79/2.18
% 3.79/2.18 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.79/2.21
% 3.79/2.21 Inference rules
% 3.79/2.21 ----------------------
% 3.79/2.21 #Ref : 1
% 3.79/2.21 #Sup : 266
% 3.79/2.21 #Fact : 1
% 3.79/2.21 #Define : 0
% 3.79/2.21 #Split : 1
% 3.79/2.21 #Chain : 0
% 3.79/2.21 #Close : 0
% 3.79/2.21
% 3.79/2.21 Ordering : KBO
% 3.79/2.21
% 3.79/2.21 Simplification rules
% 3.79/2.21 ----------------------
% 3.79/2.21 #Subsume : 42
% 3.79/2.21 #Demod : 68
% 3.79/2.21 #Tautology : 131
% 3.79/2.21 #SimpNegUnit : 16
% 3.79/2.21 #BackRed : 21
% 3.79/2.21
% 3.79/2.21 #Partial instantiations: 42
% 3.79/2.21 #Strategies tried : 1
% 3.79/2.21
% 3.79/2.21 Timing (in seconds)
% 3.79/2.21 ----------------------
% 3.79/2.21 Preprocessing : 0.51
% 3.79/2.21 Parsing : 0.28
% 3.79/2.21 CNF conversion : 0.02
% 3.79/2.21 Main loop : 0.58
% 3.79/2.21 Inferencing : 0.25
% 3.79/2.21 Reduction : 0.16
% 3.79/2.21 Demodulation : 0.09
% 3.79/2.21 BG Simplification : 0.03
% 3.79/2.21 Subsumption : 0.12
% 3.79/2.21 Abstraction : 0.03
% 3.79/2.21 MUC search : 0.00
% 3.79/2.22 Cooper : 0.00
% 3.79/2.22 Total : 1.14
% 3.79/2.22 Index Insertion : 0.00
% 3.79/2.22 Index Deletion : 0.00
% 3.79/2.22 Index Matching : 0.00
% 3.79/2.22 BG Taut test : 0.00
%------------------------------------------------------------------------------