TSTP Solution File: HEN004-4 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : HEN004-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:13 EDT 2023
% Result : Unsatisfiable 3.39s 1.86s
% Output : CNFRefutation 3.44s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 12
% Syntax : Number of formulae : 31 ( 17 unt; 5 typ; 0 def)
% Number of atoms : 39 ( 24 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 28 ( 15 ~; 13 |; 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 : 37 (; 37 !; 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_83,axiom,
! [X] : ( divide(X,X) = 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_56,axiom,
! [X,Y] : less_equal(divide(X,Y),X),
file(unknown,unknown) ).
tff(f_85,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_20,plain,
! [X_16] : ( divide(X_16,X_16) = zero ),
inference(cnfTransformation,[status(thm)],[f_83]) ).
tff(c_217,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_517,plain,
! [X_49,X_50] : less_equal(divide(divide(X_49,X_50),zero),divide(divide(X_49,zero),X_50)),
inference(superposition,[status(thm),theory(equality)],[c_18,c_217]) ).
tff(c_587,plain,
! [X_51] : less_equal(divide(divide(X_51,divide(X_51,zero)),zero),zero),
inference(superposition,[status(thm),theory(equality)],[c_20,c_517]) ).
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_103,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_112,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_103]) ).
tff(c_590,plain,
! [X_51] :
( ( divide(divide(X_51,divide(X_51,zero)),zero) = zero )
| ( divide(zero,divide(divide(X_51,divide(X_51,zero)),zero)) != zero ) ),
inference(resolution,[status(thm)],[c_587,c_112]) ).
tff(c_619,plain,
! [X_51] : ( divide(divide(X_51,divide(X_51,zero)),zero) = zero ),
inference(demodulation,[status(thm),theory(equality)],[c_18,c_590]) ).
tff(c_632,plain,
! [X_52] : ( divide(divide(X_52,divide(X_52,zero)),zero) = zero ),
inference(demodulation,[status(thm),theory(equality)],[c_18,c_590]) ).
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_293,plain,
! [Y_39,X_40] :
( ( Y_39 = X_40 )
| ~ less_equal(Y_39,X_40)
| ( divide(X_40,Y_39) != zero ) ),
inference(resolution,[status(thm)],[c_4,c_103]) ).
tff(c_311,plain,
! [X_5,Y_6] :
( ( divide(X_5,Y_6) = X_5 )
| ( divide(X_5,divide(X_5,Y_6)) != zero ) ),
inference(resolution,[status(thm)],[c_6,c_293]) ).
tff(c_652,plain,
! [X_52] :
( ( divide(divide(X_52,divide(X_52,zero)),zero) = divide(X_52,divide(X_52,zero)) )
| ( divide(divide(X_52,divide(X_52,zero)),zero) != zero ) ),
inference(superposition,[status(thm),theory(equality)],[c_632,c_311]) ).
tff(c_727,plain,
! [X_53] : ( divide(X_53,divide(X_53,zero)) = zero ),
inference(demodulation,[status(thm),theory(equality)],[c_619,c_619,c_652]) ).
tff(c_804,plain,
! [X_53] : ( divide(X_53,zero) = X_53 ),
inference(superposition,[status(thm),theory(equality)],[c_727,c_311]) ).
tff(c_22,plain,
divide(a,zero) != a,
inference(cnfTransformation,[status(thm)],[f_85]) ).
tff(c_848,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_804,c_22]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : HEN004-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.13/0.35 % Computer : n005.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Thu Aug 3 13:08:26 EDT 2023
% 0.13/0.35 % CPUTime :
% 3.39/1.86 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.39/1.86
% 3.39/1.86 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 3.44/1.89
% 3.44/1.89 Inference rules
% 3.44/1.89 ----------------------
% 3.44/1.89 #Ref : 0
% 3.44/1.89 #Sup : 189
% 3.44/1.89 #Fact : 0
% 3.44/1.89 #Define : 0
% 3.44/1.89 #Split : 0
% 3.44/1.89 #Chain : 0
% 3.44/1.89 #Close : 0
% 3.44/1.89
% 3.44/1.89 Ordering : KBO
% 3.44/1.89
% 3.44/1.89 Simplification rules
% 3.44/1.89 ----------------------
% 3.44/1.89 #Subsume : 17
% 3.44/1.89 #Demod : 195
% 3.44/1.89 #Tautology : 131
% 3.44/1.89 #SimpNegUnit : 0
% 3.44/1.89 #BackRed : 6
% 3.44/1.89
% 3.44/1.89 #Partial instantiations: 0
% 3.44/1.89 #Strategies tried : 1
% 3.44/1.89
% 3.44/1.89 Timing (in seconds)
% 3.44/1.89 ----------------------
% 3.44/1.89 Preprocessing : 0.41
% 3.44/1.89 Parsing : 0.22
% 3.44/1.89 CNF conversion : 0.02
% 3.44/1.89 Main loop : 0.43
% 3.44/1.89 Inferencing : 0.17
% 3.44/1.89 Reduction : 0.13
% 3.44/1.89 Demodulation : 0.10
% 3.44/1.89 BG Simplification : 0.02
% 3.44/1.89 Subsumption : 0.08
% 3.44/1.89 Abstraction : 0.02
% 3.44/1.89 MUC search : 0.00
% 3.44/1.90 Cooper : 0.00
% 3.44/1.90 Total : 0.89
% 3.44/1.90 Index Insertion : 0.00
% 3.44/1.90 Index Deletion : 0.00
% 3.44/1.90 Index Matching : 0.00
% 3.44/1.90 BG Taut test : 0.00
%------------------------------------------------------------------------------