TSTP Solution File: KLE128+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : KLE128+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 : n015.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:53 EDT 2023
% Result : Theorem 5.93s 2.42s
% Output : CNFRefutation 6.03s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 30
% Syntax : Number of formulae : 59 ( 37 unt; 19 typ; 0 def)
% Number of atoms : 44 ( 43 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 7 ( 3 ~; 1 |; 0 &)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 2 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 23 ( 15 >; 8 *; 0 +; 0 <<)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 18 ( 18 usr; 4 con; 0-2 aty)
% Number of variables : 41 (; 41 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ leq > multiplication > forward_diamond > forward_box > domain_difference > backward_diamond > backward_box > addition > #nlpp > star > domain > divergence > 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(star,type,
star: $i > $i ).
tff(multiplication,type,
multiplication: ( $i * $i ) > $i ).
tff(divergence,type,
divergence: $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_215,negated_conjecture,
~ ! [X0] :
( ( divergence(X0) = zero )
=> ! [X1] :
( ( addition(domain(X1),forward_diamond(X0,domain(X1))) = forward_diamond(X0,domain(X1)) )
=> ( domain(X1) = zero ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).
tff(f_112,axiom,
! [X0] : ( multiplication(antidomain(X0),X0) = zero ),
file('/export/starexec/sandbox/benchmark/Axioms/KLE001+4.ax',domain1) ).
tff(f_64,axiom,
! [A] : ( multiplication(A,one) = A ),
file('/export/starexec/sandbox/benchmark/Axioms/KLE001+0.ax',multiplicative_right_identity) ).
tff(f_57,axiom,
! [A] : ( addition(A,zero) = A ),
file('/export/starexec/sandbox/benchmark/Axioms/KLE001+0.ax',additive_identity) ).
tff(f_118,axiom,
! [X0] : ( domain(X0) = antidomain(antidomain(X0)) ),
file('/export/starexec/sandbox/benchmark/Axioms/KLE001+4.ax',domain4) ).
tff(f_116,axiom,
! [X0] : ( addition(antidomain(antidomain(X0)),antidomain(X0)) = one ),
file('/export/starexec/sandbox/benchmark/Axioms/KLE001+4.ax',domain3) ).
tff(f_74,axiom,
! [A] : ( multiplication(A,zero) = zero ),
file('/export/starexec/sandbox/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/sandbox/benchmark/Axioms/KLE001+6.ax',forward_diamond) ).
tff(f_53,axiom,
! [A,B] : ( addition(A,B) = addition(B,A) ),
file('/export/starexec/sandbox/benchmark/Axioms/KLE001+0.ax',additive_commutativity) ).
tff(f_55,axiom,
! [C,B,A] : ( addition(A,addition(B,C)) = addition(addition(A,B),C) ),
file('/export/starexec/sandbox/benchmark/Axioms/KLE001+0.ax',additive_associativity) ).
tff(f_205,axiom,
! [X0,X1,X2] :
( ( addition(domain(X0),addition(forward_diamond(X1,domain(X0)),domain(X2))) = addition(forward_diamond(X1,domain(X0)),domain(X2)) )
=> ( addition(domain(X0),addition(divergence(X1),forward_diamond(star(X1),domain(X2)))) = addition(divergence(X1),forward_diamond(star(X1),domain(X2))) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/KLE001+7.ax',divergence2) ).
tff(c_60,plain,
domain('#skF_2') != zero,
inference(cnfTransformation,[status(thm)],[f_215]) ).
tff(c_247,plain,
! [X0_58] : ( multiplication(antidomain(X0_58),X0_58) = 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_253,plain,
antidomain(one) = zero,
inference(superposition,[status(thm),theory(equality)],[c_247,c_12]) ).
tff(c_6,plain,
! [A_6] : ( addition(A_6,zero) = A_6 ),
inference(cnfTransformation,[status(thm)],[f_57]) ).
tff(c_34,plain,
! [X0_27] : ( antidomain(antidomain(X0_27)) = domain(X0_27) ),
inference(cnfTransformation,[status(thm)],[f_118]) ).
tff(c_279,plain,
domain(one) = antidomain(zero),
inference(superposition,[status(thm),theory(equality)],[c_253,c_34]) ).
tff(c_32,plain,
! [X0_26] : ( addition(antidomain(antidomain(X0_26)),antidomain(X0_26)) = one ),
inference(cnfTransformation,[status(thm)],[f_116]) ).
tff(c_354,plain,
! [X0_61] : ( addition(domain(X0_61),antidomain(X0_61)) = one ),
inference(demodulation,[status(thm),theory(equality)],[c_34,c_32]) ).
tff(c_376,plain,
addition(domain(one),zero) = one,
inference(superposition,[status(thm),theory(equality)],[c_253,c_354]) ).
tff(c_383,plain,
antidomain(zero) = one,
inference(demodulation,[status(thm),theory(equality)],[c_6,c_279,c_376]) ).
tff(c_396,plain,
domain(zero) = antidomain(one),
inference(superposition,[status(thm),theory(equality)],[c_383,c_34]) ).
tff(c_401,plain,
domain(zero) = zero,
inference(demodulation,[status(thm),theory(equality)],[c_253,c_396]) ).
tff(c_20,plain,
! [A_19] : ( multiplication(A_19,zero) = zero ),
inference(cnfTransformation,[status(thm)],[f_74]) ).
tff(c_944,plain,
! [X0_87,X1_88] : ( domain(multiplication(X0_87,domain(X1_88))) = forward_diamond(X0_87,X1_88) ),
inference(cnfTransformation,[status(thm)],[f_166]) ).
tff(c_977,plain,
! [X0_87] : ( domain(multiplication(X0_87,zero)) = forward_diamond(X0_87,zero) ),
inference(superposition,[status(thm),theory(equality)],[c_401,c_944]) ).
tff(c_995,plain,
! [X0_87] : ( forward_diamond(X0_87,zero) = zero ),
inference(demodulation,[status(thm),theory(equality)],[c_401,c_20,c_977]) ).
tff(c_488,plain,
! [B_63,A_64] : ( addition(B_63,A_64) = addition(A_64,B_63) ),
inference(cnfTransformation,[status(thm)],[f_53]) ).
tff(c_516,plain,
! [A_64] : ( addition(zero,A_64) = A_64 ),
inference(superposition,[status(thm),theory(equality)],[c_488,c_6]) ).
tff(c_64,plain,
divergence('#skF_1') = zero,
inference(cnfTransformation,[status(thm)],[f_215]) ).
tff(c_62,plain,
addition(domain('#skF_2'),forward_diamond('#skF_1',domain('#skF_2'))) = forward_diamond('#skF_1',domain('#skF_2')),
inference(cnfTransformation,[status(thm)],[f_215]) ).
tff(c_1142,plain,
! [A_97,B_98,C_99] : ( addition(addition(A_97,B_98),C_99) = addition(A_97,addition(B_98,C_99)) ),
inference(cnfTransformation,[status(thm)],[f_55]) ).
tff(c_1200,plain,
! [C_99] : ( addition(domain('#skF_2'),addition(forward_diamond('#skF_1',domain('#skF_2')),C_99)) = addition(forward_diamond('#skF_1',domain('#skF_2')),C_99) ),
inference(superposition,[status(thm),theory(equality)],[c_62,c_1142]) ).
tff(c_3247,plain,
! [X0_142,X1_143,X2_144] :
( ( addition(domain(X0_142),addition(divergence(X1_143),forward_diamond(star(X1_143),domain(X2_144)))) = addition(divergence(X1_143),forward_diamond(star(X1_143),domain(X2_144))) )
| ( addition(domain(X0_142),addition(forward_diamond(X1_143,domain(X0_142)),domain(X2_144))) != addition(forward_diamond(X1_143,domain(X0_142)),domain(X2_144)) ) ),
inference(cnfTransformation,[status(thm)],[f_205]) ).
tff(c_3258,plain,
! [X2_144] : ( addition(domain('#skF_2'),addition(divergence('#skF_1'),forward_diamond(star('#skF_1'),domain(X2_144)))) = addition(divergence('#skF_1'),forward_diamond(star('#skF_1'),domain(X2_144))) ),
inference(superposition,[status(thm),theory(equality)],[c_1200,c_3247]) ).
tff(c_3330,plain,
! [X2_145] : ( addition(domain('#skF_2'),forward_diamond(star('#skF_1'),domain(X2_145))) = forward_diamond(star('#skF_1'),domain(X2_145)) ),
inference(demodulation,[status(thm),theory(equality)],[c_516,c_516,c_64,c_64,c_3258]) ).
tff(c_3357,plain,
addition(domain('#skF_2'),forward_diamond(star('#skF_1'),zero)) = forward_diamond(star('#skF_1'),domain(zero)),
inference(superposition,[status(thm),theory(equality)],[c_401,c_3330]) ).
tff(c_3368,plain,
domain('#skF_2') = zero,
inference(demodulation,[status(thm),theory(equality)],[c_995,c_6,c_995,c_401,c_3357]) ).
tff(c_3370,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_60,c_3368]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : KLE128+1 : TPTP v8.1.2. Released v4.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.15/0.36 % Computer : n015.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Thu Aug 3 23:42:29 EDT 2023
% 0.15/0.36 % CPUTime :
% 5.93/2.42 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 5.93/2.43
% 5.93/2.43 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 6.03/2.46
% 6.03/2.46 Inference rules
% 6.03/2.46 ----------------------
% 6.03/2.46 #Ref : 0
% 6.03/2.46 #Sup : 869
% 6.03/2.46 #Fact : 0
% 6.03/2.46 #Define : 0
% 6.03/2.46 #Split : 0
% 6.03/2.46 #Chain : 0
% 6.03/2.46 #Close : 0
% 6.03/2.46
% 6.03/2.46 Ordering : KBO
% 6.03/2.46
% 6.03/2.46 Simplification rules
% 6.03/2.46 ----------------------
% 6.03/2.46 #Subsume : 0
% 6.03/2.46 #Demod : 835
% 6.03/2.46 #Tautology : 492
% 6.03/2.46 #SimpNegUnit : 1
% 6.03/2.46 #BackRed : 7
% 6.03/2.46
% 6.03/2.46 #Partial instantiations: 0
% 6.03/2.46 #Strategies tried : 1
% 6.03/2.46
% 6.03/2.46 Timing (in seconds)
% 6.03/2.46 ----------------------
% 6.03/2.46 Preprocessing : 0.55
% 6.03/2.46 Parsing : 0.30
% 6.03/2.46 CNF conversion : 0.03
% 6.03/2.46 Main loop : 0.84
% 6.03/2.46 Inferencing : 0.25
% 6.03/2.46 Reduction : 0.37
% 6.03/2.46 Demodulation : 0.30
% 6.03/2.46 BG Simplification : 0.04
% 6.03/2.46 Subsumption : 0.13
% 6.03/2.46 Abstraction : 0.03
% 6.03/2.46 MUC search : 0.00
% 6.03/2.46 Cooper : 0.00
% 6.03/2.46 Total : 1.44
% 6.03/2.46 Index Insertion : 0.00
% 6.03/2.46 Index Deletion : 0.00
% 6.03/2.46 Index Matching : 0.00
% 6.03/2.46 BG Taut test : 0.00
%------------------------------------------------------------------------------