TSTP Solution File: HEN005-4 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : HEN005-4 : 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 : n005.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 3.72s 1.94s
% Output : CNFRefutation 3.72s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 16
% Syntax : Number of formulae : 37 ( 21 unt; 7 typ; 0 def)
% Number of atoms : 42 ( 19 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 27 ( 15 ~; 12 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 4 ( 2 >; 2 *; 0 +; 0 <<)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 5 con; 0-2 aty)
% Number of variables : 28 (; 28 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ less_equal > divide > #nlpp > zero > identity > c > b > a
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(less_equal,type,
less_equal: ( $i * $i ) > $o ).
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_53,axiom,
! [X,Y] :
( ( divide(X,Y) != zero )
| less_equal(X,Y) ),
file(unknown,unknown) ).
tff(f_89,axiom,
~ less_equal(a,c),
file(unknown,unknown) ).
tff(f_81,axiom,
! [X] : ( divide(zero,X) = zero ),
file(unknown,unknown) ).
tff(f_86,axiom,
less_equal(a,b),
file(unknown,unknown) ).
tff(f_48,axiom,
! [X,Y] :
( ~ less_equal(X,Y)
| ( divide(X,Y) = zero ) ),
file(unknown,unknown) ).
tff(f_85,axiom,
! [X] : ( divide(X,zero) = X ),
file(unknown,unknown) ).
tff(f_87,axiom,
less_equal(b,c),
file(unknown,unknown) ).
tff(f_59,axiom,
! [X,Z,Y] : less_equal(divide(divide(X,Z),divide(Y,Z)),divide(divide(X,Y),Z)),
file(unknown,unknown) ).
tff(f_71,axiom,
! [X,Y] :
( ~ less_equal(X,Y)
| ~ less_equal(Y,X)
| ( X = Y ) ),
file(unknown,unknown) ).
tff(c_122,plain,
! [X_27,Y_28] :
( less_equal(X_27,Y_28)
| ( divide(X_27,Y_28) != zero ) ),
inference(cnfTransformation,[status(thm)],[f_53]) ).
tff(c_28,plain,
~ less_equal(a,c),
inference(cnfTransformation,[status(thm)],[f_89]) ).
tff(c_126,plain,
divide(a,c) != zero,
inference(resolution,[status(thm)],[c_122,c_28]) ).
tff(c_18,plain,
! [X_15] : ( divide(zero,X_15) = zero ),
inference(cnfTransformation,[status(thm)],[f_81]) ).
tff(c_24,plain,
less_equal(a,b),
inference(cnfTransformation,[status(thm)],[f_86]) ).
tff(c_127,plain,
! [X_29,Y_30] :
( ( divide(X_29,Y_30) = zero )
| ~ less_equal(X_29,Y_30) ),
inference(cnfTransformation,[status(thm)],[f_48]) ).
tff(c_153,plain,
divide(a,b) = zero,
inference(resolution,[status(thm)],[c_24,c_127]) ).
tff(c_22,plain,
! [X_17] : ( divide(X_17,zero) = X_17 ),
inference(cnfTransformation,[status(thm)],[f_85]) ).
tff(c_26,plain,
less_equal(b,c),
inference(cnfTransformation,[status(thm)],[f_87]) ).
tff(c_158,plain,
divide(b,c) = zero,
inference(resolution,[status(thm)],[c_26,c_127]) ).
tff(c_219,plain,
! [X_34,Z_35,Y_36] : less_equal(divide(divide(X_34,Z_35),divide(Y_36,Z_35)),divide(divide(X_34,Y_36),Z_35)),
inference(cnfTransformation,[status(thm)],[f_59]) ).
tff(c_230,plain,
! [X_34] : less_equal(divide(divide(X_34,c),zero),divide(divide(X_34,b),c)),
inference(superposition,[status(thm),theory(equality)],[c_158,c_219]) ).
tff(c_1079,plain,
! [X_57] : less_equal(divide(X_57,c),divide(divide(X_57,b),c)),
inference(demodulation,[status(thm),theory(equality)],[c_22,c_230]) ).
tff(c_1113,plain,
less_equal(divide(a,c),divide(zero,c)),
inference(superposition,[status(thm),theory(equality)],[c_153,c_1079]) ).
tff(c_1138,plain,
less_equal(divide(a,c),zero),
inference(demodulation,[status(thm),theory(equality)],[c_18,c_1113]) ).
tff(c_4,plain,
! [X_3,Y_4] :
( less_equal(X_3,Y_4)
| ( divide(X_3,Y_4) != zero ) ),
inference(cnfTransformation,[status(thm)],[f_53]) ).
tff(c_167,plain,
! [Y_31,X_32] :
( ( Y_31 = X_32 )
| ~ less_equal(Y_31,X_32)
| ~ less_equal(X_32,Y_31) ),
inference(cnfTransformation,[status(thm)],[f_71]) ).
tff(c_182,plain,
! [Y_4,X_3] :
( ( Y_4 = X_3 )
| ~ less_equal(Y_4,X_3)
| ( divide(X_3,Y_4) != zero ) ),
inference(resolution,[status(thm)],[c_4,c_167]) ).
tff(c_1145,plain,
( ( divide(a,c) = zero )
| ( divide(zero,divide(a,c)) != zero ) ),
inference(resolution,[status(thm)],[c_1138,c_182]) ).
tff(c_1156,plain,
divide(a,c) = zero,
inference(demodulation,[status(thm),theory(equality)],[c_18,c_1145]) ).
tff(c_1158,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_126,c_1156]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : HEN005-4 : TPTP v8.1.2. Released v1.0.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.17/0.35 % Computer : n005.cluster.edu
% 0.17/0.35 % Model : x86_64 x86_64
% 0.17/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.35 % Memory : 8042.1875MB
% 0.17/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.17/0.35 % CPULimit : 300
% 0.17/0.35 % WCLimit : 300
% 0.17/0.35 % DateTime : Thu Aug 3 13:07:11 EDT 2023
% 0.17/0.35 % CPUTime :
% 3.72/1.94 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.72/1.94
% 3.72/1.94 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 3.72/1.97
% 3.72/1.97 Inference rules
% 3.72/1.97 ----------------------
% 3.72/1.97 #Ref : 0
% 3.72/1.97 #Sup : 261
% 3.72/1.97 #Fact : 0
% 3.72/1.97 #Define : 0
% 3.72/1.97 #Split : 2
% 3.72/1.97 #Chain : 0
% 3.72/1.97 #Close : 0
% 3.72/1.97
% 3.72/1.97 Ordering : KBO
% 3.72/1.97
% 3.72/1.97 Simplification rules
% 3.72/1.97 ----------------------
% 3.72/1.97 #Subsume : 9
% 3.72/1.97 #Demod : 359
% 3.72/1.97 #Tautology : 202
% 3.72/1.97 #SimpNegUnit : 1
% 3.72/1.97 #BackRed : 2
% 3.72/1.97
% 3.72/1.97 #Partial instantiations: 0
% 3.72/1.97 #Strategies tried : 1
% 3.72/1.97
% 3.72/1.97 Timing (in seconds)
% 3.72/1.97 ----------------------
% 3.72/1.98 Preprocessing : 0.44
% 3.72/1.98 Parsing : 0.23
% 3.72/1.98 CNF conversion : 0.02
% 3.72/1.98 Main loop : 0.49
% 3.72/1.98 Inferencing : 0.19
% 3.72/1.98 Reduction : 0.16
% 3.72/1.98 Demodulation : 0.12
% 3.72/1.98 BG Simplification : 0.02
% 3.72/1.98 Subsumption : 0.09
% 3.72/1.98 Abstraction : 0.02
% 3.72/1.98 MUC search : 0.00
% 3.72/1.98 Cooper : 0.00
% 3.72/1.98 Total : 0.98
% 3.72/1.98 Index Insertion : 0.00
% 3.72/1.98 Index Deletion : 0.00
% 3.72/1.98 Index Matching : 0.00
% 3.72/1.98 BG Taut test : 0.00
%------------------------------------------------------------------------------