TSTP Solution File: KLE022+4 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : KLE022+4 : 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 : n008.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:42 EDT 2023
% Result : Theorem 4.26s 2.10s
% Output : CNFRefutation 4.26s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 19
% Syntax : Number of formulae : 49 ( 20 unt; 11 typ; 0 def)
% Number of atoms : 60 ( 28 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 48 ( 26 ~; 14 |; 3 &)
% ( 3 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 11 ( 7 >; 4 *; 0 +; 0 <<)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 4 con; 0-2 aty)
% Number of variables : 37 (; 37 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ leq > complement > test > multiplication > addition > #nlpp > c > zero > one > #skF_1 > #skF_2 > #skF_3
%Foreground sorts:
%Background operators:
%Foreground operators:
tff('#skF_1',type,
'#skF_1': $i > $i ).
tff(c,type,
c: $i > $i ).
tff(multiplication,type,
multiplication: ( $i * $i ) > $i ).
tff(addition,type,
addition: ( $i * $i ) > $i ).
tff(complement,type,
complement: ( $i * $i ) > $o ).
tff('#skF_2',type,
'#skF_2': $i ).
tff('#skF_3',type,
'#skF_3': $i ).
tff(test,type,
test: $i > $o ).
tff(one,type,
one: $i ).
tff(leq,type,
leq: ( $i * $i ) > $o ).
tff(zero,type,
zero: $i ).
tff(f_178,negated_conjecture,
~ ! [X0,X1] :
( test(X1)
=> ( leq(X0,addition(multiplication(X0,X1),multiplication(X0,c(X1))))
& leq(addition(multiplication(X0,X1),multiplication(X0,c(X1))),X0) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).
tff(f_63,axiom,
! [A] : ( multiplication(A,one) = A ),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+0.ax',multiplicative_right_identity) ).
tff(f_52,axiom,
! [A,B] : ( addition(A,B) = addition(B,A) ),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+0.ax',additive_commutativity) ).
tff(f_127,axiom,
! [X0,X1] :
( test(X0)
=> ( ( c(X0) = X1 )
<=> complement(X0,X1) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+1.ax',test_3) ).
tff(f_121,axiom,
! [X0,X1] :
( complement(X1,X0)
<=> ( ( multiplication(X0,X1) = zero )
& ( multiplication(X1,X0) = zero )
& ( addition(X0,X1) = one ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+1.ax',test_2) ).
tff(f_58,axiom,
! [A] : ( addition(A,A) = A ),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+0.ax',additive_idempotence) ).
tff(f_80,axiom,
! [A,B] :
( leq(A,B)
<=> ( addition(A,B) = B ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+0.ax',order) ).
tff(f_68,axiom,
! [A,B,C] : ( multiplication(A,addition(B,C)) = addition(multiplication(A,B),multiplication(A,C)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+0.ax',right_distributivity) ).
tff(c_52,plain,
test('#skF_3'),
inference(cnfTransformation,[status(thm)],[f_178]) ).
tff(c_12,plain,
! [A_11] : ( multiplication(A_11,one) = A_11 ),
inference(cnfTransformation,[status(thm)],[f_63]) ).
tff(c_2,plain,
! [B_2,A_1] : ( addition(B_2,A_1) = addition(A_1,B_2) ),
inference(cnfTransformation,[status(thm)],[f_52]) ).
tff(c_42,plain,
! [X0_29] :
( complement(X0_29,c(X0_29))
| ~ test(X0_29) ),
inference(cnfTransformation,[status(thm)],[f_127]) ).
tff(c_615,plain,
! [X0_77,X1_78] :
( ( addition(X0_77,X1_78) = one )
| ~ complement(X1_78,X0_77) ),
inference(cnfTransformation,[status(thm)],[f_121]) ).
tff(c_618,plain,
! [X0_29] :
( ( addition(c(X0_29),X0_29) = one )
| ~ test(X0_29) ),
inference(resolution,[status(thm)],[c_42,c_615]) ).
tff(c_919,plain,
! [X0_95] :
( ( addition(X0_95,c(X0_95)) = one )
| ~ test(X0_95) ),
inference(demodulation,[status(thm),theory(equality)],[c_2,c_618]) ).
tff(c_8,plain,
! [A_7] : ( addition(A_7,A_7) = A_7 ),
inference(cnfTransformation,[status(thm)],[f_58]) ).
tff(c_26,plain,
! [A_21,B_22] :
( leq(A_21,B_22)
| ( addition(A_21,B_22) != B_22 ) ),
inference(cnfTransformation,[status(thm)],[f_80]) ).
tff(c_291,plain,
! [X0_59,X1_60] :
( ( addition(X0_59,X1_60) = one )
| ~ complement(X1_60,X0_59) ),
inference(cnfTransformation,[status(thm)],[f_121]) ).
tff(c_297,plain,
! [X0_29] :
( ( addition(c(X0_29),X0_29) = one )
| ~ test(X0_29) ),
inference(resolution,[status(thm)],[c_42,c_291]) ).
tff(c_452,plain,
! [X0_68] :
( ( addition(X0_68,c(X0_68)) = one )
| ~ test(X0_68) ),
inference(demodulation,[status(thm),theory(equality)],[c_2,c_297]) ).
tff(c_16,plain,
! [A_13,B_14,C_15] : ( addition(multiplication(A_13,B_14),multiplication(A_13,C_15)) = multiplication(A_13,addition(B_14,C_15)) ),
inference(cnfTransformation,[status(thm)],[f_68]) ).
tff(c_50,plain,
( ~ leq(addition(multiplication('#skF_2','#skF_3'),multiplication('#skF_2',c('#skF_3'))),'#skF_2')
| ~ leq('#skF_2',addition(multiplication('#skF_2','#skF_3'),multiplication('#skF_2',c('#skF_3')))) ),
inference(cnfTransformation,[status(thm)],[f_178]) ).
tff(c_53,plain,
( ~ leq(multiplication('#skF_2',addition('#skF_3',c('#skF_3'))),'#skF_2')
| ~ leq('#skF_2',multiplication('#skF_2',addition('#skF_3',c('#skF_3')))) ),
inference(demodulation,[status(thm),theory(equality)],[c_16,c_16,c_50]) ).
tff(c_154,plain,
~ leq('#skF_2',multiplication('#skF_2',addition('#skF_3',c('#skF_3')))),
inference(splitLeft,[status(thm)],[c_53]) ).
tff(c_461,plain,
( ~ leq('#skF_2',multiplication('#skF_2',one))
| ~ test('#skF_3') ),
inference(superposition,[status(thm),theory(equality)],[c_452,c_154]) ).
tff(c_483,plain,
~ leq('#skF_2','#skF_2'),
inference(demodulation,[status(thm),theory(equality)],[c_52,c_12,c_461]) ).
tff(c_491,plain,
addition('#skF_2','#skF_2') != '#skF_2',
inference(resolution,[status(thm)],[c_26,c_483]) ).
tff(c_495,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_8,c_491]) ).
tff(c_497,plain,
leq('#skF_2',multiplication('#skF_2',addition('#skF_3',c('#skF_3')))),
inference(splitRight,[status(thm)],[c_53]) ).
tff(c_634,plain,
! [A_81,B_82] :
( ( addition(A_81,B_82) = B_82 )
| ~ leq(A_81,B_82) ),
inference(cnfTransformation,[status(thm)],[f_80]) ).
tff(c_638,plain,
addition('#skF_2',multiplication('#skF_2',addition('#skF_3',c('#skF_3')))) = multiplication('#skF_2',addition('#skF_3',c('#skF_3'))),
inference(resolution,[status(thm)],[c_497,c_634]) ).
tff(c_639,plain,
! [A_83,B_84] :
( leq(A_83,B_84)
| ( addition(A_83,B_84) != B_84 ) ),
inference(cnfTransformation,[status(thm)],[f_80]) ).
tff(c_496,plain,
~ leq(multiplication('#skF_2',addition('#skF_3',c('#skF_3'))),'#skF_2'),
inference(splitRight,[status(thm)],[c_53]) ).
tff(c_645,plain,
addition(multiplication('#skF_2',addition('#skF_3',c('#skF_3'))),'#skF_2') != '#skF_2',
inference(resolution,[status(thm)],[c_639,c_496]) ).
tff(c_648,plain,
addition('#skF_2',multiplication('#skF_2',addition('#skF_3',c('#skF_3')))) != '#skF_2',
inference(demodulation,[status(thm),theory(equality)],[c_2,c_645]) ).
tff(c_918,plain,
multiplication('#skF_2',addition('#skF_3',c('#skF_3'))) != '#skF_2',
inference(demodulation,[status(thm),theory(equality)],[c_638,c_648]) ).
tff(c_925,plain,
( ( multiplication('#skF_2',one) != '#skF_2' )
| ~ test('#skF_3') ),
inference(superposition,[status(thm),theory(equality)],[c_919,c_918]) ).
tff(c_966,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_52,c_12,c_925]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : KLE022+4 : TPTP v8.1.2. Released v4.0.0.
% 0.00/0.14 % 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.35 % Computer : n008.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:28:19 EDT 2023
% 0.14/0.35 % CPUTime :
% 4.26/2.10 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 4.26/2.10
% 4.26/2.10 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 4.26/2.13
% 4.26/2.13 Inference rules
% 4.26/2.13 ----------------------
% 4.26/2.13 #Ref : 0
% 4.26/2.13 #Sup : 213
% 4.26/2.13 #Fact : 0
% 4.26/2.13 #Define : 0
% 4.26/2.13 #Split : 5
% 4.26/2.13 #Chain : 0
% 4.26/2.13 #Close : 0
% 4.26/2.13
% 4.26/2.13 Ordering : KBO
% 4.26/2.13
% 4.26/2.13 Simplification rules
% 4.26/2.13 ----------------------
% 4.26/2.13 #Subsume : 28
% 4.26/2.13 #Demod : 72
% 4.26/2.13 #Tautology : 127
% 4.26/2.13 #SimpNegUnit : 2
% 4.26/2.13 #BackRed : 0
% 4.26/2.13
% 4.26/2.13 #Partial instantiations: 0
% 4.26/2.13 #Strategies tried : 1
% 4.26/2.13
% 4.26/2.13 Timing (in seconds)
% 4.26/2.13 ----------------------
% 4.26/2.14 Preprocessing : 0.55
% 4.26/2.14 Parsing : 0.30
% 4.26/2.14 CNF conversion : 0.03
% 4.26/2.14 Main loop : 0.46
% 4.26/2.14 Inferencing : 0.18
% 4.26/2.14 Reduction : 0.14
% 4.26/2.14 Demodulation : 0.10
% 4.26/2.14 BG Simplification : 0.02
% 4.26/2.14 Subsumption : 0.08
% 4.26/2.14 Abstraction : 0.02
% 4.26/2.14 MUC search : 0.00
% 4.26/2.14 Cooper : 0.00
% 4.26/2.14 Total : 1.06
% 4.26/2.14 Index Insertion : 0.00
% 4.26/2.14 Index Deletion : 0.00
% 4.26/2.14 Index Matching : 0.00
% 4.26/2.14 BG Taut test : 0.00
%------------------------------------------------------------------------------