TSTP Solution File: KLE053+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : KLE053+1 : TPTP v8.1.2. Released v4.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 : n011.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:44:46 EDT 2023
% Result : Theorem 3.23s 1.77s
% Output : CNFRefutation 3.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 10
% Syntax : Number of formulae : 16 ( 9 unt; 7 typ; 0 def)
% Number of atoms : 9 ( 8 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 2 ( 2 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 3 ( 2 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 7 ( 4 >; 3 *; 0 +; 0 <<)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 9 (; 9 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ leq > multiplication > addition > #nlpp > domain > zero > one > #skF_1
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(domain,type,
domain: $i > $i ).
tff(multiplication,type,
multiplication: ( $i * $i ) > $i ).
tff(addition,type,
addition: ( $i * $i ) > $i ).
tff('#skF_1',type,
'#skF_1': $i ).
tff(one,type,
one: $i ).
tff(leq,type,
leq: ( $i * $i ) > $o ).
tff(zero,type,
zero: $i ).
tff(f_65,axiom,
! [A] : ( multiplication(one,A) = A ),
file('/export/starexec/sandbox/benchmark/Axioms/KLE001+0.ax',multiplicative_left_identity) ).
tff(f_115,axiom,
! [X0,X1] : ( domain(multiplication(X0,X1)) = domain(multiplication(X0,domain(X1))) ),
file('/export/starexec/sandbox/benchmark/Axioms/KLE001+5.ax',domain2) ).
tff(f_125,negated_conjecture,
~ ! [X0] : ( domain(domain(X0)) = domain(X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).
tff(c_14,plain,
! [A_12] : ( multiplication(one,A_12) = A_12 ),
inference(cnfTransformation,[status(thm)],[f_65]) ).
tff(c_299,plain,
! [X0_44,X1_45] : ( domain(multiplication(X0_44,domain(X1_45))) = domain(multiplication(X0_44,X1_45)) ),
inference(cnfTransformation,[status(thm)],[f_115]) ).
tff(c_319,plain,
! [X1_45] : ( domain(multiplication(one,X1_45)) = domain(domain(X1_45)) ),
inference(superposition,[status(thm),theory(equality)],[c_14,c_299]) ).
tff(c_333,plain,
! [X1_45] : ( domain(domain(X1_45)) = domain(X1_45) ),
inference(demodulation,[status(thm),theory(equality)],[c_14,c_319]) ).
tff(c_38,plain,
domain(domain('#skF_1')) != domain('#skF_1'),
inference(cnfTransformation,[status(thm)],[f_125]) ).
tff(c_338,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_333,c_38]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14 % Problem : KLE053+1 : TPTP v8.1.2. Released v4.0.0.
% 0.00/0.15 % 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.16/0.36 % Computer : n011.cluster.edu
% 0.16/0.36 % Model : x86_64 x86_64
% 0.16/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.36 % Memory : 8042.1875MB
% 0.16/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.36 % CPULimit : 300
% 0.16/0.36 % WCLimit : 300
% 0.16/0.36 % DateTime : Thu Aug 3 23:25:06 EDT 2023
% 0.16/0.37 % CPUTime :
% 3.23/1.77 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.23/1.78
% 3.23/1.78 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 3.23/1.80
% 3.23/1.80 Inference rules
% 3.23/1.80 ----------------------
% 3.23/1.80 #Ref : 0
% 3.23/1.80 #Sup : 72
% 3.23/1.80 #Fact : 0
% 3.23/1.80 #Define : 0
% 3.23/1.80 #Split : 0
% 3.23/1.80 #Chain : 0
% 3.23/1.80 #Close : 0
% 3.23/1.80
% 3.23/1.80 Ordering : KBO
% 3.23/1.80
% 3.23/1.80 Simplification rules
% 3.23/1.80 ----------------------
% 3.23/1.80 #Subsume : 0
% 3.23/1.80 #Demod : 29
% 3.23/1.80 #Tautology : 67
% 3.23/1.80 #SimpNegUnit : 0
% 3.23/1.80 #BackRed : 1
% 3.23/1.80
% 3.23/1.80 #Partial instantiations: 0
% 3.23/1.80 #Strategies tried : 1
% 3.23/1.80
% 3.23/1.80 Timing (in seconds)
% 3.23/1.80 ----------------------
% 3.23/1.80 Preprocessing : 0.47
% 3.23/1.80 Parsing : 0.26
% 3.23/1.80 CNF conversion : 0.03
% 3.23/1.80 Main loop : 0.27
% 3.23/1.80 Inferencing : 0.09
% 3.23/1.80 Reduction : 0.10
% 3.23/1.80 Demodulation : 0.08
% 3.23/1.80 BG Simplification : 0.02
% 3.23/1.80 Subsumption : 0.05
% 3.23/1.80 Abstraction : 0.01
% 3.23/1.80 MUC search : 0.00
% 3.23/1.80 Cooper : 0.00
% 3.23/1.80 Total : 0.78
% 3.23/1.80 Index Insertion : 0.00
% 3.23/1.80 Index Deletion : 0.00
% 3.23/1.80 Index Matching : 0.00
% 3.23/1.80 BG Taut test : 0.00
%------------------------------------------------------------------------------