TSTP Solution File: HEN002-4 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : HEN002-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/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 : n009.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.24s 1.64s
% Output : CNFRefutation 2.24s
% 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_62,axiom,
! [X] : less_equal(zero,X),
file(unknown,unknown) ).
tff(f_48,axiom,
! [X,Y] :
( ~ less_equal(X,Y)
| ( divide(X,Y) = zero ) ),
file(unknown,unknown) ).
tff(f_81,axiom,
divide(zero,a) != zero,
file(unknown,unknown) ).
tff(c_10,plain,
! [X_10] : less_equal(zero,X_10),
inference(cnfTransformation,[status(thm)],[f_62]) ).
tff(c_33,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_44,plain,
! [X_10] : ( divide(zero,X_10) = zero ),
inference(resolution,[status(thm)],[c_10,c_33]) ).
tff(c_18,plain,
divide(zero,a) != zero,
inference(cnfTransformation,[status(thm)],[f_81]) ).
tff(c_49,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_44,c_18]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : HEN002-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/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.13/0.35 % Computer : n009.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:04:54 EDT 2023
% 0.13/0.35 % CPUTime :
% 2.24/1.64 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.24/1.64
% 2.24/1.64 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 2.24/1.67
% 2.24/1.67 Inference rules
% 2.24/1.67 ----------------------
% 2.24/1.67 #Ref : 0
% 2.24/1.67 #Sup : 6
% 2.24/1.67 #Fact : 0
% 2.24/1.67 #Define : 0
% 2.24/1.67 #Split : 0
% 2.24/1.67 #Chain : 0
% 2.24/1.67 #Close : 0
% 2.24/1.67
% 2.24/1.67 Ordering : KBO
% 2.24/1.67
% 2.24/1.67 Simplification rules
% 2.24/1.67 ----------------------
% 2.24/1.67 #Subsume : 0
% 2.24/1.67 #Demod : 3
% 2.24/1.67 #Tautology : 4
% 2.24/1.67 #SimpNegUnit : 0
% 2.24/1.67 #BackRed : 1
% 2.24/1.67
% 2.24/1.67 #Partial instantiations: 0
% 2.24/1.67 #Strategies tried : 1
% 2.24/1.67
% 2.24/1.67 Timing (in seconds)
% 2.24/1.67 ----------------------
% 2.24/1.67 Preprocessing : 0.41
% 2.24/1.67 Parsing : 0.22
% 2.24/1.67 CNF conversion : 0.02
% 2.24/1.67 Main loop : 0.15
% 2.24/1.67 Inferencing : 0.07
% 2.24/1.67 Reduction : 0.04
% 2.24/1.67 Demodulation : 0.03
% 2.24/1.67 BG Simplification : 0.01
% 2.24/1.67 Subsumption : 0.03
% 2.24/1.67 Abstraction : 0.00
% 2.24/1.67 MUC search : 0.00
% 2.24/1.67 Cooper : 0.00
% 2.24/1.67 Total : 0.60
% 2.24/1.67 Index Insertion : 0.00
% 2.24/1.67 Index Deletion : 0.00
% 2.24/1.67 Index Matching : 0.00
% 2.24/1.68 BG Taut test : 0.00
%------------------------------------------------------------------------------