TSTP Solution File: KLE113+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : KLE113+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/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 : n020.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:52 EDT 2023
% Result : Theorem 4.02s 2.01s
% Output : CNFRefutation 4.02s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 24
% Syntax : Number of formulae : 43 ( 27 unt; 16 typ; 0 def)
% Number of atoms : 27 ( 26 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 : 21 ( 13 >; 8 *; 0 +; 0 <<)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 15 ( 15 usr; 3 con; 0-2 aty)
% Number of variables : 21 (; 21 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ leq > multiplication > forward_diamond > forward_box > domain_difference > backward_diamond > backward_box > addition > #nlpp > domain > codomain > coantidomain > c > antidomain > zero > one > #skF_1
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(coantidomain,type,
coantidomain: $i > $i ).
tff(forward_diamond,type,
forward_diamond: ( $i * $i ) > $i ).
tff(domain,type,
domain: $i > $i ).
tff(domain_difference,type,
domain_difference: ( $i * $i ) > $i ).
tff(backward_box,type,
backward_box: ( $i * $i ) > $i ).
tff(antidomain,type,
antidomain: $i > $i ).
tff(forward_box,type,
forward_box: ( $i * $i ) > $i ).
tff(c,type,
c: $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(backward_diamond,type,
backward_diamond: ( $i * $i ) > $i ).
tff(codomain,type,
codomain: $i > $i ).
tff(leq,type,
leq: ( $i * $i ) > $o ).
tff(zero,type,
zero: $i ).
tff(f_112,axiom,
! [X0] : ( multiplication(antidomain(X0),X0) = zero ),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+4.ax',domain1) ).
tff(f_64,axiom,
! [A] : ( multiplication(A,one) = A ),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+0.ax',multiplicative_right_identity) ).
tff(f_57,axiom,
! [A] : ( addition(A,zero) = A ),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+0.ax',additive_identity) ).
tff(f_118,axiom,
! [X0] : ( domain(X0) = antidomain(antidomain(X0)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+4.ax',domain4) ).
tff(f_116,axiom,
! [X0] : ( addition(antidomain(antidomain(X0)),antidomain(X0)) = one ),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+4.ax',domain3) ).
tff(f_74,axiom,
! [A] : ( multiplication(A,zero) = zero ),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+0.ax',right_annihilation) ).
tff(f_166,axiom,
! [X0,X1] : ( forward_diamond(X0,X1) = domain(multiplication(X0,domain(X1))) ),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+6.ax',forward_diamond) ).
tff(f_177,negated_conjecture,
~ ! [X0] : ( forward_diamond(X0,zero) = zero ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).
tff(c_159,plain,
! [X0_50] : ( multiplication(antidomain(X0_50),X0_50) = zero ),
inference(cnfTransformation,[status(thm)],[f_112]) ).
tff(c_12,plain,
! [A_11] : ( multiplication(A_11,one) = A_11 ),
inference(cnfTransformation,[status(thm)],[f_64]) ).
tff(c_165,plain,
antidomain(one) = zero,
inference(superposition,[status(thm),theory(equality)],[c_159,c_12]) ).
tff(c_6,plain,
! [A_6] : ( addition(A_6,zero) = A_6 ),
inference(cnfTransformation,[status(thm)],[f_57]) ).
tff(c_203,plain,
! [X0_52] : ( antidomain(antidomain(X0_52)) = domain(X0_52) ),
inference(cnfTransformation,[status(thm)],[f_118]) ).
tff(c_224,plain,
domain(one) = antidomain(zero),
inference(superposition,[status(thm),theory(equality)],[c_165,c_203]) ).
tff(c_34,plain,
! [X0_27] : ( antidomain(antidomain(X0_27)) = domain(X0_27) ),
inference(cnfTransformation,[status(thm)],[f_118]) ).
tff(c_32,plain,
! [X0_26] : ( addition(antidomain(antidomain(X0_26)),antidomain(X0_26)) = one ),
inference(cnfTransformation,[status(thm)],[f_116]) ).
tff(c_519,plain,
! [X0_62] : ( addition(domain(X0_62),antidomain(X0_62)) = one ),
inference(demodulation,[status(thm),theory(equality)],[c_34,c_32]) ).
tff(c_559,plain,
addition(domain(one),zero) = one,
inference(superposition,[status(thm),theory(equality)],[c_165,c_519]) ).
tff(c_566,plain,
antidomain(zero) = one,
inference(demodulation,[status(thm),theory(equality)],[c_6,c_224,c_559]) ).
tff(c_579,plain,
domain(zero) = antidomain(one),
inference(superposition,[status(thm),theory(equality)],[c_566,c_34]) ).
tff(c_586,plain,
domain(zero) = zero,
inference(demodulation,[status(thm),theory(equality)],[c_165,c_579]) ).
tff(c_20,plain,
! [A_19] : ( multiplication(A_19,zero) = zero ),
inference(cnfTransformation,[status(thm)],[f_74]) ).
tff(c_962,plain,
! [X0_84,X1_85] : ( domain(multiplication(X0_84,domain(X1_85))) = forward_diamond(X0_84,X1_85) ),
inference(cnfTransformation,[status(thm)],[f_166]) ).
tff(c_989,plain,
! [X0_84] : ( domain(multiplication(X0_84,zero)) = forward_diamond(X0_84,zero) ),
inference(superposition,[status(thm),theory(equality)],[c_586,c_962]) ).
tff(c_1010,plain,
! [X0_84] : ( forward_diamond(X0_84,zero) = zero ),
inference(demodulation,[status(thm),theory(equality)],[c_586,c_20,c_989]) ).
tff(c_56,plain,
forward_diamond('#skF_1',zero) != zero,
inference(cnfTransformation,[status(thm)],[f_177]) ).
tff(c_1028,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_1010,c_56]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14 % Problem : KLE113+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/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.14/0.37 % Computer : n020.cluster.edu
% 0.14/0.37 % Model : x86_64 x86_64
% 0.14/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.37 % Memory : 8042.1875MB
% 0.14/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.37 % CPULimit : 300
% 0.14/0.37 % WCLimit : 300
% 0.14/0.37 % DateTime : Thu Aug 3 23:22:22 EDT 2023
% 0.14/0.37 % CPUTime :
% 4.02/2.01 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 4.02/2.01
% 4.02/2.01 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 4.02/2.04
% 4.02/2.04 Inference rules
% 4.02/2.04 ----------------------
% 4.02/2.04 #Ref : 0
% 4.02/2.04 #Sup : 257
% 4.02/2.04 #Fact : 0
% 4.02/2.04 #Define : 0
% 4.02/2.04 #Split : 0
% 4.02/2.04 #Chain : 0
% 4.02/2.04 #Close : 0
% 4.02/2.04
% 4.02/2.04 Ordering : KBO
% 4.02/2.04
% 4.02/2.04 Simplification rules
% 4.02/2.04 ----------------------
% 4.02/2.04 #Subsume : 0
% 4.02/2.04 #Demod : 131
% 4.02/2.04 #Tautology : 173
% 4.02/2.04 #SimpNegUnit : 0
% 4.02/2.04 #BackRed : 6
% 4.02/2.04
% 4.02/2.04 #Partial instantiations: 0
% 4.02/2.04 #Strategies tried : 1
% 4.02/2.04
% 4.02/2.04 Timing (in seconds)
% 4.02/2.04 ----------------------
% 4.02/2.04 Preprocessing : 0.50
% 4.02/2.04 Parsing : 0.28
% 4.02/2.04 CNF conversion : 0.03
% 4.02/2.04 Main loop : 0.45
% 4.02/2.04 Inferencing : 0.15
% 4.02/2.04 Reduction : 0.17
% 4.02/2.04 Demodulation : 0.13
% 4.02/2.04 BG Simplification : 0.03
% 4.02/2.04 Subsumption : 0.08
% 4.02/2.04 Abstraction : 0.02
% 4.02/2.04 MUC search : 0.00
% 4.02/2.04 Cooper : 0.00
% 4.02/2.04 Total : 1.00
% 4.02/2.04 Index Insertion : 0.00
% 4.02/2.04 Index Deletion : 0.00
% 4.02/2.04 Index Matching : 0.00
% 4.02/2.04 BG Taut test : 0.00
%------------------------------------------------------------------------------