TSTP Solution File: KLE150+1 by Z3---4.8.9.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Z3---4.8.9.0
% Problem : KLE150+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp
% Command : z3_tptp -proof -model -t:%d -file:%s
% Computer : n013.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 Sep 17 17:24:21 EDT 2022
% Result : Theorem 0.16s 0.36s
% Output : Proof 0.16s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10 % Problem : KLE150+1 : TPTP v8.1.0. Released v4.0.0.
% 0.00/0.10 % Command : z3_tptp -proof -model -t:%d -file:%s
% 0.10/0.31 % Computer : n013.cluster.edu
% 0.10/0.31 % Model : x86_64 x86_64
% 0.10/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31 % Memory : 8042.1875MB
% 0.10/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.31 % CPULimit : 300
% 0.10/0.31 % WCLimit : 300
% 0.10/0.31 % DateTime : Thu Sep 1 08:46:47 EDT 2022
% 0.10/0.31 % CPUTime :
% 0.10/0.31 Z3tptp [4.8.9.0] (c) 2006-20**. Microsoft Corp.
% 0.10/0.31 Usage: tptp [options] [-file:]file
% 0.10/0.31 -h, -? prints this message.
% 0.10/0.31 -smt2 print SMT-LIB2 benchmark.
% 0.10/0.31 -m, -model generate model.
% 0.10/0.31 -p, -proof generate proof.
% 0.10/0.31 -c, -core generate unsat core of named formulas.
% 0.10/0.31 -st, -statistics display statistics.
% 0.10/0.31 -t:timeout set timeout (in second).
% 0.10/0.31 -smt2status display status in smt2 format instead of SZS.
% 0.10/0.31 -check_status check the status produced by Z3 against annotation in benchmark.
% 0.10/0.31 -<param>:<value> configuration parameter and value.
% 0.10/0.31 -o:<output-file> file to place output in.
% 0.16/0.36 % SZS status Theorem
% 0.16/0.36 % SZS output start Proof
% 0.16/0.36 tff(addition_type, type, (
% 0.16/0.36 addition: ( $i * $i ) > $i)).
% 0.16/0.36 tff(multiplication_type, type, (
% 0.16/0.36 multiplication: ( $i * $i ) > $i)).
% 0.16/0.36 tff(zero_type, type, (
% 0.16/0.36 zero: $i)).
% 0.16/0.36 tff(tptp_fun_X0_0_type, type, (
% 0.16/0.36 tptp_fun_X0_0: $i)).
% 0.16/0.36 tff(one_type, type, (
% 0.16/0.36 one: $i)).
% 0.16/0.36 tff(strong_iteration_type, type, (
% 0.16/0.36 strong_iteration: $i > $i)).
% 0.16/0.36 tff(1,plain,
% 0.16/0.36 (^[A: $i] : refl((strong_iteration(A) = addition(multiplication(A, strong_iteration(A)), one)) <=> (strong_iteration(A) = addition(multiplication(A, strong_iteration(A)), one)))),
% 0.16/0.36 inference(bind,[status(th)],[])).
% 0.16/0.36 tff(2,plain,
% 0.16/0.36 (![A: $i] : (strong_iteration(A) = addition(multiplication(A, strong_iteration(A)), one)) <=> ![A: $i] : (strong_iteration(A) = addition(multiplication(A, strong_iteration(A)), one))),
% 0.16/0.36 inference(quant_intro,[status(thm)],[1])).
% 0.16/0.36 tff(3,plain,
% 0.16/0.36 (![A: $i] : (strong_iteration(A) = addition(multiplication(A, strong_iteration(A)), one)) <=> ![A: $i] : (strong_iteration(A) = addition(multiplication(A, strong_iteration(A)), one))),
% 0.16/0.36 inference(rewrite,[status(thm)],[])).
% 0.16/0.36 tff(4,axiom,(![A: $i] : (strong_iteration(A) = addition(multiplication(A, strong_iteration(A)), one))), file('/export/starexec/sandbox2/benchmark/Axioms/KLE004+0.ax','infty_unfold1')).
% 0.16/0.36 tff(5,plain,
% 0.16/0.36 (![A: $i] : (strong_iteration(A) = addition(multiplication(A, strong_iteration(A)), one))),
% 0.16/0.36 inference(modus_ponens,[status(thm)],[4, 3])).
% 0.16/0.36 tff(6,plain,(
% 0.16/0.36 ![A: $i] : (strong_iteration(A) = addition(multiplication(A, strong_iteration(A)), one))),
% 0.16/0.36 inference(skolemize,[status(sab)],[5])).
% 0.16/0.36 tff(7,plain,
% 0.16/0.36 (![A: $i] : (strong_iteration(A) = addition(multiplication(A, strong_iteration(A)), one))),
% 0.16/0.36 inference(modus_ponens,[status(thm)],[6, 2])).
% 0.16/0.36 tff(8,plain,
% 0.16/0.36 ((~![A: $i] : (strong_iteration(A) = addition(multiplication(A, strong_iteration(A)), one))) | (strong_iteration(multiplication(X0!0, zero)) = addition(multiplication(multiplication(X0!0, zero), strong_iteration(multiplication(X0!0, zero))), one))),
% 0.16/0.36 inference(quant_inst,[status(thm)],[])).
% 0.16/0.36 tff(9,plain,
% 0.16/0.36 (strong_iteration(multiplication(X0!0, zero)) = addition(multiplication(multiplication(X0!0, zero), strong_iteration(multiplication(X0!0, zero))), one)),
% 0.16/0.36 inference(unit_resolution,[status(thm)],[8, 7])).
% 0.16/0.36 tff(10,plain,
% 0.16/0.36 (multiplication(multiplication(X0!0, zero), strong_iteration(multiplication(X0!0, zero))) = multiplication(multiplication(X0!0, zero), addition(multiplication(multiplication(X0!0, zero), strong_iteration(multiplication(X0!0, zero))), one))),
% 0.16/0.36 inference(monotonicity,[status(thm)],[9])).
% 0.16/0.36 tff(11,plain,
% 0.16/0.36 (multiplication(multiplication(X0!0, zero), addition(multiplication(multiplication(X0!0, zero), strong_iteration(multiplication(X0!0, zero))), one)) = multiplication(multiplication(X0!0, zero), strong_iteration(multiplication(X0!0, zero)))),
% 0.16/0.36 inference(symmetry,[status(thm)],[10])).
% 0.16/0.36 tff(12,plain,
% 0.16/0.36 (^[A: $i, B: $i, C: $i] : refl((multiplication(A, multiplication(B, C)) = multiplication(multiplication(A, B), C)) <=> (multiplication(A, multiplication(B, C)) = multiplication(multiplication(A, B), C)))),
% 0.16/0.36 inference(bind,[status(th)],[])).
% 0.16/0.36 tff(13,plain,
% 0.16/0.36 (![A: $i, B: $i, C: $i] : (multiplication(A, multiplication(B, C)) = multiplication(multiplication(A, B), C)) <=> ![A: $i, B: $i, C: $i] : (multiplication(A, multiplication(B, C)) = multiplication(multiplication(A, B), C))),
% 0.16/0.36 inference(quant_intro,[status(thm)],[12])).
% 0.16/0.36 tff(14,plain,
% 0.16/0.36 (![A: $i, B: $i, C: $i] : (multiplication(A, multiplication(B, C)) = multiplication(multiplication(A, B), C)) <=> ![A: $i, B: $i, C: $i] : (multiplication(A, multiplication(B, C)) = multiplication(multiplication(A, B), C))),
% 0.16/0.36 inference(rewrite,[status(thm)],[])).
% 0.16/0.36 tff(15,axiom,(![A: $i, B: $i, C: $i] : (multiplication(A, multiplication(B, C)) = multiplication(multiplication(A, B), C))), file('/export/starexec/sandbox2/benchmark/Axioms/KLE004+0.ax','multiplicative_associativity')).
% 0.16/0.36 tff(16,plain,
% 0.16/0.36 (![A: $i, B: $i, C: $i] : (multiplication(A, multiplication(B, C)) = multiplication(multiplication(A, B), C))),
% 0.16/0.36 inference(modus_ponens,[status(thm)],[15, 14])).
% 0.16/0.36 tff(17,plain,(
% 0.16/0.36 ![A: $i, B: $i, C: $i] : (multiplication(A, multiplication(B, C)) = multiplication(multiplication(A, B), C))),
% 0.16/0.36 inference(skolemize,[status(sab)],[16])).
% 0.16/0.36 tff(18,plain,
% 0.16/0.36 (![A: $i, B: $i, C: $i] : (multiplication(A, multiplication(B, C)) = multiplication(multiplication(A, B), C))),
% 0.16/0.36 inference(modus_ponens,[status(thm)],[17, 13])).
% 0.16/0.36 tff(19,plain,
% 0.16/0.36 ((~![A: $i, B: $i, C: $i] : (multiplication(A, multiplication(B, C)) = multiplication(multiplication(A, B), C))) | (multiplication(X0!0, multiplication(zero, addition(multiplication(multiplication(X0!0, zero), strong_iteration(multiplication(X0!0, zero))), one))) = multiplication(multiplication(X0!0, zero), addition(multiplication(multiplication(X0!0, zero), strong_iteration(multiplication(X0!0, zero))), one)))),
% 0.16/0.36 inference(quant_inst,[status(thm)],[])).
% 0.16/0.36 tff(20,plain,
% 0.16/0.36 (multiplication(X0!0, multiplication(zero, addition(multiplication(multiplication(X0!0, zero), strong_iteration(multiplication(X0!0, zero))), one))) = multiplication(multiplication(X0!0, zero), addition(multiplication(multiplication(X0!0, zero), strong_iteration(multiplication(X0!0, zero))), one))),
% 0.16/0.36 inference(unit_resolution,[status(thm)],[19, 18])).
% 0.16/0.36 tff(21,plain,
% 0.16/0.36 (^[A: $i] : refl((multiplication(zero, A) = zero) <=> (multiplication(zero, A) = zero))),
% 0.16/0.36 inference(bind,[status(th)],[])).
% 0.16/0.36 tff(22,plain,
% 0.16/0.36 (![A: $i] : (multiplication(zero, A) = zero) <=> ![A: $i] : (multiplication(zero, A) = zero)),
% 0.16/0.36 inference(quant_intro,[status(thm)],[21])).
% 0.16/0.36 tff(23,plain,
% 0.16/0.36 (![A: $i] : (multiplication(zero, A) = zero) <=> ![A: $i] : (multiplication(zero, A) = zero)),
% 0.16/0.36 inference(rewrite,[status(thm)],[])).
% 0.16/0.36 tff(24,axiom,(![A: $i] : (multiplication(zero, A) = zero)), file('/export/starexec/sandbox2/benchmark/Axioms/KLE004+0.ax','left_annihilation')).
% 0.16/0.36 tff(25,plain,
% 0.16/0.36 (![A: $i] : (multiplication(zero, A) = zero)),
% 0.16/0.36 inference(modus_ponens,[status(thm)],[24, 23])).
% 0.16/0.36 tff(26,plain,(
% 0.16/0.36 ![A: $i] : (multiplication(zero, A) = zero)),
% 0.16/0.36 inference(skolemize,[status(sab)],[25])).
% 0.16/0.36 tff(27,plain,
% 0.16/0.36 (![A: $i] : (multiplication(zero, A) = zero)),
% 0.16/0.36 inference(modus_ponens,[status(thm)],[26, 22])).
% 0.16/0.36 tff(28,plain,
% 0.16/0.36 ((~![A: $i] : (multiplication(zero, A) = zero)) | (multiplication(zero, addition(multiplication(multiplication(X0!0, zero), strong_iteration(multiplication(X0!0, zero))), one)) = zero)),
% 0.16/0.36 inference(quant_inst,[status(thm)],[])).
% 0.16/0.36 tff(29,plain,
% 0.16/0.36 (multiplication(zero, addition(multiplication(multiplication(X0!0, zero), strong_iteration(multiplication(X0!0, zero))), one)) = zero),
% 0.16/0.36 inference(unit_resolution,[status(thm)],[28, 27])).
% 0.16/0.36 tff(30,plain,
% 0.16/0.36 (zero = multiplication(zero, addition(multiplication(multiplication(X0!0, zero), strong_iteration(multiplication(X0!0, zero))), one))),
% 0.16/0.36 inference(symmetry,[status(thm)],[29])).
% 0.16/0.36 tff(31,plain,
% 0.16/0.36 (multiplication(X0!0, zero) = multiplication(X0!0, multiplication(zero, addition(multiplication(multiplication(X0!0, zero), strong_iteration(multiplication(X0!0, zero))), one)))),
% 0.16/0.36 inference(monotonicity,[status(thm)],[30])).
% 0.16/0.36 tff(32,plain,
% 0.16/0.36 (multiplication(X0!0, zero) = multiplication(multiplication(X0!0, zero), strong_iteration(multiplication(X0!0, zero)))),
% 0.16/0.36 inference(transitivity,[status(thm)],[31, 20, 11])).
% 0.16/0.36 tff(33,plain,
% 0.16/0.36 (addition(one, multiplication(X0!0, zero)) = addition(one, multiplication(multiplication(X0!0, zero), strong_iteration(multiplication(X0!0, zero))))),
% 0.16/0.36 inference(monotonicity,[status(thm)],[32])).
% 0.16/0.36 tff(34,plain,
% 0.16/0.36 (addition(one, multiplication(multiplication(X0!0, zero), strong_iteration(multiplication(X0!0, zero)))) = addition(one, multiplication(X0!0, zero))),
% 0.16/0.36 inference(symmetry,[status(thm)],[33])).
% 0.16/0.36 tff(35,plain,
% 0.16/0.36 (^[A: $i, B: $i] : refl((addition(A, B) = addition(B, A)) <=> (addition(A, B) = addition(B, A)))),
% 0.16/0.36 inference(bind,[status(th)],[])).
% 0.16/0.36 tff(36,plain,
% 0.16/0.36 (![A: $i, B: $i] : (addition(A, B) = addition(B, A)) <=> ![A: $i, B: $i] : (addition(A, B) = addition(B, A))),
% 0.16/0.36 inference(quant_intro,[status(thm)],[35])).
% 0.16/0.36 tff(37,plain,
% 0.16/0.37 (![A: $i, B: $i] : (addition(A, B) = addition(B, A)) <=> ![A: $i, B: $i] : (addition(A, B) = addition(B, A))),
% 0.16/0.37 inference(rewrite,[status(thm)],[])).
% 0.16/0.37 tff(38,axiom,(![A: $i, B: $i] : (addition(A, B) = addition(B, A))), file('/export/starexec/sandbox2/benchmark/Axioms/KLE004+0.ax','additive_commutativity')).
% 0.16/0.37 tff(39,plain,
% 0.16/0.37 (![A: $i, B: $i] : (addition(A, B) = addition(B, A))),
% 0.16/0.37 inference(modus_ponens,[status(thm)],[38, 37])).
% 0.16/0.37 tff(40,plain,(
% 0.16/0.37 ![A: $i, B: $i] : (addition(A, B) = addition(B, A))),
% 0.16/0.37 inference(skolemize,[status(sab)],[39])).
% 0.16/0.37 tff(41,plain,
% 0.16/0.37 (![A: $i, B: $i] : (addition(A, B) = addition(B, A))),
% 0.16/0.37 inference(modus_ponens,[status(thm)],[40, 36])).
% 0.16/0.37 tff(42,plain,
% 0.16/0.37 ((~![A: $i, B: $i] : (addition(A, B) = addition(B, A))) | (addition(multiplication(multiplication(X0!0, zero), strong_iteration(multiplication(X0!0, zero))), one) = addition(one, multiplication(multiplication(X0!0, zero), strong_iteration(multiplication(X0!0, zero)))))),
% 0.16/0.37 inference(quant_inst,[status(thm)],[])).
% 0.16/0.37 tff(43,plain,
% 0.16/0.37 (addition(multiplication(multiplication(X0!0, zero), strong_iteration(multiplication(X0!0, zero))), one) = addition(one, multiplication(multiplication(X0!0, zero), strong_iteration(multiplication(X0!0, zero))))),
% 0.16/0.37 inference(unit_resolution,[status(thm)],[42, 41])).
% 0.16/0.37 tff(44,plain,
% 0.16/0.37 (strong_iteration(multiplication(X0!0, zero)) = addition(one, multiplication(X0!0, zero))),
% 0.16/0.37 inference(transitivity,[status(thm)],[9, 43, 34])).
% 0.16/0.37 tff(45,plain,
% 0.16/0.37 ((~![X0: $i] : (strong_iteration(multiplication(X0, zero)) = addition(one, multiplication(X0, zero)))) <=> (~![X0: $i] : (strong_iteration(multiplication(X0, zero)) = addition(one, multiplication(X0, zero))))),
% 0.16/0.37 inference(rewrite,[status(thm)],[])).
% 0.16/0.37 tff(46,axiom,(~![X0: $i] : (strong_iteration(multiplication(X0, zero)) = addition(one, multiplication(X0, zero)))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p','goals')).
% 0.16/0.37 tff(47,plain,
% 0.16/0.37 (~![X0: $i] : (strong_iteration(multiplication(X0, zero)) = addition(one, multiplication(X0, zero)))),
% 0.16/0.37 inference(modus_ponens,[status(thm)],[46, 45])).
% 0.16/0.37 tff(48,plain,
% 0.16/0.37 (~![X0: $i] : (strong_iteration(multiplication(X0, zero)) = addition(one, multiplication(X0, zero)))),
% 0.16/0.37 inference(modus_ponens,[status(thm)],[47, 45])).
% 0.16/0.37 tff(49,plain,
% 0.16/0.37 (~![X0: $i] : (strong_iteration(multiplication(X0, zero)) = addition(one, multiplication(X0, zero)))),
% 0.16/0.37 inference(modus_ponens,[status(thm)],[48, 45])).
% 0.16/0.37 tff(50,plain,
% 0.16/0.37 (~![X0: $i] : (strong_iteration(multiplication(X0, zero)) = addition(one, multiplication(X0, zero)))),
% 0.16/0.37 inference(modus_ponens,[status(thm)],[49, 45])).
% 0.16/0.37 tff(51,plain,
% 0.16/0.37 (~![X0: $i] : (strong_iteration(multiplication(X0, zero)) = addition(one, multiplication(X0, zero)))),
% 0.16/0.37 inference(modus_ponens,[status(thm)],[50, 45])).
% 0.16/0.37 tff(52,plain,
% 0.16/0.37 (~![X0: $i] : (strong_iteration(multiplication(X0, zero)) = addition(one, multiplication(X0, zero)))),
% 0.16/0.37 inference(modus_ponens,[status(thm)],[51, 45])).
% 0.16/0.37 tff(53,plain,
% 0.16/0.37 (~![X0: $i] : (strong_iteration(multiplication(X0, zero)) = addition(one, multiplication(X0, zero)))),
% 0.16/0.37 inference(modus_ponens,[status(thm)],[52, 45])).
% 0.16/0.37 tff(54,plain,(
% 0.16/0.37 ~(strong_iteration(multiplication(X0!0, zero)) = addition(one, multiplication(X0!0, zero)))),
% 0.16/0.37 inference(skolemize,[status(sab)],[53])).
% 0.16/0.37 tff(55,plain,
% 0.16/0.37 ($false),
% 0.16/0.37 inference(unit_resolution,[status(thm)],[54, 44])).
% 0.16/0.37 % SZS output end Proof
%------------------------------------------------------------------------------