%------------------------------------------------------------------------------
% File : Beagle---0.9.52
% Problem : KLE007+2 : TPTP v9.0.0. 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 : n011.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 : Wed Apr 9 07:04:33 PM UTC 2025
% Result : Theorem 4.29s 2.48s
% Output : CNFRefutation 4.54s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 9
% Syntax : Number of formulae : 42 ( 22 unt; 0 typ; 0 def)
% Number of atoms : 67 ( 26 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 56 ( 31 ~; 16 |; 4 &)
% ( 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 : 0 ( 0 >; 0 *; 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_57,axiom,
! [A] : ( addition(A,A) = A ),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+0.ax',additive_idempotence) ).
tff(f_79,axiom,
! [A,B] :
( leq(A,B)
<=> ( addition(A,B) = B ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+0.ax',order) ).
tff(f_142,negated_conjecture,
~ ! [X0,X1] :
( ( test(X1)
& test(X0) )
=> ( leq(one,addition(multiplication(addition(X0,c(X0)),X1),multiplication(addition(X0,c(X0)),c(X1))))
& leq(addition(multiplication(addition(X0,c(X0)),X1),multiplication(addition(X0,c(X0)),c(X1))),one) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).
tff(f_51,axiom,
! [A,B] : ( addition(A,B) = addition(B,A) ),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+0.ax',additive_commutativity) ).
tff(f_126,axiom,
! [X0,X1] :
( test(X0)
=> ( ( c(X0) = X1 )
<=> complement(X0,X1) ) ),
file('/export/starexec/sandbox2/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/sandbox2/benchmark/Axioms/KLE001+1.ax',test_2) ).
tff(f_64,axiom,
! [A] : ( multiplication(one,A) = A ),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+0.ax',multiplicative_left_identity) ).
tff(f_62,axiom,
! [A] : ( multiplication(A,one) = A ),
file('/export/starexec/sandbox2/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/sandbox2/benchmark/Axioms/KLE001+0.ax',right_distributivity) ).
tff(c_8,plain,
! [A_7] : ( addition(A_7,A_7) = A_7 ),
inference(cnfTransformation,[status(thm)],[f_57]) ).
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_79]) ).
tff(c_50,plain,
test('#skF_3'),
inference(cnfTransformation,[status(thm)],[f_142]) ).
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_517,plain,
! [X0_73,X1_74] :
( ( addition(X0_73,X1_74) = one )
| ~ complement(X1_74,X0_73) ),
inference(cnfTransformation,[status(thm)],[f_120]) ).
tff(c_523,plain,
! [X0_29] :
( ( addition(c(X0_29),X0_29) = one )
| ~ test(X0_29) ),
inference(resolution,[status(thm)],[c_42,c_517]) ).
tff(c_526,plain,
! [X0_29] :
( ( addition(X0_29,c(X0_29)) = one )
| ~ test(X0_29) ),
inference(demodulation,[status(thm),theory(equality)],[c_2,c_523]) ).
tff(c_48,plain,
test('#skF_2'),
inference(cnfTransformation,[status(thm)],[f_142]) ).
tff(c_14,plain,
! [A_12] : ( multiplication(one,A_12) = A_12 ),
inference(cnfTransformation,[status(thm)],[f_64]) ).
tff(c_800,plain,
! [X0_87] :
( ( addition(X0_87,c(X0_87)) = one )
| ~ test(X0_87) ),
inference(demodulation,[status(thm),theory(equality)],[c_2,c_523]) ).
tff(c_279,plain,
! [X0_51,X1_52] :
( ( addition(X0_51,X1_52) = one )
| ~ complement(X1_52,X0_51) ),
inference(cnfTransformation,[status(thm)],[f_120]) ).
tff(c_285,plain,
! [X0_29] :
( ( addition(c(X0_29),X0_29) = one )
| ~ test(X0_29) ),
inference(resolution,[status(thm)],[c_42,c_279]) ).
tff(c_288,plain,
! [X0_29] :
( ( addition(X0_29,c(X0_29)) = one )
| ~ test(X0_29) ),
inference(demodulation,[status(thm),theory(equality)],[c_2,c_285]) ).
tff(c_12,plain,
! [A_11] : ( multiplication(A_11,one) = A_11 ),
inference(cnfTransformation,[status(thm)],[f_62]) ).
tff(c_309,plain,
! [X0_59] :
( ( addition(X0_59,c(X0_59)) = one )
| ~ test(X0_59) ),
inference(demodulation,[status(thm),theory(equality)],[c_2,c_285]) ).
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_46,plain,
( ~ leq(addition(multiplication(addition('#skF_2',c('#skF_2')),'#skF_3'),multiplication(addition('#skF_2',c('#skF_2')),c('#skF_3'))),one)
| ~ leq(one,addition(multiplication(addition('#skF_2',c('#skF_2')),'#skF_3'),multiplication(addition('#skF_2',c('#skF_2')),c('#skF_3')))) ),
inference(cnfTransformation,[status(thm)],[f_142]) ).
tff(c_51,plain,
( ~ leq(multiplication(addition('#skF_2',c('#skF_2')),addition('#skF_3',c('#skF_3'))),one)
| ~ leq(one,multiplication(addition('#skF_2',c('#skF_2')),addition('#skF_3',c('#skF_3')))) ),
inference(demodulation,[status(thm),theory(equality)],[c_16,c_16,c_46]) ).
tff(c_151,plain,
~ leq(one,multiplication(addition('#skF_2',c('#skF_2')),addition('#skF_3',c('#skF_3')))),
inference(splitLeft,[status(thm)],[c_51]) ).
tff(c_318,plain,
( ~ leq(one,multiplication(addition('#skF_2',c('#skF_2')),one))
| ~ test('#skF_3') ),
inference(superposition,[status(thm),theory(equality)],[c_309,c_151]) ).
tff(c_334,plain,
~ leq(one,addition('#skF_2',c('#skF_2'))),
inference(demodulation,[status(thm),theory(equality)],[c_50,c_12,c_318]) ).
tff(c_369,plain,
( ~ leq(one,one)
| ~ test('#skF_2') ),
inference(superposition,[status(thm),theory(equality)],[c_288,c_334]) ).
tff(c_374,plain,
~ leq(one,one),
inference(demodulation,[status(thm),theory(equality)],[c_48,c_369]) ).
tff(c_378,plain,
addition(one,one) != one,
inference(resolution,[status(thm)],[c_26,c_374]) ).
tff(c_382,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_8,c_378]) ).
tff(c_383,plain,
~ leq(multiplication(addition('#skF_2',c('#skF_2')),addition('#skF_3',c('#skF_3'))),one),
inference(splitRight,[status(thm)],[c_51]) ).
tff(c_819,plain,
( ~ leq(multiplication(one,addition('#skF_3',c('#skF_3'))),one)
| ~ test('#skF_2') ),
inference(superposition,[status(thm),theory(equality)],[c_800,c_383]) ).
tff(c_856,plain,
~ leq(addition('#skF_3',c('#skF_3')),one),
inference(demodulation,[status(thm),theory(equality)],[c_48,c_14,c_819]) ).
tff(c_870,plain,
( ~ leq(one,one)
| ~ test('#skF_3') ),
inference(superposition,[status(thm),theory(equality)],[c_526,c_856]) ).
tff(c_875,plain,
~ leq(one,one),
inference(demodulation,[status(thm),theory(equality)],[c_50,c_870]) ).
tff(c_880,plain,
addition(one,one) != one,
inference(resolution,[status(thm)],[c_26,c_875]) ).
tff(c_884,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_8,c_880]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.08 % Problem : KLE007+2 : TPTP v9.0.0. Released v4.0.0.
% 0.00/0.09 % 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.08/0.29 % Computer : n011.cluster.edu
% 0.08/0.29 % Model : x86_64 x86_64
% 0.08/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.29 % Memory : 8042.1875MB
% 0.08/0.29 % OS : Linux 3.10.0-693.el7.x86_64
% 0.08/0.29 % CPULimit : 300
% 0.08/0.29 % WCLimit : 300
% 0.08/0.29 % DateTime : Tue Apr 8 02:25:48 EDT 2025
% 0.08/0.29 % CPUTime :
% 4.29/2.48 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 4.29/2.49
% 4.29/2.49 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------