TSTP Solution File: KLE007+3 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : KLE007+3 : 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 : n025.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:39 EDT 2023
% Result : Theorem 3.58s 2.07s
% Output : CNFRefutation 3.92s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 17
% Syntax : Number of formulae : 33 ( 13 unt; 11 typ; 0 def)
% Number of atoms : 35 ( 19 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 25 ( 12 ~; 6 |; 3 &)
% ( 2 <=>; 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 : 24 (; 24 !; 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_177,negated_conjecture,
~ ! [X0,X1] :
( ( test(X1)
& test(X0) )
=> ( one = addition(multiplication(addition(X0,c(X0)),X1),multiplication(addition(X0,c(X0)),c(X1))) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).
tff(f_51,axiom,
! [A,B] : ( addition(A,B) = addition(B,A) ),
file('/export/starexec/sandbox/benchmark/Axioms/KLE001+0.ax',additive_commutativity) ).
tff(f_126,axiom,
! [X0,X1] :
( test(X0)
=> ( ( c(X0) = X1 )
<=> complement(X0,X1) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/KLE001+1.ax',test_3) ).
tff(f_120,axiom,
! [X0,X1] :
( complement(X1,X0)
<=> ( ( multiplication(X0,X1) = zero )
& ( multiplication(X1,X0) = zero )
& ( addition(X0,X1) = one ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/KLE001+1.ax',test_2) ).
tff(f_62,axiom,
! [A] : ( multiplication(A,one) = A ),
file('/export/starexec/sandbox/benchmark/Axioms/KLE001+0.ax',multiplicative_right_identity) ).
tff(f_67,axiom,
! [A,B,C] : ( multiplication(A,addition(B,C)) = addition(multiplication(A,B),multiplication(A,C)) ),
file('/export/starexec/sandbox/benchmark/Axioms/KLE001+0.ax',right_distributivity) ).
tff(c_52,plain,
test('#skF_2'),
inference(cnfTransformation,[status(thm)],[f_177]) ).
tff(c_2,plain,
! [B_2,A_1] : ( addition(B_2,A_1) = addition(A_1,B_2) ),
inference(cnfTransformation,[status(thm)],[f_51]) ).
tff(c_42,plain,
! [X0_29] :
( complement(X0_29,c(X0_29))
| ~ test(X0_29) ),
inference(cnfTransformation,[status(thm)],[f_126]) ).
tff(c_264,plain,
! [X0_51,X1_52] :
( ( addition(X0_51,X1_52) = one )
| ~ complement(X1_52,X0_51) ),
inference(cnfTransformation,[status(thm)],[f_120]) ).
tff(c_267,plain,
! [X0_29] :
( ( addition(c(X0_29),X0_29) = one )
| ~ test(X0_29) ),
inference(resolution,[status(thm)],[c_42,c_264]) ).
tff(c_272,plain,
! [X0_29] :
( ( addition(X0_29,c(X0_29)) = one )
| ~ test(X0_29) ),
inference(demodulation,[status(thm),theory(equality)],[c_2,c_267]) ).
tff(c_54,plain,
test('#skF_3'),
inference(cnfTransformation,[status(thm)],[f_177]) ).
tff(c_12,plain,
! [A_11] : ( multiplication(A_11,one) = A_11 ),
inference(cnfTransformation,[status(thm)],[f_62]) ).
tff(c_496,plain,
! [X0_69] :
( ( addition(X0_69,c(X0_69)) = one )
| ~ test(X0_69) ),
inference(demodulation,[status(thm),theory(equality)],[c_2,c_267]) ).
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_67]) ).
tff(c_50,plain,
addition(multiplication(addition('#skF_2',c('#skF_2')),'#skF_3'),multiplication(addition('#skF_2',c('#skF_2')),c('#skF_3'))) != one,
inference(cnfTransformation,[status(thm)],[f_177]) ).
tff(c_55,plain,
multiplication(addition('#skF_2',c('#skF_2')),addition('#skF_3',c('#skF_3'))) != one,
inference(demodulation,[status(thm),theory(equality)],[c_16,c_50]) ).
tff(c_509,plain,
( ( multiplication(addition('#skF_2',c('#skF_2')),one) != one )
| ~ test('#skF_3') ),
inference(superposition,[status(thm),theory(equality)],[c_496,c_55]) ).
tff(c_524,plain,
addition('#skF_2',c('#skF_2')) != one,
inference(demodulation,[status(thm),theory(equality)],[c_54,c_12,c_509]) ).
tff(c_634,plain,
~ test('#skF_2'),
inference(superposition,[status(thm),theory(equality)],[c_272,c_524]) ).
tff(c_638,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_52,c_634]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : KLE007+3 : 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 : n025.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:36:20 EDT 2023
% 0.15/0.36 % CPUTime :
% 3.58/2.07 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.58/2.07
% 3.58/2.07 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 3.92/2.10
% 3.92/2.10 Inference rules
% 3.92/2.10 ----------------------
% 3.92/2.10 #Ref : 0
% 3.92/2.10 #Sup : 135
% 3.92/2.10 #Fact : 0
% 3.92/2.10 #Define : 0
% 3.92/2.10 #Split : 2
% 3.92/2.10 #Chain : 0
% 3.92/2.10 #Close : 0
% 3.92/2.10
% 3.92/2.10 Ordering : KBO
% 3.92/2.10
% 3.92/2.10 Simplification rules
% 3.92/2.10 ----------------------
% 3.92/2.10 #Subsume : 15
% 3.92/2.10 #Demod : 55
% 3.92/2.10 #Tautology : 84
% 3.92/2.10 #SimpNegUnit : 1
% 3.92/2.10 #BackRed : 0
% 3.92/2.10
% 3.92/2.10 #Partial instantiations: 0
% 3.92/2.10 #Strategies tried : 1
% 3.92/2.10
% 3.92/2.10 Timing (in seconds)
% 3.92/2.10 ----------------------
% 3.92/2.10 Preprocessing : 0.56
% 3.92/2.10 Parsing : 0.30
% 3.92/2.10 CNF conversion : 0.03
% 3.92/2.10 Main loop : 0.39
% 3.92/2.10 Inferencing : 0.14
% 3.92/2.10 Reduction : 0.12
% 3.92/2.10 Demodulation : 0.09
% 3.92/2.10 BG Simplification : 0.02
% 3.92/2.10 Subsumption : 0.08
% 3.92/2.10 Abstraction : 0.02
% 3.92/2.10 MUC search : 0.00
% 3.92/2.10 Cooper : 0.00
% 3.92/2.10 Total : 0.99
% 3.92/2.10 Index Insertion : 0.00
% 3.92/2.10 Index Deletion : 0.00
% 3.92/2.10 Index Matching : 0.00
% 3.92/2.10 BG Taut test : 0.00
%------------------------------------------------------------------------------