TSTP Solution File: HEN004-5 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : HEN004-5 : 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 : n018.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.59s 1.96s
% Output : CNFRefutation 3.59s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 10
% Syntax : Number of formulae : 27 ( 18 unt; 4 typ; 0 def)
% Number of atoms : 30 ( 29 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 16 ( 9 ~; 7 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 2 ( 1 >; 1 *; 0 +; 0 <<)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 30 (; 30 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ divide > #nlpp > zero > identity > a
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(a,type,
a: $i ).
tff(divide,type,
divide: ( $i * $i ) > $i ).
tff(identity,type,
identity: $i ).
tff(zero,type,
zero: $i ).
tff(f_74,axiom,
! [X] : ( divide(X,X) = zero ),
file(unknown,unknown) ).
tff(f_57,axiom,
! [X] : ( divide(zero,X) = zero ),
file(unknown,unknown) ).
tff(f_54,axiom,
! [X,Z,Y] : ( divide(divide(divide(X,Z),divide(Y,Z)),divide(divide(X,Y),Z)) = zero ),
file(unknown,unknown) ).
tff(f_51,axiom,
! [X,Y] : ( divide(divide(X,Y),X) = zero ),
file(unknown,unknown) ).
tff(f_66,axiom,
! [X,Y] :
( ( divide(X,Y) != zero )
| ( divide(Y,X) != zero )
| ( X = Y ) ),
file(unknown,unknown) ).
tff(f_76,axiom,
divide(a,zero) != a,
file(unknown,unknown) ).
tff(c_12,plain,
! [X_10] : ( divide(X_10,X_10) = zero ),
inference(cnfTransformation,[status(thm)],[f_74]) ).
tff(c_6,plain,
! [X_6] : ( divide(zero,X_6) = zero ),
inference(cnfTransformation,[status(thm)],[f_57]) ).
tff(c_167,plain,
! [X_22,Z_23,Y_24] : ( divide(divide(divide(X_22,Z_23),divide(Y_24,Z_23)),divide(divide(X_22,Y_24),Z_23)) = zero ),
inference(cnfTransformation,[status(thm)],[f_54]) ).
tff(c_460,plain,
! [X_29,X_30] : ( divide(divide(divide(X_29,X_30),zero),divide(divide(X_29,zero),X_30)) = zero ),
inference(superposition,[status(thm),theory(equality)],[c_6,c_167]) ).
tff(c_556,plain,
! [X_29] : ( divide(divide(divide(X_29,divide(X_29,zero)),zero),zero) = zero ),
inference(superposition,[status(thm),theory(equality)],[c_12,c_460]) ).
tff(c_749,plain,
! [X_34] : ( divide(divide(divide(X_34,divide(X_34,zero)),zero),zero) = zero ),
inference(superposition,[status(thm),theory(equality)],[c_12,c_460]) ).
tff(c_2,plain,
! [X_1,Y_2] : ( divide(divide(X_1,Y_2),X_1) = zero ),
inference(cnfTransformation,[status(thm)],[f_51]) ).
tff(c_95,plain,
! [Y_16,X_17] :
( ( Y_16 = X_17 )
| ( divide(Y_16,X_17) != zero )
| ( divide(X_17,Y_16) != zero ) ),
inference(cnfTransformation,[status(thm)],[f_66]) ).
tff(c_104,plain,
! [X_1,Y_2] :
( ( divide(X_1,Y_2) = X_1 )
| ( divide(X_1,divide(X_1,Y_2)) != zero ) ),
inference(superposition,[status(thm),theory(equality)],[c_2,c_95]) ).
tff(c_793,plain,
! [X_34] :
( ( divide(divide(divide(X_34,divide(X_34,zero)),zero),zero) = divide(divide(X_34,divide(X_34,zero)),zero) )
| ( divide(divide(divide(X_34,divide(X_34,zero)),zero),zero) != zero ) ),
inference(superposition,[status(thm),theory(equality)],[c_749,c_104]) ).
tff(c_841,plain,
! [X_34] : ( divide(divide(X_34,divide(X_34,zero)),zero) = zero ),
inference(demodulation,[status(thm),theory(equality)],[c_556,c_556,c_793]) ).
tff(c_857,plain,
! [X_35] : ( divide(divide(X_35,divide(X_35,zero)),zero) = zero ),
inference(demodulation,[status(thm),theory(equality)],[c_556,c_556,c_793]) ).
tff(c_898,plain,
! [X_35] :
( ( divide(divide(X_35,divide(X_35,zero)),zero) = divide(X_35,divide(X_35,zero)) )
| ( divide(divide(X_35,divide(X_35,zero)),zero) != zero ) ),
inference(superposition,[status(thm),theory(equality)],[c_857,c_104]) ).
tff(c_965,plain,
! [X_36] : ( divide(X_36,divide(X_36,zero)) = zero ),
inference(demodulation,[status(thm),theory(equality)],[c_841,c_841,c_898]) ).
tff(c_1056,plain,
! [X_36] : ( divide(X_36,zero) = X_36 ),
inference(superposition,[status(thm),theory(equality)],[c_965,c_104]) ).
tff(c_14,plain,
divide(a,zero) != a,
inference(cnfTransformation,[status(thm)],[f_76]) ).
tff(c_1260,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_1056,c_14]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : HEN004-5 : 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.14/0.36 % Computer : n018.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:18:05 EDT 2023
% 0.14/0.36 % CPUTime :
% 3.59/1.96 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.59/1.97
% 3.59/1.97 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 3.59/2.00
% 3.59/2.00 Inference rules
% 3.59/2.00 ----------------------
% 3.59/2.00 #Ref : 0
% 3.59/2.00 #Sup : 305
% 3.59/2.00 #Fact : 0
% 3.59/2.00 #Define : 0
% 3.59/2.00 #Split : 0
% 3.59/2.00 #Chain : 0
% 3.59/2.00 #Close : 0
% 3.59/2.00
% 3.59/2.00 Ordering : KBO
% 3.59/2.00
% 3.59/2.00 Simplification rules
% 3.59/2.00 ----------------------
% 3.59/2.00 #Subsume : 8
% 3.59/2.00 #Demod : 433
% 3.59/2.00 #Tautology : 229
% 3.59/2.00 #SimpNegUnit : 0
% 3.59/2.00 #BackRed : 7
% 3.59/2.00
% 3.59/2.00 #Partial instantiations: 0
% 3.59/2.00 #Strategies tried : 1
% 3.59/2.00
% 3.59/2.00 Timing (in seconds)
% 3.59/2.00 ----------------------
% 3.59/2.01 Preprocessing : 0.41
% 3.59/2.01 Parsing : 0.23
% 3.59/2.01 CNF conversion : 0.02
% 3.59/2.01 Main loop : 0.46
% 3.59/2.01 Inferencing : 0.17
% 3.59/2.01 Reduction : 0.16
% 3.59/2.01 Demodulation : 0.13
% 3.59/2.01 BG Simplification : 0.02
% 3.59/2.01 Subsumption : 0.08
% 3.59/2.01 Abstraction : 0.03
% 3.59/2.01 MUC search : 0.00
% 3.59/2.01 Cooper : 0.00
% 3.59/2.01 Total : 0.92
% 3.59/2.01 Index Insertion : 0.00
% 3.59/2.01 Index Deletion : 0.00
% 3.59/2.01 Index Matching : 0.00
% 3.59/2.01 BG Taut test : 0.00
%------------------------------------------------------------------------------