%------------------------------------------------------------------------------
% File : Beagle---0.9.52
% Problem : KLE005+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/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 : Wed Apr 9 07:04:32 PM UTC 2025
% Result : Theorem 3.31s 1.86s
% Output : CNFRefutation 3.31s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 5
% Syntax : Number of formulae : 15 ( 7 unt; 0 typ; 0 def)
% Number of atoms : 26 ( 14 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 19 ( 8 ~; 5 |; 2 &)
% ( 2 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 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 : 12 ( 12 !; 0 ?; 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(one) != zero,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).
tff(f_131,axiom,
! [X0] :
( ~ test(X0)
=> ( c(X0) = zero ) ),
file('/export/starexec/sandbox/benchmark/Axioms/KLE001+1.ax',test_4) ).
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(c_46,plain,
c(one) != zero,
inference(cnfTransformation,[status(thm)],[f_135]) ).
tff(c_44,plain,
! [X0_31] :
( ( c(X0_31) = zero )
| test(X0_31) ),
inference(cnfTransformation,[status(thm)],[f_131]) ).
tff(c_42,plain,
! [X0_29] :
( complement(X0_29,c(X0_29))
| ~ test(X0_29) ),
inference(cnfTransformation,[status(thm)],[f_126]) ).
tff(c_275,plain,
! [X0_53,X1_54] :
( ( multiplication(X0_53,X1_54) = zero )
| ~ complement(X1_54,X0_53) ),
inference(cnfTransformation,[status(thm)],[f_120]) ).
tff(c_289,plain,
! [X0_57] :
( ( multiplication(c(X0_57),X0_57) = zero )
| ~ test(X0_57) ),
inference(resolution,[status(thm)],[c_42,c_275]) ).
tff(c_12,plain,
! [A_11] : ( multiplication(A_11,one) = A_11 ),
inference(cnfTransformation,[status(thm)],[f_62]) ).
tff(c_300,plain,
( ( c(one) = zero )
| ~ test(one) ),
inference(superposition,[status(thm),theory(equality)],[c_289,c_12]) ).
tff(c_314,plain,
~ test(one),
inference(negUnitSimplification,[status(thm)],[c_46,c_300]) ).
tff(c_320,plain,
c(one) = zero,
inference(resolution,[status(thm)],[c_44,c_314]) ).
tff(c_324,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_46,c_320]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : KLE005+1 : TPTP v9.0.0. Released v4.0.0.
% 0.11/0.13 % 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.12/0.33 % Computer : n025.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Tue Apr 8 02:25:50 EDT 2025
% 0.12/0.34 % CPUTime :
% 3.31/1.86 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.31/1.86
% 3.31/1.86 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------