%------------------------------------------------------------------------------
% File : Z3---4.15.1
% Problem : KLE051+1 : TPTP v9.0.0. Released v4.0.0.
% Transfm : none
% Format : tptp
% Command : run_E %s %d THM
% 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 : Sat Jun 21 05:12:57 AM UTC 2025
% Result : Theorem 0.14s 0.39s
% Output : Proof 0.14s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13 % Problem : KLE051+1 : TPTP v9.0.0. Released v4.0.0.
% 0.12/0.13 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n011.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Thu Jun 19 18:56:41 EDT 2025
% 0.14/0.35 % CPUTime :
% 0.14/0.39 % SZS status Theorem
% 0.14/0.39 % SZS output start Proof
% 0.14/0.39 tff(tptp_fun_X0_0_type, type, (
% 0.14/0.39 tptp_fun_X0_0: $i)).
% 0.14/0.39 tff(addition_type, type, (
% 0.14/0.39 addition: ( $i * $i ) > $i)).
% 0.14/0.39 tff(1,plain,
% 0.14/0.39 ((~![X0: $i] : (addition(X0, X0) = X0)) <=> (~![X0: $i] : (addition(X0, X0) = X0))),
% 0.14/0.39 inference(rewrite,[status(thm)],[])).
% 0.14/0.39 tff(2,axiom,(~![X0: $i] : (addition(X0, X0) = X0)), file('/export/starexec/sandbox/benchmark/theBenchmark.p','goals')).
% 0.14/0.39 tff(3,plain,
% 0.14/0.39 (~![X0: $i] : (addition(X0, X0) = X0)),
% 0.14/0.39 inference(modus_ponens,[status(thm)],[2, 1])).
% 0.14/0.39 tff(4,plain,
% 0.14/0.39 (~![X0: $i] : (addition(X0, X0) = X0)),
% 0.14/0.39 inference(modus_ponens,[status(thm)],[3, 1])).
% 0.14/0.39 tff(5,plain,
% 0.14/0.39 (~![X0: $i] : (addition(X0, X0) = X0)),
% 0.14/0.39 inference(modus_ponens,[status(thm)],[4, 1])).
% 0.14/0.39 tff(6,plain,
% 0.14/0.39 (~![X0: $i] : (addition(X0, X0) = X0)),
% 0.14/0.39 inference(modus_ponens,[status(thm)],[5, 1])).
% 0.14/0.39 tff(7,plain,(
% 0.14/0.39 ~(addition(X0!0, X0!0) = X0!0)),
% 0.14/0.39 inference(skolemize,[status(sab)],[6])).
% 0.14/0.39 tff(8,plain,
% 0.14/0.39 (^[A: $i] : refl((addition(A, A) = A) <=> (addition(A, A) = A))),
% 0.14/0.39 inference(bind,[status(th)],[])).
% 0.14/0.39 tff(9,plain,
% 0.14/0.39 (![A: $i] : (addition(A, A) = A) <=> ![A: $i] : (addition(A, A) = A)),
% 0.14/0.39 inference(quant_intro,[status(thm)],[8])).
% 0.14/0.39 tff(10,plain,
% 0.14/0.39 (![A: $i] : (addition(A, A) = A) <=> ![A: $i] : (addition(A, A) = A)),
% 0.14/0.39 inference(rewrite,[status(thm)],[])).
% 0.14/0.39 tff(11,axiom,(![A: $i] : (addition(A, A) = A)), file('/export/starexec/sandbox/benchmark/Axioms/KLE001+0.ax','additive_idempotence')).
% 0.14/0.39 tff(12,plain,
% 0.14/0.39 (![A: $i] : (addition(A, A) = A)),
% 0.14/0.39 inference(modus_ponens,[status(thm)],[11, 10])).
% 0.14/0.39 tff(13,plain,(
% 0.14/0.39 ![A: $i] : (addition(A, A) = A)),
% 0.14/0.39 inference(skolemize,[status(sab)],[12])).
% 0.14/0.39 tff(14,plain,
% 0.14/0.39 (![A: $i] : (addition(A, A) = A)),
% 0.14/0.39 inference(modus_ponens,[status(thm)],[13, 9])).
% 0.14/0.39 tff(15,plain,
% 0.14/0.39 ((~![A: $i] : (addition(A, A) = A)) | (addition(X0!0, X0!0) = X0!0)),
% 0.14/0.39 inference(quant_inst,[status(thm)],[])).
% 0.14/0.39 tff(16,plain,
% 0.14/0.39 ($false),
% 0.14/0.39 inference(unit_resolution,[status(thm)],[15, 14, 7])).
% 0.14/0.39 % SZS output end Proof
% 0.14/0.39 % E exiting
%------------------------------------------------------------------------------