TSTP Solution File: HEN004-6 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : HEN004-6 : 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 : n028.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:13 EDT 2023
% Result : Unsatisfiable 4.05s 2.07s
% Output : CNFRefutation 4.05s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 13
% Syntax : Number of formulae : 39 ( 21 unt; 5 typ; 0 def)
% Number of atoms : 50 ( 28 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 34 ( 18 ~; 16 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 5 ( 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 : 4 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 49 (; 49 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ less_equal > divide > #nlpp > zero > identity > 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(identity,type,
identity: $i ).
tff(zero,type,
zero: $i ).
tff(f_81,axiom,
! [X] : ( divide(zero,X) = zero ),
file(unknown,unknown) ).
tff(f_56,axiom,
! [X,Y] : less_equal(divide(X,Y),X),
file(unknown,unknown) ).
tff(f_48,axiom,
! [X,Y] :
( ~ less_equal(X,Y)
| ( divide(X,Y) = zero ) ),
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_53,axiom,
! [X,Y] :
( ( divide(X,Y) != zero )
| less_equal(X,Y) ),
file(unknown,unknown) ).
tff(f_71,axiom,
! [X,Y] :
( ~ less_equal(X,Y)
| ~ less_equal(Y,X)
| ( X = Y ) ),
file(unknown,unknown) ).
tff(f_62,axiom,
! [X] : less_equal(zero,X),
file(unknown,unknown) ).
tff(f_83,axiom,
divide(a,zero) != a,
file(unknown,unknown) ).
tff(c_18,plain,
! [X_15] : ( divide(zero,X_15) = zero ),
inference(cnfTransformation,[status(thm)],[f_81]) ).
tff(c_6,plain,
! [X_5,Y_6] : less_equal(divide(X_5,Y_6),X_5),
inference(cnfTransformation,[status(thm)],[f_56]) ).
tff(c_54,plain,
! [X_22,Y_23] :
( ( divide(X_22,Y_23) = zero )
| ~ less_equal(X_22,Y_23) ),
inference(cnfTransformation,[status(thm)],[f_48]) ).
tff(c_64,plain,
! [X_5,Y_6] : ( divide(divide(X_5,Y_6),X_5) = zero ),
inference(resolution,[status(thm)],[c_6,c_54]) ).
tff(c_189,plain,
! [X_36,Z_37,Y_38] : less_equal(divide(divide(X_36,Z_37),divide(Y_38,Z_37)),divide(divide(X_36,Y_38),Z_37)),
inference(cnfTransformation,[status(thm)],[f_59]) ).
tff(c_386,plain,
! [X_45,Y_46] : less_equal(divide(divide(X_45,X_45),divide(Y_46,X_45)),zero),
inference(superposition,[status(thm),theory(equality)],[c_64,c_189]) ).
tff(c_439,plain,
! [X_47] : less_equal(divide(divide(X_47,X_47),zero),zero),
inference(superposition,[status(thm),theory(equality)],[c_64,c_386]) ).
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_109,plain,
! [Y_28,X_29] :
( ( Y_28 = X_29 )
| ~ less_equal(Y_28,X_29)
| ~ less_equal(X_29,Y_28) ),
inference(cnfTransformation,[status(thm)],[f_71]) ).
tff(c_118,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_109]) ).
tff(c_442,plain,
! [X_47] :
( ( divide(divide(X_47,X_47),zero) = zero )
| ( divide(zero,divide(divide(X_47,X_47),zero)) != zero ) ),
inference(resolution,[status(thm)],[c_439,c_118]) ).
tff(c_477,plain,
! [X_48] : ( divide(divide(X_48,X_48),zero) = zero ),
inference(demodulation,[status(thm),theory(equality)],[c_18,c_442]) ).
tff(c_10,plain,
! [X_10] : less_equal(zero,X_10),
inference(cnfTransformation,[status(thm)],[f_62]) ).
tff(c_122,plain,
! [X_30] :
( ( zero = X_30 )
| ~ less_equal(X_30,zero) ),
inference(resolution,[status(thm)],[c_10,c_109]) ).
tff(c_135,plain,
! [X_3] :
( ( zero = X_3 )
| ( divide(X_3,zero) != zero ) ),
inference(resolution,[status(thm)],[c_4,c_122]) ).
tff(c_533,plain,
! [X_48] : ( divide(X_48,X_48) = zero ),
inference(superposition,[status(thm),theory(equality)],[c_477,c_135]) ).
tff(c_631,plain,
! [X_50,X_51] : less_equal(divide(divide(X_50,X_51),zero),divide(divide(X_50,zero),X_51)),
inference(superposition,[status(thm),theory(equality)],[c_18,c_189]) ).
tff(c_1183,plain,
! [X_58] : less_equal(divide(divide(X_58,divide(X_58,zero)),zero),zero),
inference(superposition,[status(thm),theory(equality)],[c_533,c_631]) ).
tff(c_1186,plain,
! [X_58] :
( ( divide(divide(X_58,divide(X_58,zero)),zero) = zero )
| ( divide(zero,divide(divide(X_58,divide(X_58,zero)),zero)) != zero ) ),
inference(resolution,[status(thm)],[c_1183,c_118]) ).
tff(c_1232,plain,
! [X_59] : ( divide(divide(X_59,divide(X_59,zero)),zero) = zero ),
inference(demodulation,[status(thm),theory(equality)],[c_18,c_1186]) ).
tff(c_1327,plain,
! [X_59] : ( divide(X_59,divide(X_59,zero)) = zero ),
inference(superposition,[status(thm),theory(equality)],[c_1232,c_135]) ).
tff(c_248,plain,
! [X_39,Y_40] :
( ( divide(X_39,Y_40) = X_39 )
| ~ less_equal(X_39,divide(X_39,Y_40)) ),
inference(resolution,[status(thm)],[c_6,c_109]) ).
tff(c_1621,plain,
! [X_64,Y_65] :
( ( divide(X_64,Y_65) = X_64 )
| ( divide(X_64,divide(X_64,Y_65)) != zero ) ),
inference(resolution,[status(thm)],[c_4,c_248]) ).
tff(c_1654,plain,
! [X_59] : ( divide(X_59,zero) = X_59 ),
inference(superposition,[status(thm),theory(equality)],[c_1327,c_1621]) ).
tff(c_20,plain,
divide(a,zero) != a,
inference(cnfTransformation,[status(thm)],[f_83]) ).
tff(c_1704,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_1654,c_20]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14 % Problem : HEN004-6 : TPTP v8.1.2. Released v1.0.0.
% 0.00/0.15 % 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.36 % Computer : n028.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Thu Aug 3 13:24:09 EDT 2023
% 0.14/0.36 % CPUTime :
% 4.05/2.07 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 4.05/2.07
% 4.05/2.07 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 4.05/2.10
% 4.05/2.10 Inference rules
% 4.05/2.10 ----------------------
% 4.05/2.10 #Ref : 0
% 4.05/2.10 #Sup : 392
% 4.05/2.10 #Fact : 0
% 4.05/2.10 #Define : 0
% 4.05/2.10 #Split : 0
% 4.05/2.10 #Chain : 0
% 4.05/2.10 #Close : 0
% 4.05/2.10
% 4.05/2.10 Ordering : KBO
% 4.05/2.10
% 4.05/2.10 Simplification rules
% 4.05/2.10 ----------------------
% 4.05/2.10 #Subsume : 26
% 4.05/2.10 #Demod : 540
% 4.05/2.10 #Tautology : 275
% 4.05/2.10 #SimpNegUnit : 0
% 4.05/2.10 #BackRed : 11
% 4.05/2.10
% 4.05/2.10 #Partial instantiations: 0
% 4.05/2.10 #Strategies tried : 1
% 4.05/2.10
% 4.05/2.10 Timing (in seconds)
% 4.05/2.10 ----------------------
% 4.05/2.11 Preprocessing : 0.42
% 4.05/2.11 Parsing : 0.23
% 4.05/2.11 CNF conversion : 0.02
% 4.05/2.11 Main loop : 0.53
% 4.05/2.11 Inferencing : 0.21
% 4.05/2.11 Reduction : 0.18
% 4.05/2.11 Demodulation : 0.14
% 4.05/2.11 BG Simplification : 0.02
% 4.05/2.11 Subsumption : 0.09
% 4.05/2.11 Abstraction : 0.03
% 4.05/2.11 MUC search : 0.00
% 4.05/2.11 Cooper : 0.00
% 4.05/2.11 Total : 1.00
% 4.05/2.11 Index Insertion : 0.00
% 4.05/2.11 Index Deletion : 0.00
% 4.05/2.11 Index Matching : 0.00
% 4.05/2.11 BG Taut test : 0.00
%------------------------------------------------------------------------------