TSTP Solution File: HEN007-2 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : HEN007-2 : 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/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 : n012.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:16 EDT 2023
% Result : Unsatisfiable 7.19s 2.78s
% Output : CNFRefutation 7.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 20
% Syntax : Number of formulae : 43 ( 17 unt; 10 typ; 0 def)
% Number of atoms : 59 ( 4 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 54 ( 28 ~; 26 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 7 ( 3 >; 4 *; 0 +; 0 <<)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 8 ( 8 usr; 7 con; 0-2 aty)
% Number of variables : 51 (; 51 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ quotient > less_equal > divide > #nlpp > zero > zQy > zQx > z > y > x > identity
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(less_equal,type,
less_equal: ( $i * $i ) > $o ).
tff(divide,type,
divide: ( $i * $i ) > $i ).
tff(x,type,
x: $i ).
tff(zQx,type,
zQx: $i ).
tff(y,type,
y: $i ).
tff(quotient,type,
quotient: ( $i * $i * $i ) > $o ).
tff(zQy,type,
zQy: $i ).
tff(identity,type,
identity: $i ).
tff(z,type,
z: $i ).
tff(zero,type,
zero: $i ).
tff(f_139,axiom,
~ less_equal(zQy,zQx),
file(unknown,unknown) ).
tff(f_95,axiom,
! [X,Y] : quotient(X,Y,divide(X,Y)),
file(unknown,unknown) ).
tff(f_137,axiom,
quotient(z,x,zQx),
file(unknown,unknown) ).
tff(f_104,axiom,
! [X,Y,Z,W] :
( ~ quotient(X,Y,Z)
| ~ quotient(X,Y,W)
| ( Z = W ) ),
file(unknown,unknown) ).
tff(f_115,axiom,
! [X] : quotient(X,zero,X),
file(unknown,unknown) ).
tff(f_59,axiom,
! [X,Y,Z] :
( ~ quotient(X,Y,Z)
| less_equal(Z,X) ),
file(unknown,unknown) ).
tff(f_134,axiom,
! [W1,Z,X,Y,W2] :
( ~ quotient(X,Y,W1)
| ~ less_equal(W1,Z)
| ~ quotient(X,Z,W2)
| less_equal(W2,Y) ),
file(unknown,unknown) ).
tff(f_135,axiom,
less_equal(x,y),
file(unknown,unknown) ).
tff(f_123,axiom,
! [X,Y,Z] :
( ~ less_equal(X,Y)
| ~ less_equal(Y,Z)
| less_equal(X,Z) ),
file(unknown,unknown) ).
tff(f_136,axiom,
quotient(z,y,zQy),
file(unknown,unknown) ).
tff(c_38,plain,
~ less_equal(zQy,zQx),
inference(cnfTransformation,[status(thm)],[f_139]) ).
tff(c_16,plain,
! [X_20,Y_21] : quotient(X_20,Y_21,divide(X_20,Y_21)),
inference(cnfTransformation,[status(thm)],[f_95]) ).
tff(c_36,plain,
quotient(z,x,zQx),
inference(cnfTransformation,[status(thm)],[f_137]) ).
tff(c_207,plain,
! [Z_64,W_65,X_66,Y_67] :
( ( Z_64 = W_65 )
| ~ quotient(X_66,Y_67,W_65)
| ~ quotient(X_66,Y_67,Z_64) ),
inference(cnfTransformation,[status(thm)],[f_104]) ).
tff(c_264,plain,
! [Z_73] :
( ( zQx = Z_73 )
| ~ quotient(z,x,Z_73) ),
inference(resolution,[status(thm)],[c_36,c_207]) ).
tff(c_277,plain,
divide(z,x) = zQx,
inference(resolution,[status(thm)],[c_16,c_264]) ).
tff(c_26,plain,
! [X_29] : quotient(X_29,zero,X_29),
inference(cnfTransformation,[status(thm)],[f_115]) ).
tff(c_46,plain,
! [Z_46,X_47,Y_48] :
( less_equal(Z_46,X_47)
| ~ quotient(X_47,Y_48,Z_46) ),
inference(cnfTransformation,[status(thm)],[f_59]) ).
tff(c_74,plain,
! [X_29] : less_equal(X_29,X_29),
inference(resolution,[status(thm)],[c_26,c_46]) ).
tff(c_234,plain,
! [X_70,Y_71,W2_69,W1_68,Z_72] :
( less_equal(W2_69,Y_71)
| ~ quotient(X_70,Z_72,W2_69)
| ~ less_equal(W1_68,Z_72)
| ~ quotient(X_70,Y_71,W1_68) ),
inference(cnfTransformation,[status(thm)],[f_134]) ).
tff(c_2346,plain,
! [X_156,Y_157,Y_158,W1_159] :
( less_equal(divide(X_156,Y_157),Y_158)
| ~ less_equal(W1_159,Y_157)
| ~ quotient(X_156,Y_158,W1_159) ),
inference(resolution,[status(thm)],[c_16,c_234]) ).
tff(c_5390,plain,
! [X_266,X_267,Y_268] :
( less_equal(divide(X_266,X_267),Y_268)
| ~ quotient(X_266,Y_268,X_267) ),
inference(resolution,[status(thm)],[c_74,c_2346]) ).
tff(c_32,plain,
less_equal(x,y),
inference(cnfTransformation,[status(thm)],[f_135]) ).
tff(c_137,plain,
! [X_58,Z_59,Y_60] :
( less_equal(X_58,Z_59)
| ~ less_equal(Y_60,Z_59)
| ~ less_equal(X_58,Y_60) ),
inference(cnfTransformation,[status(thm)],[f_123]) ).
tff(c_159,plain,
! [X_58] :
( less_equal(X_58,y)
| ~ less_equal(X_58,x) ),
inference(resolution,[status(thm)],[c_32,c_137]) ).
tff(c_34,plain,
quotient(z,y,zQy),
inference(cnfTransformation,[status(thm)],[f_136]) ).
tff(c_1394,plain,
! [Y_122,W1_123] :
( less_equal(zQy,Y_122)
| ~ less_equal(W1_123,y)
| ~ quotient(z,Y_122,W1_123) ),
inference(resolution,[status(thm)],[c_34,c_234]) ).
tff(c_2150,plain,
! [Y_148] :
( less_equal(zQy,Y_148)
| ~ less_equal(divide(z,Y_148),y) ),
inference(resolution,[status(thm)],[c_16,c_1394]) ).
tff(c_2177,plain,
! [Y_148] :
( less_equal(zQy,Y_148)
| ~ less_equal(divide(z,Y_148),x) ),
inference(resolution,[status(thm)],[c_159,c_2150]) ).
tff(c_5744,plain,
! [X_282] :
( less_equal(zQy,X_282)
| ~ quotient(z,x,X_282) ),
inference(resolution,[status(thm)],[c_5390,c_2177]) ).
tff(c_5752,plain,
less_equal(zQy,divide(z,x)),
inference(resolution,[status(thm)],[c_16,c_5744]) ).
tff(c_5759,plain,
less_equal(zQy,zQx),
inference(demodulation,[status(thm),theory(equality)],[c_277,c_5752]) ).
tff(c_5761,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_38,c_5759]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : HEN007-2 : TPTP v8.1.2. Released v1.0.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.14/0.35 % Computer : n012.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Thu Aug 3 13:04:23 EDT 2023
% 0.14/0.35 % CPUTime :
% 7.19/2.78 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 7.19/2.79
% 7.19/2.79 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 7.19/2.82
% 7.19/2.82 Inference rules
% 7.19/2.82 ----------------------
% 7.19/2.82 #Ref : 0
% 7.19/2.82 #Sup : 1319
% 7.19/2.82 #Fact : 0
% 7.19/2.82 #Define : 0
% 7.19/2.82 #Split : 11
% 7.19/2.82 #Chain : 0
% 7.19/2.82 #Close : 0
% 7.19/2.82
% 7.19/2.82 Ordering : KBO
% 7.19/2.82
% 7.19/2.82 Simplification rules
% 7.19/2.82 ----------------------
% 7.19/2.82 #Subsume : 248
% 7.19/2.82 #Demod : 839
% 7.19/2.82 #Tautology : 739
% 7.19/2.82 #SimpNegUnit : 35
% 7.19/2.82 #BackRed : 0
% 7.19/2.82
% 7.19/2.82 #Partial instantiations: 0
% 7.19/2.82 #Strategies tried : 1
% 7.19/2.82
% 7.19/2.82 Timing (in seconds)
% 7.19/2.82 ----------------------
% 7.19/2.82 Preprocessing : 0.48
% 7.19/2.83 Parsing : 0.24
% 7.19/2.83 CNF conversion : 0.03
% 7.19/2.83 Main loop : 1.26
% 7.19/2.83 Inferencing : 0.45
% 7.19/2.83 Reduction : 0.42
% 7.19/2.83 Demodulation : 0.31
% 7.19/2.83 BG Simplification : 0.04
% 7.19/2.83 Subsumption : 0.28
% 7.19/2.83 Abstraction : 0.04
% 7.19/2.83 MUC search : 0.00
% 7.19/2.83 Cooper : 0.00
% 7.19/2.83 Total : 1.79
% 7.19/2.83 Index Insertion : 0.00
% 7.19/2.83 Index Deletion : 0.00
% 7.19/2.83 Index Matching : 0.00
% 7.19/2.83 BG Taut test : 0.00
%------------------------------------------------------------------------------