TSTP Solution File: KLE119+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : KLE119+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 : n027.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 3.81s 2.00s
% Output : CNFRefutation 4.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 26
% Syntax : Number of formulae : 48 ( 31 unt; 17 typ; 0 def)
% Number of atoms : 31 ( 30 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 4 ( 4 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 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 : 16 ( 16 usr; 4 con; 0-2 aty)
% Number of variables : 26 (; 26 !; 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_2 > #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_2',type,
'#skF_2': $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_57,axiom,
! [A] : ( addition(A,zero) = A ),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+0.ax',additive_identity) ).
tff(f_121,axiom,
! [X0] : ( multiplication(X0,coantidomain(X0)) = zero ),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+4.ax',codomain1) ).
tff(f_66,axiom,
! [A] : ( multiplication(one,A) = A ),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+0.ax',multiplicative_left_identity) ).
tff(f_127,axiom,
! [X0] : ( codomain(X0) = coantidomain(coantidomain(X0)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+4.ax',codomain4) ).
tff(f_125,axiom,
! [X0] : ( addition(coantidomain(coantidomain(X0)),coantidomain(X0)) = one ),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+4.ax',codomain3) ).
tff(f_74,axiom,
! [A] : ( multiplication(A,zero) = zero ),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+0.ax',right_annihilation) ).
tff(f_168,axiom,
! [X0,X1] : ( backward_diamond(X0,X1) = codomain(multiplication(codomain(X1),X0)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+6.ax',backward_diamond) ).
tff(f_53,axiom,
! [A,B] : ( addition(A,B) = addition(B,A) ),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+0.ax',additive_commutativity) ).
tff(f_177,negated_conjecture,
~ ! [X0,X1] : ( addition(backward_diamond(zero,domain(X0)),domain(X1)) = domain(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).
tff(c_6,plain,
! [A_6] : ( addition(A_6,zero) = A_6 ),
inference(cnfTransformation,[status(thm)],[f_57]) ).
tff(c_192,plain,
! [X0_51] : ( multiplication(X0_51,coantidomain(X0_51)) = zero ),
inference(cnfTransformation,[status(thm)],[f_121]) ).
tff(c_14,plain,
! [A_12] : ( multiplication(one,A_12) = A_12 ),
inference(cnfTransformation,[status(thm)],[f_66]) ).
tff(c_198,plain,
coantidomain(one) = zero,
inference(superposition,[status(thm),theory(equality)],[c_192,c_14]) ).
tff(c_249,plain,
! [X0_53] : ( coantidomain(coantidomain(X0_53)) = codomain(X0_53) ),
inference(cnfTransformation,[status(thm)],[f_127]) ).
tff(c_267,plain,
codomain(one) = coantidomain(zero),
inference(superposition,[status(thm),theory(equality)],[c_198,c_249]) ).
tff(c_42,plain,
! [X0_32] : ( coantidomain(coantidomain(X0_32)) = codomain(X0_32) ),
inference(cnfTransformation,[status(thm)],[f_127]) ).
tff(c_40,plain,
! [X0_31] : ( addition(coantidomain(coantidomain(X0_31)),coantidomain(X0_31)) = one ),
inference(cnfTransformation,[status(thm)],[f_125]) ).
tff(c_412,plain,
! [X0_58] : ( addition(codomain(X0_58),coantidomain(X0_58)) = one ),
inference(demodulation,[status(thm),theory(equality)],[c_42,c_40]) ).
tff(c_437,plain,
addition(codomain(one),zero) = one,
inference(superposition,[status(thm),theory(equality)],[c_198,c_412]) ).
tff(c_441,plain,
coantidomain(zero) = one,
inference(demodulation,[status(thm),theory(equality)],[c_6,c_267,c_437]) ).
tff(c_449,plain,
codomain(zero) = coantidomain(one),
inference(superposition,[status(thm),theory(equality)],[c_441,c_42]) ).
tff(c_455,plain,
codomain(zero) = zero,
inference(demodulation,[status(thm),theory(equality)],[c_198,c_449]) ).
tff(c_20,plain,
! [A_19] : ( multiplication(A_19,zero) = zero ),
inference(cnfTransformation,[status(thm)],[f_74]) ).
tff(c_892,plain,
! [X1_81,X0_82] : ( codomain(multiplication(codomain(X1_81),X0_82)) = backward_diamond(X0_82,X1_81) ),
inference(cnfTransformation,[status(thm)],[f_168]) ).
tff(c_925,plain,
! [X1_81] : ( backward_diamond(zero,X1_81) = codomain(zero) ),
inference(superposition,[status(thm),theory(equality)],[c_20,c_892]) ).
tff(c_931,plain,
! [X1_81] : ( backward_diamond(zero,X1_81) = zero ),
inference(demodulation,[status(thm),theory(equality)],[c_455,c_925]) ).
tff(c_2,plain,
! [B_2,A_1] : ( addition(B_2,A_1) = addition(A_1,B_2) ),
inference(cnfTransformation,[status(thm)],[f_53]) ).
tff(c_56,plain,
addition(backward_diamond(zero,domain('#skF_1')),domain('#skF_2')) != domain('#skF_2'),
inference(cnfTransformation,[status(thm)],[f_177]) ).
tff(c_61,plain,
addition(domain('#skF_2'),backward_diamond(zero,domain('#skF_1'))) != domain('#skF_2'),
inference(demodulation,[status(thm),theory(equality)],[c_2,c_56]) ).
tff(c_932,plain,
addition(domain('#skF_2'),zero) != domain('#skF_2'),
inference(demodulation,[status(thm),theory(equality)],[c_931,c_61]) ).
tff(c_935,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_6,c_932]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : KLE119+1 : TPTP v8.1.2. Released v4.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.12/0.34 % Computer : n027.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 23:49:39 EDT 2023
% 0.12/0.34 % CPUTime :
% 3.81/2.00 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.81/2.01
% 3.81/2.01 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 4.13/2.04
% 4.13/2.04 Inference rules
% 4.13/2.04 ----------------------
% 4.13/2.04 #Ref : 0
% 4.13/2.04 #Sup : 233
% 4.13/2.04 #Fact : 0
% 4.13/2.04 #Define : 0
% 4.13/2.04 #Split : 0
% 4.13/2.04 #Chain : 0
% 4.13/2.04 #Close : 0
% 4.13/2.04
% 4.13/2.04 Ordering : KBO
% 4.13/2.04
% 4.13/2.04 Simplification rules
% 4.13/2.04 ----------------------
% 4.13/2.04 #Subsume : 0
% 4.13/2.04 #Demod : 97
% 4.13/2.04 #Tautology : 156
% 4.13/2.04 #SimpNegUnit : 0
% 4.13/2.04 #BackRed : 6
% 4.13/2.04
% 4.13/2.04 #Partial instantiations: 0
% 4.13/2.04 #Strategies tried : 1
% 4.13/2.04
% 4.13/2.04 Timing (in seconds)
% 4.13/2.04 ----------------------
% 4.13/2.04 Preprocessing : 0.53
% 4.13/2.04 Parsing : 0.29
% 4.13/2.04 CNF conversion : 0.03
% 4.13/2.04 Main loop : 0.45
% 4.13/2.04 Inferencing : 0.15
% 4.13/2.04 Reduction : 0.16
% 4.13/2.04 Demodulation : 0.12
% 4.13/2.04 BG Simplification : 0.03
% 4.13/2.04 Subsumption : 0.08
% 4.13/2.04 Abstraction : 0.02
% 4.13/2.04 MUC search : 0.00
% 4.13/2.04 Cooper : 0.00
% 4.13/2.04 Total : 1.03
% 4.13/2.04 Index Insertion : 0.00
% 4.13/2.04 Index Deletion : 0.00
% 4.13/2.04 Index Matching : 0.00
% 4.13/2.04 BG Taut test : 0.00
%------------------------------------------------------------------------------