TSTP Solution File: HEN008-4 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : HEN008-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 : n022.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 9.28s 3.24s
% Output : CNFRefutation 9.28s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 15
% Syntax : Number of formulae : 29 ( 14 unt; 7 typ; 0 def)
% Number of atoms : 32 ( 13 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 23 ( 13 ~; 10 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 3 ( 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 : 6 ( 6 usr; 5 con; 0-2 aty)
% Number of variables : 27 (; 27 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ less_equal > divide > #nlpp > zero > identity > c > b > 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(b,type,
b: $i ).
tff(identity,type,
identity: $i ).
tff(zero,type,
zero: $i ).
tff(c,type,
c: $i ).
tff(f_62,axiom,
! [X] : less_equal(zero,X),
file(unknown,unknown) ).
tff(f_81,axiom,
! [X] : ( divide(zero,X) = zero ),
file(unknown,unknown) ).
tff(f_103,axiom,
less_equal(a,b),
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_71,axiom,
! [X,Y] :
( ~ less_equal(X,Y)
| ~ less_equal(Y,X)
| ( X = Y ) ),
file(unknown,unknown) ).
tff(f_53,axiom,
! [X,Y] :
( ( divide(X,Y) != zero )
| less_equal(X,Y) ),
file(unknown,unknown) ).
tff(f_105,axiom,
~ less_equal(divide(a,c),divide(b,c)),
file(unknown,unknown) ).
tff(c_10,plain,
! [X_10] : less_equal(zero,X_10),
inference(cnfTransformation,[status(thm)],[f_62]) ).
tff(c_18,plain,
! [X_15] : ( divide(zero,X_15) = zero ),
inference(cnfTransformation,[status(thm)],[f_81]) ).
tff(c_30,plain,
less_equal(a,b),
inference(cnfTransformation,[status(thm)],[f_103]) ).
tff(c_100,plain,
! [X_33,Y_34] :
( ( divide(X_33,Y_34) = zero )
| ~ less_equal(X_33,Y_34) ),
inference(cnfTransformation,[status(thm)],[f_48]) ).
tff(c_123,plain,
divide(a,b) = zero,
inference(resolution,[status(thm)],[c_30,c_100]) ).
tff(c_429,plain,
! [X_56,Z_57,Y_58] : less_equal(divide(divide(X_56,Z_57),divide(Y_58,Z_57)),divide(divide(X_56,Y_58),Z_57)),
inference(cnfTransformation,[status(thm)],[f_59]) ).
tff(c_12,plain,
! [Y_12,X_11] :
( ( Y_12 = X_11 )
| ~ less_equal(Y_12,X_11)
| ~ less_equal(X_11,Y_12) ),
inference(cnfTransformation,[status(thm)],[f_71]) ).
tff(c_12222,plain,
! [X_232,Z_233,Y_234] :
( ( divide(divide(X_232,Z_233),divide(Y_234,Z_233)) = divide(divide(X_232,Y_234),Z_233) )
| ~ less_equal(divide(divide(X_232,Y_234),Z_233),divide(divide(X_232,Z_233),divide(Y_234,Z_233))) ),
inference(resolution,[status(thm)],[c_429,c_12]) ).
tff(c_12499,plain,
! [Z_233] :
( ( divide(divide(a,Z_233),divide(b,Z_233)) = divide(divide(a,b),Z_233) )
| ~ less_equal(divide(zero,Z_233),divide(divide(a,Z_233),divide(b,Z_233))) ),
inference(superposition,[status(thm),theory(equality)],[c_123,c_12222]) ).
tff(c_12682,plain,
! [Z_233] : ( divide(divide(a,Z_233),divide(b,Z_233)) = zero ),
inference(demodulation,[status(thm),theory(equality)],[c_10,c_18,c_18,c_123,c_12499]) ).
tff(c_179,plain,
! [X_37,Y_38] :
( less_equal(X_37,Y_38)
| ( divide(X_37,Y_38) != zero ) ),
inference(cnfTransformation,[status(thm)],[f_53]) ).
tff(c_32,plain,
~ less_equal(divide(a,c),divide(b,c)),
inference(cnfTransformation,[status(thm)],[f_105]) ).
tff(c_186,plain,
divide(divide(a,c),divide(b,c)) != zero,
inference(resolution,[status(thm)],[c_179,c_32]) ).
tff(c_12716,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_12682,c_186]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : HEN008-4 : TPTP v8.1.2. Released v1.0.0.
% 0.00/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 : n022.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:07:03 EDT 2023
% 0.12/0.34 % CPUTime :
% 9.28/3.24 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 9.28/3.25
% 9.28/3.25 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 9.28/3.27
% 9.28/3.27 Inference rules
% 9.28/3.27 ----------------------
% 9.28/3.27 #Ref : 0
% 9.28/3.27 #Sup : 3061
% 9.28/3.27 #Fact : 0
% 9.28/3.28 #Define : 0
% 9.28/3.28 #Split : 5
% 9.28/3.28 #Chain : 0
% 9.28/3.28 #Close : 0
% 9.28/3.28
% 9.28/3.28 Ordering : KBO
% 9.28/3.28
% 9.28/3.28 Simplification rules
% 9.28/3.28 ----------------------
% 9.28/3.28 #Subsume : 675
% 9.28/3.28 #Demod : 2931
% 9.28/3.28 #Tautology : 1396
% 9.28/3.28 #SimpNegUnit : 37
% 9.28/3.28 #BackRed : 17
% 9.28/3.28
% 9.28/3.28 #Partial instantiations: 0
% 9.28/3.28 #Strategies tried : 1
% 9.28/3.28
% 9.28/3.28 Timing (in seconds)
% 9.28/3.28 ----------------------
% 9.28/3.28 Preprocessing : 0.43
% 9.28/3.28 Parsing : 0.23
% 9.28/3.28 CNF conversion : 0.03
% 9.28/3.28 Main loop : 1.79
% 9.28/3.28 Inferencing : 0.56
% 9.28/3.28 Reduction : 0.69
% 9.28/3.28 Demodulation : 0.52
% 9.28/3.28 BG Simplification : 0.05
% 9.28/3.28 Subsumption : 0.38
% 9.28/3.28 Abstraction : 0.06
% 9.28/3.28 MUC search : 0.00
% 9.28/3.28 Cooper : 0.00
% 9.28/3.28 Total : 2.28
% 9.28/3.28 Index Insertion : 0.00
% 9.28/3.28 Index Deletion : 0.00
% 9.28/3.28 Index Matching : 0.00
% 9.28/3.28 BG Taut test : 0.00
%------------------------------------------------------------------------------