TSTP Solution File: HEN008-2 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : HEN008-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/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 : n004.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:17 EDT 2023
% Result : Unsatisfiable 34.24s 22.51s
% Output : CNFRefutation 34.42s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 21
% Syntax : Number of formulae : 45 ( 19 unt; 10 typ; 0 def)
% Number of atoms : 72 ( 5 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 76 ( 39 ~; 37 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 5 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 : 69 (; 69 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ quotient > less_equal > divide > #nlpp > zero > identity > c > bQc > b > aQc > 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(aQc,type,
aQc: $i ).
tff(b,type,
b: $i ).
tff(quotient,type,
quotient: ( $i * $i * $i ) > $o ).
tff(bQc,type,
bQc: $i ).
tff(identity,type,
identity: $i ).
tff(zero,type,
zero: $i ).
tff(c,type,
c: $i ).
tff(f_150,axiom,
~ less_equal(aQc,bQc),
file(unknown,unknown) ).
tff(f_146,axiom,
less_equal(a,b),
file(unknown,unknown) ).
tff(f_48,axiom,
! [X,Y] :
( ~ less_equal(X,Y)
| quotient(X,Y,zero) ),
file(unknown,unknown) ).
tff(f_95,axiom,
! [X,Y] : quotient(X,Y,divide(X,Y)),
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_148,axiom,
quotient(b,c,bQc),
file(unknown,unknown) ).
tff(f_147,axiom,
quotient(a,c,aQc),
file(unknown,unknown) ).
tff(f_111,axiom,
! [X] : quotient(zero,X,zero),
file(unknown,unknown) ).
tff(f_77,axiom,
! [V3,V5,Z,V1,X,Y,V2,V4] :
( ~ quotient(X,Y,V1)
| ~ quotient(Y,Z,V2)
| ~ quotient(X,Z,V3)
| ~ quotient(V3,V2,V4)
| ~ quotient(V1,Z,V5)
| less_equal(V4,V5) ),
file(unknown,unknown) ).
tff(f_115,axiom,
! [X] : quotient(X,zero,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(c_40,plain,
~ less_equal(aQc,bQc),
inference(cnfTransformation,[status(thm)],[f_150]) ).
tff(c_34,plain,
less_equal(a,b),
inference(cnfTransformation,[status(thm)],[f_146]) ).
tff(c_2,plain,
! [X_1,Y_2] :
( quotient(X_1,Y_2,zero)
| ~ less_equal(X_1,Y_2) ),
inference(cnfTransformation,[status(thm)],[f_48]) ).
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_209,plain,
! [Z_69,W_70,X_71,Y_72] :
( ( Z_69 = W_70 )
| ~ quotient(X_71,Y_72,W_70)
| ~ quotient(X_71,Y_72,Z_69) ),
inference(cnfTransformation,[status(thm)],[f_104]) ).
tff(c_686,plain,
! [X_110,Y_111,Z_112] :
( ( divide(X_110,Y_111) = Z_112 )
| ~ quotient(X_110,Y_111,Z_112) ),
inference(resolution,[status(thm)],[c_16,c_209]) ).
tff(c_746,plain,
! [X_114,Y_115] :
( ( divide(X_114,Y_115) = zero )
| ~ less_equal(X_114,Y_115) ),
inference(resolution,[status(thm)],[c_2,c_686]) ).
tff(c_789,plain,
divide(a,b) = zero,
inference(resolution,[status(thm)],[c_34,c_746]) ).
tff(c_810,plain,
quotient(a,b,zero),
inference(superposition,[status(thm),theory(equality)],[c_789,c_16]) ).
tff(c_38,plain,
quotient(b,c,bQc),
inference(cnfTransformation,[status(thm)],[f_148]) ).
tff(c_36,plain,
quotient(a,c,aQc),
inference(cnfTransformation,[status(thm)],[f_147]) ).
tff(c_22,plain,
! [X_27] : quotient(zero,X_27,zero),
inference(cnfTransformation,[status(thm)],[f_111]) ).
tff(c_407,plain,
! [V5_97,V1_95,X_94,Z_93,V3_91,V4_92,V2_90,Y_96] :
( less_equal(V4_92,V5_97)
| ~ quotient(V1_95,Z_93,V5_97)
| ~ quotient(V3_91,V2_90,V4_92)
| ~ quotient(X_94,Z_93,V3_91)
| ~ quotient(Y_96,Z_93,V2_90)
| ~ quotient(X_94,Y_96,V1_95) ),
inference(cnfTransformation,[status(thm)],[f_77]) ).
tff(c_7303,plain,
! [X_313,V2_315,Y_314,X_317,V3_318,V4_316] :
( less_equal(V4_316,zero)
| ~ quotient(V3_318,V2_315,V4_316)
| ~ quotient(X_313,X_317,V3_318)
| ~ quotient(Y_314,X_317,V2_315)
| ~ quotient(X_313,Y_314,zero) ),
inference(resolution,[status(thm)],[c_22,c_407]) ).
tff(c_43824,plain,
! [Y_806,Y_807,X_808,X_809,X_805] :
( less_equal(divide(X_808,Y_806),zero)
| ~ quotient(X_809,X_805,X_808)
| ~ quotient(Y_807,X_805,Y_806)
| ~ quotient(X_809,Y_807,zero) ),
inference(resolution,[status(thm)],[c_16,c_7303]) ).
tff(c_187006,plain,
! [Y_1504,Y_1505] :
( less_equal(divide(aQc,Y_1504),zero)
| ~ quotient(Y_1505,c,Y_1504)
| ~ quotient(a,Y_1505,zero) ),
inference(resolution,[status(thm)],[c_36,c_43824]) ).
tff(c_187132,plain,
( less_equal(divide(aQc,bQc),zero)
| ~ quotient(a,b,zero) ),
inference(resolution,[status(thm)],[c_38,c_187006]) ).
tff(c_187261,plain,
less_equal(divide(aQc,bQc),zero),
inference(demodulation,[status(thm),theory(equality)],[c_810,c_187132]) ).
tff(c_26,plain,
! [X_29] : quotient(X_29,zero,X_29),
inference(cnfTransformation,[status(thm)],[f_115]) ).
tff(c_292,plain,
! [X_81,Y_82,Z_83,W2_80,W1_79] :
( less_equal(W2_80,Y_82)
| ~ quotient(X_81,Z_83,W2_80)
| ~ less_equal(W1_79,Z_83)
| ~ quotient(X_81,Y_82,W1_79) ),
inference(cnfTransformation,[status(thm)],[f_134]) ).
tff(c_1730,plain,
! [X_138,Y_139,W1_140] :
( less_equal(X_138,Y_139)
| ~ less_equal(W1_140,zero)
| ~ quotient(X_138,Y_139,W1_140) ),
inference(resolution,[status(thm)],[c_26,c_292]) ).
tff(c_1806,plain,
! [X_20,Y_21] :
( less_equal(X_20,Y_21)
| ~ less_equal(divide(X_20,Y_21),zero) ),
inference(resolution,[status(thm)],[c_16,c_1730]) ).
tff(c_187290,plain,
less_equal(aQc,bQc),
inference(resolution,[status(thm)],[c_187261,c_1806]) ).
tff(c_187331,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_40,c_187290]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : HEN008-2 : TPTP v8.1.2. Released v1.0.0.
% 0.12/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.12/0.34 % Computer : n004.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Thu Aug 3 13:03:26 EDT 2023
% 0.12/0.34 % CPUTime :
% 34.24/22.51 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 34.24/22.51
% 34.24/22.51 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 34.42/22.54
% 34.42/22.54 Inference rules
% 34.42/22.54 ----------------------
% 34.42/22.54 #Ref : 0
% 34.42/22.54 #Sup : 44413
% 34.42/22.54 #Fact : 0
% 34.42/22.54 #Define : 0
% 34.42/22.54 #Split : 35
% 34.42/22.54 #Chain : 0
% 34.42/22.54 #Close : 0
% 34.42/22.54
% 34.42/22.54 Ordering : KBO
% 34.42/22.54
% 34.42/22.54 Simplification rules
% 34.42/22.54 ----------------------
% 34.42/22.54 #Subsume : 21827
% 34.42/22.54 #Demod : 24404
% 34.42/22.54 #Tautology : 16936
% 34.42/22.54 #SimpNegUnit : 448
% 34.42/22.54 #BackRed : 0
% 34.42/22.54
% 34.42/22.54 #Partial instantiations: 0
% 34.42/22.54 #Strategies tried : 1
% 34.42/22.54
% 34.42/22.54 Timing (in seconds)
% 34.42/22.54 ----------------------
% 34.42/22.55 Preprocessing : 0.45
% 34.42/22.55 Parsing : 0.23
% 34.42/22.55 CNF conversion : 0.03
% 34.42/22.55 Main loop : 21.04
% 34.42/22.55 Inferencing : 2.44
% 34.42/22.55 Reduction : 8.46
% 34.42/22.55 Demodulation : 6.21
% 34.42/22.55 BG Simplification : 0.11
% 34.42/22.55 Subsumption : 9.41
% 34.42/22.55 Abstraction : 0.20
% 34.42/22.55 MUC search : 0.00
% 34.42/22.55 Cooper : 0.00
% 34.42/22.55 Total : 21.55
% 34.42/22.55 Index Insertion : 0.00
% 34.42/22.55 Index Deletion : 0.00
% 34.42/22.55 Index Matching : 0.00
% 34.42/22.55 BG Taut test : 0.00
%------------------------------------------------------------------------------