TSTP Solution File: HEN005-5 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : HEN005-5 : 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 : n006.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:14 EDT 2023
% Result : Unsatisfiable 2.98s 1.73s
% Output : CNFRefutation 2.98s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 13
% Syntax : Number of formulae : 29 ( 18 unt; 6 typ; 0 def)
% Number of atoms : 30 ( 29 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 16 ( 9 ~; 7 |; 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 : 2 ( 1 >; 1 *; 0 +; 0 <<)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 5 con; 0-2 aty)
% Number of variables : 22 (; 22 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ divide > #nlpp > zero > identity > c > b > a
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(a,type,
a: $i ).
tff(divide,type,
divide: ( $i * $i ) > $i ).
tff(b,type,
b: $i ).
tff(identity,type,
identity: $i ).
tff(zero,type,
zero: $i ).
tff(c,type,
c: $i ).
tff(f_76,axiom,
divide(a,c) != zero,
file(unknown,unknown) ).
tff(f_74,axiom,
divide(b,c) = zero,
file(unknown,unknown) ).
tff(f_57,axiom,
! [X] : ( divide(zero,X) = zero ),
file(unknown,unknown) ).
tff(f_73,axiom,
divide(a,b) = zero,
file(unknown,unknown) ).
tff(f_54,axiom,
! [X,Z,Y] : ( divide(divide(divide(X,Z),divide(Y,Z)),divide(divide(X,Y),Z)) = zero ),
file(unknown,unknown) ).
tff(f_66,axiom,
! [X,Y] :
( ( divide(X,Y) != zero )
| ( divide(Y,X) != zero )
| ( X = Y ) ),
file(unknown,unknown) ).
tff(f_51,axiom,
! [X,Y] : ( divide(divide(X,Y),X) = zero ),
file(unknown,unknown) ).
tff(c_16,plain,
divide(a,c) != zero,
inference(cnfTransformation,[status(thm)],[f_76]) ).
tff(c_14,plain,
divide(b,c) = zero,
inference(cnfTransformation,[status(thm)],[f_74]) ).
tff(c_6,plain,
! [X_6] : ( divide(zero,X_6) = zero ),
inference(cnfTransformation,[status(thm)],[f_57]) ).
tff(c_12,plain,
divide(a,b) = zero,
inference(cnfTransformation,[status(thm)],[f_73]) ).
tff(c_103,plain,
! [X_16,Z_17,Y_18] : ( divide(divide(divide(X_16,Z_17),divide(Y_18,Z_17)),divide(divide(X_16,Y_18),Z_17)) = zero ),
inference(cnfTransformation,[status(thm)],[f_54]) ).
tff(c_161,plain,
! [Z_17] : ( divide(divide(divide(a,Z_17),divide(b,Z_17)),divide(zero,Z_17)) = zero ),
inference(superposition,[status(thm),theory(equality)],[c_12,c_103]) ).
tff(c_235,plain,
! [Z_21] : ( divide(divide(divide(a,Z_21),divide(b,Z_21)),zero) = zero ),
inference(demodulation,[status(thm),theory(equality)],[c_6,c_161]) ).
tff(c_86,plain,
! [Y_14,X_15] :
( ( Y_14 = X_15 )
| ( divide(Y_14,X_15) != zero )
| ( divide(X_15,Y_14) != zero ) ),
inference(cnfTransformation,[status(thm)],[f_66]) ).
tff(c_99,plain,
! [X_6] :
( ( zero = X_6 )
| ( divide(X_6,zero) != zero ) ),
inference(superposition,[status(thm),theory(equality)],[c_6,c_86]) ).
tff(c_325,plain,
! [Z_24] : ( divide(divide(a,Z_24),divide(b,Z_24)) = zero ),
inference(superposition,[status(thm),theory(equality)],[c_235,c_99]) ).
tff(c_366,plain,
divide(divide(a,c),zero) = zero,
inference(superposition,[status(thm),theory(equality)],[c_14,c_325]) ).
tff(c_2,plain,
! [X_1,Y_2] : ( divide(divide(X_1,Y_2),X_1) = zero ),
inference(cnfTransformation,[status(thm)],[f_51]) ).
tff(c_97,plain,
! [X_1,Y_2] :
( ( divide(X_1,Y_2) = X_1 )
| ( divide(X_1,divide(X_1,Y_2)) != zero ) ),
inference(superposition,[status(thm),theory(equality)],[c_2,c_86]) ).
tff(c_381,plain,
( ( divide(divide(a,c),zero) = divide(a,c) )
| ( divide(divide(a,c),zero) != zero ) ),
inference(superposition,[status(thm),theory(equality)],[c_366,c_97]) ).
tff(c_405,plain,
divide(a,c) = zero,
inference(demodulation,[status(thm),theory(equality)],[c_366,c_366,c_381]) ).
tff(c_407,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_16,c_405]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : HEN005-5 : TPTP v8.1.2. Released v1.0.0.
% 0.00/0.13 % 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 : n006.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 13:05:13 EDT 2023
% 0.13/0.35 % CPUTime :
% 2.98/1.73 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.98/1.74
% 2.98/1.74 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 2.98/1.76
% 2.98/1.76 Inference rules
% 2.98/1.76 ----------------------
% 2.98/1.76 #Ref : 0
% 2.98/1.76 #Sup : 103
% 2.98/1.76 #Fact : 0
% 2.98/1.76 #Define : 0
% 2.98/1.76 #Split : 2
% 2.98/1.76 #Chain : 0
% 2.98/1.76 #Close : 0
% 2.98/1.76
% 2.98/1.76 Ordering : KBO
% 2.98/1.76
% 2.98/1.76 Simplification rules
% 2.98/1.76 ----------------------
% 2.98/1.76 #Subsume : 6
% 2.98/1.76 #Demod : 84
% 2.98/1.76 #Tautology : 56
% 2.98/1.76 #SimpNegUnit : 1
% 2.98/1.76 #BackRed : 1
% 2.98/1.76
% 2.98/1.76 #Partial instantiations: 0
% 2.98/1.76 #Strategies tried : 1
% 2.98/1.76
% 2.98/1.76 Timing (in seconds)
% 2.98/1.76 ----------------------
% 2.98/1.77 Preprocessing : 0.41
% 2.98/1.77 Parsing : 0.22
% 2.98/1.77 CNF conversion : 0.02
% 2.98/1.77 Main loop : 0.32
% 2.98/1.77 Inferencing : 0.13
% 2.98/1.77 Reduction : 0.10
% 2.98/1.77 Demodulation : 0.08
% 2.98/1.77 BG Simplification : 0.01
% 2.98/1.77 Subsumption : 0.07
% 2.98/1.77 Abstraction : 0.01
% 2.98/1.77 MUC search : 0.00
% 2.98/1.77 Cooper : 0.00
% 2.98/1.77 Total : 0.78
% 2.98/1.77 Index Insertion : 0.00
% 2.98/1.77 Index Deletion : 0.00
% 2.98/1.77 Index Matching : 0.00
% 2.98/1.77 BG Taut test : 0.00
%------------------------------------------------------------------------------