TSTP Solution File: HWV052-1.001.001 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : HWV052-1.001.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/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 : n027.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.11s 1.89s
% Output : CNFRefutation 3.34s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 10
% Syntax : Number of formulae : 36 ( 18 unt; 5 typ; 0 def)
% Number of atoms : 46 ( 44 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 23 ( 8 ~; 15 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 3 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 4 ( 3 >; 1 *; 0 +; 0 <<)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 27 (; 27 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ unpack1 > #nlpp > pack1 > inv > o > i
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(i,type,
i: $i ).
tff(unpack1,type,
unpack1: ( $i * $i ) > $i ).
tff(inv,type,
inv: $i > $i ).
tff(pack1,type,
pack1: $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_35,axiom,
! [X1] : ( unpack1(inv(X1),pack1(X1)) = X1 ),
file(unknown,unknown) ).
tff(f_33,axiom,
! [X1] : ( unpack1(X1,pack1(X1)) = X1 ),
file(unknown,unknown) ).
tff(f_37,axiom,
! [X1] : ( unpack1(X1,inv(pack1(X1))) = 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_48,plain,
! [X1_42] : ( unpack1(inv(X1_42),pack1(X1_42)) = X1_42 ),
inference(cnfTransformation,[status(thm)],[f_35]) ).
tff(c_252,plain,
! [X1_92] :
( ( unpack1(inv(X1_92),o) = X1_92 )
| ( pack1(X1_92) = i ) ),
inference(superposition,[status(thm),theory(equality)],[c_2,c_48]) ).
tff(c_32,plain,
! [X1_37] : ( unpack1(X1_37,pack1(X1_37)) = X1_37 ),
inference(cnfTransformation,[status(thm)],[f_33]) ).
tff(c_41,plain,
! [X1_37] :
( ( unpack1(X1_37,o) = X1_37 )
| ( pack1(X1_37) = i ) ),
inference(superposition,[status(thm),theory(equality)],[c_2,c_32]) ).
tff(c_261,plain,
! [X1_92] :
( ( inv(X1_92) = X1_92 )
| ( pack1(inv(X1_92)) = i )
| ( pack1(X1_92) = i ) ),
inference(superposition,[status(thm),theory(equality)],[c_252,c_41]) ).
tff(c_288,plain,
! [X1_92] :
( ( pack1(inv(X1_92)) = i )
| ( pack1(X1_92) = i ) ),
inference(negUnitSimplification,[status(thm)],[c_4,c_261]) ).
tff(c_94,plain,
! [X1_57] : ( unpack1(X1_57,inv(pack1(X1_57))) = X1_57 ),
inference(cnfTransformation,[status(thm)],[f_37]) ).
tff(c_192,plain,
! [X1_82] :
( ( unpack1(X1_82,o) = X1_82 )
| ( inv(pack1(X1_82)) = i ) ),
inference(superposition,[status(thm),theory(equality)],[c_2,c_94]) ).
tff(c_207,plain,
! [X1_82] :
( ( pack1(X1_82) != i )
| ( unpack1(X1_82,o) = X1_82 ) ),
inference(superposition,[status(thm),theory(equality)],[c_192,c_4]) ).
tff(c_258,plain,
! [X1_92] :
( ( pack1(inv(X1_92)) != i )
| ( inv(X1_92) = X1_92 )
| ( pack1(X1_92) = i ) ),
inference(superposition,[status(thm),theory(equality)],[c_252,c_207]) ).
tff(c_331,plain,
! [X1_102] :
( ( pack1(inv(X1_102)) != i )
| ( pack1(X1_102) = i ) ),
inference(negUnitSimplification,[status(thm)],[c_4,c_258]) ).
tff(c_347,plain,
! [X1_92] : ( pack1(X1_92) = i ),
inference(superposition,[status(thm),theory(equality)],[c_288,c_331]) ).
tff(c_6,plain,
! [X1_3] : ( unpack1(X1_3,pack1(X1_3)) = X1_3 ),
inference(cnfTransformation,[status(thm)],[f_33]) ).
tff(c_361,plain,
! [X1_3] : ( unpack1(X1_3,i) = X1_3 ),
inference(demodulation,[status(thm),theory(equality)],[c_347,c_6]) ).
tff(c_57,plain,
! [X1_42] :
( ( unpack1(o,pack1(X1_42)) = X1_42 )
| ( inv(X1_42) = i ) ),
inference(superposition,[status(thm),theory(equality)],[c_2,c_48]) ).
tff(c_430,plain,
! [X1_127] :
( ( o = X1_127 )
| ( inv(X1_127) = i ) ),
inference(demodulation,[status(thm),theory(equality)],[c_361,c_347,c_57]) ).
tff(c_460,plain,
o = i,
inference(superposition,[status(thm),theory(equality)],[c_430,c_4]) ).
tff(c_17,plain,
! [X_1] :
( ( i = X_1 )
| ( o != i ) ),
inference(factorization,[status(thm),theory(equality)],[c_2]) ).
tff(c_30,plain,
o != i,
inference(splitLeft,[status(thm)],[c_17]) ).
tff(c_469,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_460,c_30]) ).
tff(c_472,plain,
! [X_132] : ( i = X_132 ),
inference(splitRight,[status(thm)],[c_17]) ).
tff(c_474,plain,
! [X_2] : ( i != X_2 ),
inference(superposition,[status(thm),theory(equality)],[c_472,c_4]) ).
tff(c_470,plain,
! [X_1] : ( i = X_1 ),
inference(splitRight,[status(thm)],[c_17]) ).
tff(c_489,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_474,c_470]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : HWV052-1.001.001 : TPTP v8.1.2. Released v4.1.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 : n027.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 : Fri Aug 4 00:15:09 EDT 2023
% 0.13/0.35 % CPUTime :
% 3.11/1.89 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.34/1.90
% 3.34/1.90 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 3.34/1.93
% 3.34/1.93 Inference rules
% 3.34/1.93 ----------------------
% 3.34/1.93 #Ref : 1
% 3.34/1.93 #Sup : 112
% 3.34/1.93 #Fact : 1
% 3.34/1.93 #Define : 0
% 3.34/1.93 #Split : 1
% 3.34/1.93 #Chain : 0
% 3.34/1.93 #Close : 0
% 3.34/1.93
% 3.34/1.93 Ordering : KBO
% 3.34/1.93
% 3.34/1.93 Simplification rules
% 3.34/1.93 ----------------------
% 3.34/1.93 #Subsume : 22
% 3.34/1.93 #Demod : 36
% 3.34/1.93 #Tautology : 63
% 3.34/1.93 #SimpNegUnit : 14
% 3.34/1.93 #BackRed : 14
% 3.34/1.93
% 3.34/1.93 #Partial instantiations: 23
% 3.34/1.93 #Strategies tried : 1
% 3.34/1.93
% 3.34/1.93 Timing (in seconds)
% 3.34/1.93 ----------------------
% 3.34/1.93 Preprocessing : 0.39
% 3.34/1.93 Parsing : 0.21
% 3.34/1.93 CNF conversion : 0.02
% 3.34/1.93 Main loop : 0.38
% 3.34/1.93 Inferencing : 0.17
% 3.34/1.93 Reduction : 0.09
% 3.34/1.93 Demodulation : 0.06
% 3.34/1.93 BG Simplification : 0.02
% 3.34/1.93 Subsumption : 0.08
% 3.34/1.93 Abstraction : 0.02
% 3.34/1.93 MUC search : 0.00
% 3.34/1.93 Cooper : 0.00
% 3.34/1.93 Total : 0.82
% 3.34/1.93 Index Insertion : 0.00
% 3.34/1.93 Index Deletion : 0.00
% 3.34/1.93 Index Matching : 0.00
% 3.34/1.93 BG Taut test : 0.00
%------------------------------------------------------------------------------