TSTP Solution File: KLE129+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : KLE129+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 : n010.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 8.05s 2.96s
% Output : CNFRefutation 8.05s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 22
% Syntax : Number of formulae : 35 ( 10 unt; 18 typ; 0 def)
% Number of atoms : 25 ( 24 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 16 ( 8 ~; 6 |; 0 &)
% ( 0 <=>; 1 =>; 1 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 6 ( 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 : 17 ( 17 usr; 3 con; 0-2 aty)
% Number of variables : 19 (; 19 !; 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_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_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_201,axiom,
! [X0] : ( forward_diamond(X0,divergence(X0)) = divergence(X0) ),
file('/export/starexec/sandbox/benchmark/Axioms/KLE001+7.ax',divergence1) ).
tff(f_59,axiom,
! [A] : ( addition(A,A) = A ),
file('/export/starexec/sandbox/benchmark/Axioms/KLE001+0.ax',additive_idempotence) ).
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(c_60,plain,
divergence('#skF_1') != zero,
inference(cnfTransformation,[status(thm)],[f_215]) ).
tff(c_56,plain,
! [X0_44] : ( forward_diamond(X0_44,divergence(X0_44)) = divergence(X0_44) ),
inference(cnfTransformation,[status(thm)],[f_201]) ).
tff(c_8,plain,
! [A_7] : ( addition(A_7,A_7) = A_7 ),
inference(cnfTransformation,[status(thm)],[f_59]) ).
tff(c_48,plain,
! [X0_36,X1_37] : ( domain(multiplication(X0_36,domain(X1_37))) = forward_diamond(X0_36,X1_37) ),
inference(cnfTransformation,[status(thm)],[f_166]) ).
tff(c_952,plain,
! [X0_81,X1_82] : ( domain(multiplication(X0_81,domain(X1_82))) = forward_diamond(X0_81,X1_82) ),
inference(cnfTransformation,[status(thm)],[f_166]) ).
tff(c_62,plain,
! [X1_49] :
( ( domain(X1_49) = zero )
| ( addition(domain(X1_49),forward_diamond('#skF_1',domain(X1_49))) != forward_diamond('#skF_1',domain(X1_49)) ) ),
inference(cnfTransformation,[status(thm)],[f_215]) ).
tff(c_979,plain,
! [X0_81,X1_82] :
( ( domain(multiplication(X0_81,domain(X1_82))) = zero )
| ( addition(forward_diamond(X0_81,X1_82),forward_diamond('#skF_1',domain(multiplication(X0_81,domain(X1_82))))) != forward_diamond('#skF_1',domain(multiplication(X0_81,domain(X1_82)))) ) ),
inference(superposition,[status(thm),theory(equality)],[c_952,c_62]) ).
tff(c_1609,plain,
! [X0_105,X1_106] :
( ( forward_diamond(X0_105,X1_106) = zero )
| ( addition(forward_diamond(X0_105,X1_106),forward_diamond('#skF_1',forward_diamond(X0_105,X1_106))) != forward_diamond('#skF_1',forward_diamond(X0_105,X1_106)) ) ),
inference(demodulation,[status(thm),theory(equality)],[c_48,c_48,c_48,c_979]) ).
tff(c_1642,plain,
! [X0_44] :
( ( forward_diamond(X0_44,divergence(X0_44)) = zero )
| ( addition(divergence(X0_44),forward_diamond('#skF_1',forward_diamond(X0_44,divergence(X0_44)))) != forward_diamond('#skF_1',forward_diamond(X0_44,divergence(X0_44))) ) ),
inference(superposition,[status(thm),theory(equality)],[c_56,c_1609]) ).
tff(c_7211,plain,
! [X0_211] :
( ( divergence(X0_211) = zero )
| ( addition(divergence(X0_211),forward_diamond('#skF_1',divergence(X0_211))) != forward_diamond('#skF_1',divergence(X0_211)) ) ),
inference(demodulation,[status(thm),theory(equality)],[c_56,c_56,c_56,c_1642]) ).
tff(c_7221,plain,
( ( divergence('#skF_1') = zero )
| ( addition(divergence('#skF_1'),divergence('#skF_1')) != forward_diamond('#skF_1',divergence('#skF_1')) ) ),
inference(superposition,[status(thm),theory(equality)],[c_56,c_7211]) ).
tff(c_7227,plain,
divergence('#skF_1') = zero,
inference(demodulation,[status(thm),theory(equality)],[c_56,c_8,c_7221]) ).
tff(c_7229,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_60,c_7227]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : KLE129+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.14/0.35 % Computer : n010.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Thu Aug 3 23:10:13 EDT 2023
% 0.14/0.35 % CPUTime :
% 8.05/2.96 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 8.05/2.97
% 8.05/2.97 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 8.05/2.99
% 8.05/2.99 Inference rules
% 8.05/2.99 ----------------------
% 8.05/2.99 #Ref : 0
% 8.05/2.99 #Sup : 1865
% 8.05/2.99 #Fact : 0
% 8.05/2.99 #Define : 0
% 8.05/2.99 #Split : 4
% 8.05/2.99 #Chain : 0
% 8.05/2.99 #Close : 0
% 8.05/2.99
% 8.05/2.99 Ordering : KBO
% 8.05/2.99
% 8.05/2.99 Simplification rules
% 8.05/2.99 ----------------------
% 8.05/2.99 #Subsume : 33
% 8.05/2.99 #Demod : 2349
% 8.05/2.99 #Tautology : 1029
% 8.05/2.99 #SimpNegUnit : 1
% 8.05/2.99 #BackRed : 10
% 8.05/2.99
% 8.05/2.99 #Partial instantiations: 0
% 8.05/2.99 #Strategies tried : 1
% 8.05/2.99
% 8.05/2.99 Timing (in seconds)
% 8.05/2.99 ----------------------
% 8.05/3.00 Preprocessing : 0.56
% 8.05/3.00 Parsing : 0.30
% 8.05/3.00 CNF conversion : 0.03
% 8.05/3.00 Main loop : 1.36
% 8.05/3.00 Inferencing : 0.37
% 8.05/3.00 Reduction : 0.63
% 8.05/3.00 Demodulation : 0.53
% 8.05/3.00 BG Simplification : 0.05
% 8.05/3.00 Subsumption : 0.23
% 8.05/3.00 Abstraction : 0.05
% 8.05/3.00 MUC search : 0.00
% 8.05/3.00 Cooper : 0.00
% 8.05/3.00 Total : 1.97
% 8.05/3.00 Index Insertion : 0.00
% 8.05/3.00 Index Deletion : 0.00
% 8.05/3.00 Index Matching : 0.00
% 8.05/3.00 BG Taut test : 0.00
%------------------------------------------------------------------------------