TSTP Solution File: HEN001-3 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : HEN001-3 : 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:11 EDT 2023
% Result : Unsatisfiable 2.71s 1.62s
% Output : CNFRefutation 2.71s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 8
% Syntax : Number of formulae : 13 ( 6 unt; 5 typ; 0 def)
% Number of atoms : 10 ( 5 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 6 ( 4 ~; 2 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 avg)
% Maximal term depth : 2 ( 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 : 7 (; 7 !; 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_74,axiom,
! [X] : less_equal(X,identity),
file(unknown,unknown) ).
tff(f_48,axiom,
! [X,Y] :
( ~ less_equal(X,Y)
| ( divide(X,Y) = zero ) ),
file(unknown,unknown) ).
tff(f_79,axiom,
divide(a,identity) != zero,
file(unknown,unknown) ).
tff(c_14,plain,
! [X_13] : less_equal(X_13,identity),
inference(cnfTransformation,[status(thm)],[f_74]) ).
tff(c_21,plain,
! [X_20,Y_21] :
( ( divide(X_20,Y_21) = zero )
| ~ less_equal(X_20,Y_21) ),
inference(cnfTransformation,[status(thm)],[f_48]) ).
tff(c_37,plain,
! [X_13] : ( divide(X_13,identity) = zero ),
inference(resolution,[status(thm)],[c_14,c_21]) ).
tff(c_16,plain,
divide(a,identity) != zero,
inference(cnfTransformation,[status(thm)],[f_79]) ).
tff(c_51,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_37,c_16]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : HEN001-3 : 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.19/0.36 % Computer : n005.cluster.edu
% 0.19/0.36 % Model : x86_64 x86_64
% 0.19/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.19/0.36 % Memory : 8042.1875MB
% 0.19/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.19/0.36 % CPULimit : 300
% 0.19/0.36 % WCLimit : 300
% 0.19/0.36 % DateTime : Thu Aug 3 13:06:56 EDT 2023
% 0.19/0.36 % CPUTime :
% 2.71/1.62 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.71/1.62
% 2.71/1.62 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 2.71/1.65
% 2.71/1.65 Inference rules
% 2.71/1.65 ----------------------
% 2.71/1.65 #Ref : 0
% 2.71/1.65 #Sup : 7
% 2.71/1.65 #Fact : 0
% 2.71/1.65 #Define : 0
% 2.71/1.65 #Split : 0
% 2.71/1.65 #Chain : 0
% 2.71/1.65 #Close : 0
% 2.71/1.65
% 2.71/1.65 Ordering : KBO
% 2.71/1.65
% 2.71/1.65 Simplification rules
% 2.71/1.65 ----------------------
% 2.71/1.65 #Subsume : 0
% 2.71/1.65 #Demod : 2
% 2.71/1.65 #Tautology : 4
% 2.71/1.65 #SimpNegUnit : 0
% 2.71/1.65 #BackRed : 1
% 2.71/1.65
% 2.71/1.65 #Partial instantiations: 0
% 2.71/1.65 #Strategies tried : 1
% 2.71/1.65
% 2.71/1.65 Timing (in seconds)
% 2.71/1.65 ----------------------
% 2.71/1.65 Preprocessing : 0.41
% 2.71/1.65 Parsing : 0.22
% 2.71/1.65 CNF conversion : 0.02
% 2.71/1.65 Main loop : 0.17
% 2.71/1.65 Inferencing : 0.08
% 2.71/1.65 Reduction : 0.04
% 2.71/1.65 Demodulation : 0.03
% 2.71/1.65 BG Simplification : 0.01
% 2.71/1.65 Subsumption : 0.04
% 2.71/1.65 Abstraction : 0.00
% 2.71/1.65 MUC search : 0.00
% 2.71/1.65 Cooper : 0.00
% 2.71/1.65 Total : 0.62
% 2.71/1.65 Index Insertion : 0.00
% 2.71/1.65 Index Deletion : 0.00
% 2.71/1.65 Index Matching : 0.00
% 2.71/1.65 BG Taut test : 0.00
%------------------------------------------------------------------------------