TSTP Solution File: HEN010-2 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : HEN010-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 : n008.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:19 EDT 2023
% Result : Unsatisfiable 16.26s 6.08s
% Output : CNFRefutation 16.26s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 20
% Syntax : Number of formulae : 46 ( 22 unt; 9 typ; 0 def)
% Number of atoms : 73 ( 10 equ)
% Maximal formula atoms : 6 ( 1 avg)
% Number of connectives : 78 ( 42 ~; 36 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 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 : 7 ( 7 usr; 6 con; 0-2 aty)
% Number of variables : 57 (; 57 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ quotient > less_equal > divide > #nlpp > zero > identity > idQa_Q__idQ_idQa > idQa > idQ_idQa > 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(idQa,type,
idQa: $i ).
tff(idQa_Q__idQ_idQa,type,
idQa_Q__idQ_idQa: $i ).
tff(quotient,type,
quotient: ( $i * $i * $i ) > $o ).
tff(identity,type,
identity: $i ).
tff(idQ_idQa,type,
idQ_idQa: $i ).
tff(zero,type,
zero: $i ).
tff(f_169,axiom,
quotient(identity,idQa,idQ_idQa),
file(unknown,unknown) ).
tff(f_95,axiom,
! [X,Y] : quotient(X,Y,divide(X,Y)),
file(unknown,unknown) ).
tff(f_167,axiom,
! [X,Y1,Y2,Y3] :
( ~ quotient(identity,X,Y1)
| ~ quotient(identity,Y1,Y2)
| ~ quotient(identity,Y2,Y3)
| ( Y1 = Y3 ) ),
file(unknown,unknown) ).
tff(f_168,axiom,
quotient(identity,a,idQa),
file(unknown,unknown) ).
tff(f_113,axiom,
! [X] : quotient(X,X,zero),
file(unknown,unknown) ).
tff(f_172,axiom,
idQa != idQa_Q__idQ_idQa,
file(unknown,unknown) ).
tff(f_170,axiom,
quotient(idQa,idQ_idQa,idQa_Q__idQ_idQa),
file(unknown,unknown) ).
tff(f_59,axiom,
! [X,Y,Z] :
( ~ quotient(X,Y,Z)
| less_equal(Z,X) ),
file(unknown,unknown) ).
tff(f_89,axiom,
! [X,Y] :
( ~ less_equal(X,Y)
| ~ less_equal(Y,X)
| ( X = Y ) ),
file(unknown,unknown) ).
tff(f_115,axiom,
! [X] : quotient(X,zero,X),
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(c_40,plain,
quotient(identity,idQa,idQ_idQa),
inference(cnfTransformation,[status(thm)],[f_169]) ).
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_561,plain,
! [Y3_109,Y1_110,Y2_111,X_112] :
( ( Y3_109 = Y1_110 )
| ~ quotient(identity,Y2_111,Y3_109)
| ~ quotient(identity,Y1_110,Y2_111)
| ~ quotient(identity,X_112,Y1_110) ),
inference(cnfTransformation,[status(thm)],[f_167]) ).
tff(c_16258,plain,
! [Y_404,Y1_405,X_406] :
( ( divide(identity,Y_404) = Y1_405 )
| ~ quotient(identity,Y1_405,Y_404)
| ~ quotient(identity,X_406,Y1_405) ),
inference(resolution,[status(thm)],[c_16,c_561]) ).
tff(c_16286,plain,
! [X_406] :
( ( divide(identity,idQ_idQa) = idQa )
| ~ quotient(identity,X_406,idQa) ),
inference(resolution,[status(thm)],[c_40,c_16258]) ).
tff(c_16295,plain,
! [X_406] : ~ quotient(identity,X_406,idQa),
inference(splitLeft,[status(thm)],[c_16286]) ).
tff(c_38,plain,
quotient(identity,a,idQa),
inference(cnfTransformation,[status(thm)],[f_168]) ).
tff(c_16297,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_16295,c_38]) ).
tff(c_16298,plain,
divide(identity,idQ_idQa) = idQa,
inference(splitRight,[status(thm)],[c_16286]) ).
tff(c_16422,plain,
quotient(identity,idQ_idQa,idQa),
inference(superposition,[status(thm),theory(equality)],[c_16298,c_16]) ).
tff(c_24,plain,
! [X_28] : quotient(X_28,X_28,zero),
inference(cnfTransformation,[status(thm)],[f_113]) ).
tff(c_44,plain,
idQa_Q__idQ_idQa != idQa,
inference(cnfTransformation,[status(thm)],[f_172]) ).
tff(c_42,plain,
quotient(idQa,idQ_idQa,idQa_Q__idQ_idQa),
inference(cnfTransformation,[status(thm)],[f_170]) ).
tff(c_79,plain,
! [Z_65,X_66,Y_67] :
( less_equal(Z_65,X_66)
| ~ quotient(X_66,Y_67,Z_65) ),
inference(cnfTransformation,[status(thm)],[f_59]) ).
tff(c_120,plain,
less_equal(idQa_Q__idQ_idQa,idQa),
inference(resolution,[status(thm)],[c_42,c_79]) ).
tff(c_12,plain,
! [Y_18,X_17] :
( ( Y_18 = X_17 )
| ~ less_equal(Y_18,X_17)
| ~ less_equal(X_17,Y_18) ),
inference(cnfTransformation,[status(thm)],[f_89]) ).
tff(c_137,plain,
( ( idQa_Q__idQ_idQa = idQa )
| ~ less_equal(idQa,idQa_Q__idQ_idQa) ),
inference(resolution,[status(thm)],[c_120,c_12]) ).
tff(c_140,plain,
~ less_equal(idQa,idQa_Q__idQ_idQa),
inference(negUnitSimplification,[status(thm)],[c_44,c_137]) ).
tff(c_26,plain,
! [X_29] : quotient(X_29,zero,X_29),
inference(cnfTransformation,[status(thm)],[f_115]) ).
tff(c_682,plain,
! [V3_119,X_122,V1_123,Y_124,V5_125,Z_121,V2_118,V4_120] :
( less_equal(V4_120,V5_125)
| ~ quotient(V1_123,Z_121,V5_125)
| ~ quotient(V3_119,V2_118,V4_120)
| ~ quotient(X_122,Z_121,V3_119)
| ~ quotient(Y_124,Z_121,V2_118)
| ~ quotient(X_122,Y_124,V1_123) ),
inference(cnfTransformation,[status(thm)],[f_77]) ).
tff(c_21840,plain,
! [X_510,V3_513,Y_512,V2_514,V4_511] :
( less_equal(V4_511,idQa_Q__idQ_idQa)
| ~ quotient(V3_513,V2_514,V4_511)
| ~ quotient(X_510,idQ_idQa,V3_513)
| ~ quotient(Y_512,idQ_idQa,V2_514)
| ~ quotient(X_510,Y_512,idQa) ),
inference(resolution,[status(thm)],[c_42,c_682]) ).
tff(c_44748,plain,
! [X_894,X_895,Y_896] :
( less_equal(X_894,idQa_Q__idQ_idQa)
| ~ quotient(X_895,idQ_idQa,X_894)
| ~ quotient(Y_896,idQ_idQa,zero)
| ~ quotient(X_895,Y_896,idQa) ),
inference(resolution,[status(thm)],[c_26,c_21840]) ).
tff(c_44755,plain,
! [Y_896] :
( less_equal(idQa,idQa_Q__idQ_idQa)
| ~ quotient(Y_896,idQ_idQa,zero)
| ~ quotient(identity,Y_896,idQa) ),
inference(resolution,[status(thm)],[c_16422,c_44748]) ).
tff(c_44829,plain,
! [Y_897] :
( ~ quotient(Y_897,idQ_idQa,zero)
| ~ quotient(identity,Y_897,idQa) ),
inference(negUnitSimplification,[status(thm)],[c_140,c_44755]) ).
tff(c_44868,plain,
~ quotient(identity,idQ_idQa,idQa),
inference(resolution,[status(thm)],[c_24,c_44829]) ).
tff(c_44885,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_16422,c_44868]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : HEN010-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.17/0.35 % Computer : n008.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:12:49 EDT 2023
% 0.17/0.35 % CPUTime :
% 16.26/6.08 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 16.26/6.08
% 16.26/6.08 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 16.26/6.11
% 16.26/6.11 Inference rules
% 16.26/6.11 ----------------------
% 16.26/6.11 #Ref : 0
% 16.26/6.11 #Sup : 10704
% 16.26/6.11 #Fact : 0
% 16.26/6.11 #Define : 0
% 16.26/6.11 #Split : 31
% 16.26/6.11 #Chain : 0
% 16.26/6.11 #Close : 0
% 16.26/6.11
% 16.26/6.11 Ordering : KBO
% 16.26/6.11
% 16.26/6.11 Simplification rules
% 16.26/6.11 ----------------------
% 16.26/6.11 #Subsume : 4922
% 16.26/6.11 #Demod : 6553
% 16.26/6.11 #Tautology : 4397
% 16.26/6.11 #SimpNegUnit : 270
% 16.26/6.11 #BackRed : 1
% 16.26/6.11
% 16.26/6.11 #Partial instantiations: 0
% 16.26/6.11 #Strategies tried : 1
% 16.26/6.11
% 16.26/6.11 Timing (in seconds)
% 16.26/6.11 ----------------------
% 16.26/6.11 Preprocessing : 0.48
% 16.26/6.11 Parsing : 0.23
% 16.26/6.11 CNF conversion : 0.03
% 16.26/6.11 Main loop : 4.47
% 16.26/6.11 Inferencing : 0.98
% 16.26/6.11 Reduction : 1.91
% 16.26/6.11 Demodulation : 1.44
% 16.26/6.11 BG Simplification : 0.06
% 16.26/6.11 Subsumption : 1.31
% 16.26/6.11 Abstraction : 0.07
% 16.26/6.11 MUC search : 0.00
% 16.26/6.11 Cooper : 0.00
% 16.26/6.11 Total : 5.01
% 16.26/6.11 Index Insertion : 0.00
% 16.26/6.11 Index Deletion : 0.00
% 16.26/6.11 Index Matching : 0.00
% 16.26/6.11 BG Taut test : 0.00
%------------------------------------------------------------------------------