%------------------------------------------------------------------------------
% File : Beagle---0.9.52
% Problem : KLE004+1 : 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:32 PM UTC 2025
% Result : Theorem 16.34s 5.62s
% Output : CNFRefutation 16.70s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 8
% Syntax : Number of formulae : 28 ( 15 unt; 0 typ; 0 def)
% Number of atoms : 49 ( 30 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 40 ( 19 ~; 15 |; 2 &)
% ( 3 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 3 ( 1 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 : 6 ( 6 usr; 2 con; 0-2 aty)
% Number of variables : 33 ( 32 !; 1 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ leq > complement > test > multiplication > addition > #nlpp > c > zero > one > #skF_1
%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(test,type,
test: $i > $o ).
tff(one,type,
one: $i ).
tff(leq,type,
leq: ( $i * $i ) > $o ).
tff(zero,type,
zero: $i ).
tff(f_135,negated_conjecture,
c(zero) != 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_55,axiom,
! [A] : ( addition(A,zero) = A ),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+0.ax',additive_identity) ).
tff(f_74,axiom,
! [A] : ( multiplication(zero,A) = zero ),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+0.ax',left_annihilation) ).
tff(f_72,axiom,
! [A] : ( multiplication(A,zero) = zero ),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+0.ax',right_annihilation) ).
tff(f_112,axiom,
! [X0] :
( test(X0)
<=> ? [X1] : complement(X1,X0) ),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+1.ax',test_1) ).
tff(c_46,plain,
c(zero) != one,
inference(cnfTransformation,[status(thm)],[f_135]) ).
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_49,X1_50] :
( ( addition(X0_49,X1_50) = one )
| ~ complement(X1_50,X0_49) ),
inference(cnfTransformation,[status(thm)],[f_120]) ).
tff(c_270,plain,
! [X0_29] :
( ( addition(c(X0_29),X0_29) = one )
| ~ test(X0_29) ),
inference(resolution,[status(thm)],[c_42,c_264]) ).
tff(c_472,plain,
! [X0_65] :
( ( addition(X0_65,c(X0_65)) = one )
| ~ test(X0_65) ),
inference(demodulation,[status(thm),theory(equality)],[c_2,c_270]) ).
tff(c_158,plain,
! [B_44,A_45] : ( addition(B_44,A_45) = addition(A_45,B_44) ),
inference(cnfTransformation,[status(thm)],[f_51]) ).
tff(c_6,plain,
! [A_6] : ( addition(A_6,zero) = A_6 ),
inference(cnfTransformation,[status(thm)],[f_55]) ).
tff(c_174,plain,
! [A_45] : ( addition(zero,A_45) = A_45 ),
inference(superposition,[status(thm),theory(equality)],[c_158,c_6]) ).
tff(c_486,plain,
( ( c(zero) = one )
| ~ test(zero) ),
inference(superposition,[status(thm),theory(equality)],[c_472,c_174]) ).
tff(c_502,plain,
~ test(zero),
inference(negUnitSimplification,[status(thm)],[c_46,c_486]) ).
tff(c_22,plain,
! [A_20] : ( multiplication(zero,A_20) = zero ),
inference(cnfTransformation,[status(thm)],[f_74]) ).
tff(c_20,plain,
! [A_19] : ( multiplication(A_19,zero) = zero ),
inference(cnfTransformation,[status(thm)],[f_72]) ).
tff(c_1440,plain,
! [X1_90,X0_91] :
( complement(X1_90,X0_91)
| ( addition(X0_91,X1_90) != one )
| ( multiplication(X1_90,X0_91) != zero )
| ( multiplication(X0_91,X1_90) != zero ) ),
inference(cnfTransformation,[status(thm)],[f_120]) ).
tff(c_30,plain,
! [X0_23,X1_26] :
( test(X0_23)
| ~ complement(X1_26,X0_23) ),
inference(cnfTransformation,[status(thm)],[f_112]) ).
tff(c_23167,plain,
! [X0_235,X1_236] :
( test(X0_235)
| ( addition(X0_235,X1_236) != one )
| ( multiplication(X1_236,X0_235) != zero )
| ( multiplication(X0_235,X1_236) != zero ) ),
inference(resolution,[status(thm)],[c_1440,c_30]) ).
tff(c_23251,plain,
! [A_19] :
( test(zero)
| ( addition(zero,A_19) != one )
| ( multiplication(zero,A_19) != zero ) ),
inference(superposition,[status(thm),theory(equality)],[c_20,c_23167]) ).
tff(c_23299,plain,
! [A_19] :
( test(zero)
| ( one != A_19 ) ),
inference(demodulation,[status(thm),theory(equality)],[c_22,c_174,c_23251]) ).
tff(c_23300,plain,
! [A_19] : ( one != A_19 ),
inference(negUnitSimplification,[status(thm)],[c_502,c_23299]) ).
tff(c_23336,plain,
$false,
inference(reflexivity,[status(thm),theory(equality)],[c_23300]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : KLE004+1 : TPTP v9.0.0. Released v4.0.0.
% 0.03/0.13 % 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.13/0.34 % Computer : n011.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Tue Apr 8 02:25:33 EDT 2025
% 0.13/0.34 % CPUTime :
% 16.34/5.62 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 16.34/5.63
% 16.34/5.63 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------