%------------------------------------------------------------------------------
% File : Beagle---0.9.52
% Problem : KLE052+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:41 PM UTC 2025
% Result : Theorem 4.76s 2.20s
% Output : CNFRefutation 5.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 6
% Syntax : Number of formulae : 17 ( 17 unt; 0 typ; 0 def)
% Number of atoms : 17 ( 16 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 2 ( 2 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 22 ( 22 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ leq > multiplication > addition > #nlpp > domain > zero > one > #skF_1
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(domain,type,
domain: $i > $i ).
tff(multiplication,type,
multiplication: ( $i * $i ) > $i ).
tff(addition,type,
addition: ( $i * $i ) > $i ).
tff('#skF_1',type,
'#skF_1': $i ).
tff(one,type,
one: $i ).
tff(leq,type,
leq: ( $i * $i ) > $o ).
tff(zero,type,
zero: $i ).
tff(f_65,axiom,
! [A] : ( multiplication(one,A) = A ),
file('/export/starexec/sandbox/benchmark/Axioms/KLE001+0.ax',multiplicative_left_identity) ).
tff(f_117,axiom,
! [X0] : ( addition(domain(X0),one) = one ),
file('/export/starexec/sandbox/benchmark/Axioms/KLE001+5.ax',domain3) ).
tff(f_52,axiom,
! [A,B] : ( addition(A,B) = addition(B,A) ),
file('/export/starexec/sandbox/benchmark/Axioms/KLE001+0.ax',additive_commutativity) ).
tff(f_70,axiom,
! [A,B,C] : ( multiplication(addition(A,B),C) = addition(multiplication(A,C),multiplication(B,C)) ),
file('/export/starexec/sandbox/benchmark/Axioms/KLE001+0.ax',left_distributivity) ).
tff(f_113,axiom,
! [X0] : ( addition(X0,multiplication(domain(X0),X0)) = multiplication(domain(X0),X0) ),
file('/export/starexec/sandbox/benchmark/Axioms/KLE001+5.ax',domain1) ).
tff(f_125,negated_conjecture,
~ ! [X0] : ( multiplication(domain(X0),X0) = X0 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).
tff(c_14,plain,
! [A_12] : ( multiplication(one,A_12) = A_12 ),
inference(cnfTransformation,[status(thm)],[f_65]) ).
tff(c_32,plain,
! [X0_26] : ( addition(domain(X0_26),one) = one ),
inference(cnfTransformation,[status(thm)],[f_117]) ).
tff(c_150,plain,
! [B_36,A_37] : ( addition(B_36,A_37) = addition(A_37,B_36) ),
inference(cnfTransformation,[status(thm)],[f_52]) ).
tff(c_194,plain,
! [X0_26] : ( addition(one,domain(X0_26)) = one ),
inference(superposition,[status(thm),theory(equality)],[c_32,c_150]) ).
tff(c_1374,plain,
! [A_69,C_70,B_71] : ( addition(multiplication(A_69,C_70),multiplication(B_71,C_70)) = multiplication(addition(A_69,B_71),C_70) ),
inference(cnfTransformation,[status(thm)],[f_70]) ).
tff(c_2834,plain,
! [B_89,A_90] : ( multiplication(addition(one,B_89),A_90) = addition(A_90,multiplication(B_89,A_90)) ),
inference(superposition,[status(thm),theory(equality)],[c_14,c_1374]) ).
tff(c_28,plain,
! [X0_23] : ( addition(X0_23,multiplication(domain(X0_23),X0_23)) = multiplication(domain(X0_23),X0_23) ),
inference(cnfTransformation,[status(thm)],[f_113]) ).
tff(c_2884,plain,
! [A_90] : ( multiplication(addition(one,domain(A_90)),A_90) = multiplication(domain(A_90),A_90) ),
inference(superposition,[status(thm),theory(equality)],[c_2834,c_28]) ).
tff(c_2971,plain,
! [A_90] : ( multiplication(domain(A_90),A_90) = A_90 ),
inference(demodulation,[status(thm),theory(equality)],[c_14,c_194,c_2884]) ).
tff(c_38,plain,
multiplication(domain('#skF_1'),'#skF_1') != '#skF_1',
inference(cnfTransformation,[status(thm)],[f_125]) ).
tff(c_2990,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_2971,c_38]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : KLE052+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.14/0.34 % Computer : n025.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Tue Apr 8 02:34:35 EDT 2025
% 0.14/0.34 % CPUTime :
% 4.76/2.20 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 4.76/2.21
% 4.76/2.21 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------