TSTP Solution File: KLE076+1 by Z3---4.8.9.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Z3---4.8.9.0
% Problem : KLE076+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp
% Command : z3_tptp -proof -model -t:%d -file:%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 : Sat Sep 17 17:24:06 EDT 2022
% Result : Theorem 0.20s 0.38s
% Output : Proof 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : KLE076+1 : TPTP v8.1.0. Released v4.0.0.
% 0.03/0.12 % Command : z3_tptp -proof -model -t:%d -file:%s
% 0.12/0.33 % Computer : n011.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 : Thu Sep 1 08:11:27 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.12/0.33 Z3tptp [4.8.9.0] (c) 2006-20**. Microsoft Corp.
% 0.12/0.33 Usage: tptp [options] [-file:]file
% 0.12/0.33 -h, -? prints this message.
% 0.12/0.33 -smt2 print SMT-LIB2 benchmark.
% 0.12/0.33 -m, -model generate model.
% 0.12/0.33 -p, -proof generate proof.
% 0.12/0.33 -c, -core generate unsat core of named formulas.
% 0.12/0.33 -st, -statistics display statistics.
% 0.12/0.33 -t:timeout set timeout (in second).
% 0.12/0.33 -smt2status display status in smt2 format instead of SZS.
% 0.12/0.33 -check_status check the status produced by Z3 against annotation in benchmark.
% 0.12/0.33 -<param>:<value> configuration parameter and value.
% 0.12/0.33 -o:<output-file> file to place output in.
% 0.20/0.38 % SZS status Theorem
% 0.20/0.38 % SZS output start Proof
% 0.20/0.38 tff(zero_type, type, (
% 0.20/0.38 zero: $i)).
% 0.20/0.38 tff(domain_type, type, (
% 0.20/0.38 domain: $i > $i)).
% 0.20/0.38 tff(multiplication_type, type, (
% 0.20/0.38 multiplication: ( $i * $i ) > $i)).
% 0.20/0.38 tff(tptp_fun_X0_0_type, type, (
% 0.20/0.38 tptp_fun_X0_0: $i)).
% 0.20/0.38 tff(1,plain,
% 0.20/0.38 ((domain(zero) = zero) <=> (domain(zero) = zero)),
% 0.20/0.38 inference(rewrite,[status(thm)],[])).
% 0.20/0.38 tff(2,axiom,(domain(zero) = zero), file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+5.ax','domain4')).
% 0.20/0.38 tff(3,plain,
% 0.20/0.38 (domain(zero) = zero),
% 0.20/0.38 inference(modus_ponens,[status(thm)],[2, 1])).
% 0.20/0.38 tff(4,plain,
% 0.20/0.38 (^[A: $i] : refl((multiplication(A, zero) = zero) <=> (multiplication(A, zero) = zero))),
% 0.20/0.38 inference(bind,[status(th)],[])).
% 0.20/0.38 tff(5,plain,
% 0.20/0.38 (![A: $i] : (multiplication(A, zero) = zero) <=> ![A: $i] : (multiplication(A, zero) = zero)),
% 0.20/0.38 inference(quant_intro,[status(thm)],[4])).
% 0.20/0.38 tff(6,plain,
% 0.20/0.38 (![A: $i] : (multiplication(A, zero) = zero) <=> ![A: $i] : (multiplication(A, zero) = zero)),
% 0.20/0.38 inference(rewrite,[status(thm)],[])).
% 0.20/0.38 tff(7,axiom,(![A: $i] : (multiplication(A, zero) = zero)), file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+0.ax','right_annihilation')).
% 0.20/0.38 tff(8,plain,
% 0.20/0.38 (![A: $i] : (multiplication(A, zero) = zero)),
% 0.20/0.38 inference(modus_ponens,[status(thm)],[7, 6])).
% 0.20/0.38 tff(9,plain,(
% 0.20/0.38 ![A: $i] : (multiplication(A, zero) = zero)),
% 0.20/0.38 inference(skolemize,[status(sab)],[8])).
% 0.20/0.38 tff(10,plain,
% 0.20/0.38 (![A: $i] : (multiplication(A, zero) = zero)),
% 0.20/0.38 inference(modus_ponens,[status(thm)],[9, 5])).
% 0.20/0.38 tff(11,plain,
% 0.20/0.38 ((~![A: $i] : (multiplication(A, zero) = zero)) | (multiplication(X0!0, zero) = zero)),
% 0.20/0.38 inference(quant_inst,[status(thm)],[])).
% 0.20/0.38 tff(12,plain,
% 0.20/0.38 (multiplication(X0!0, zero) = zero),
% 0.20/0.38 inference(unit_resolution,[status(thm)],[11, 10])).
% 0.20/0.38 tff(13,plain,
% 0.20/0.38 (domain(multiplication(X0!0, zero)) = domain(zero)),
% 0.20/0.38 inference(monotonicity,[status(thm)],[12])).
% 0.20/0.38 tff(14,plain,
% 0.20/0.38 (domain(multiplication(X0!0, zero)) = zero),
% 0.20/0.38 inference(transitivity,[status(thm)],[13, 3])).
% 0.20/0.38 tff(15,plain,
% 0.20/0.38 ((~![X0: $i] : (domain(multiplication(X0, zero)) = zero)) <=> (~![X0: $i] : (domain(multiplication(X0, zero)) = zero))),
% 0.20/0.38 inference(rewrite,[status(thm)],[])).
% 0.20/0.38 tff(16,plain,
% 0.20/0.38 ((~![X0: $i] : (domain(multiplication(X0, domain(zero))) = zero)) <=> (~![X0: $i] : (domain(multiplication(X0, zero)) = zero))),
% 0.20/0.38 inference(rewrite,[status(thm)],[])).
% 0.20/0.38 tff(17,plain,
% 0.20/0.38 ((~![X0: $i] : (domain(multiplication(X0, domain(zero))) = zero)) <=> (~![X0: $i] : (domain(multiplication(X0, domain(zero))) = zero))),
% 0.20/0.38 inference(rewrite,[status(thm)],[])).
% 0.20/0.38 tff(18,axiom,(~![X0: $i] : (domain(multiplication(X0, domain(zero))) = zero)), file('/export/starexec/sandbox2/benchmark/theBenchmark.p','goals')).
% 0.20/0.38 tff(19,plain,
% 0.20/0.38 (~![X0: $i] : (domain(multiplication(X0, domain(zero))) = zero)),
% 0.20/0.38 inference(modus_ponens,[status(thm)],[18, 17])).
% 0.20/0.38 tff(20,plain,
% 0.20/0.38 (~![X0: $i] : (domain(multiplication(X0, domain(zero))) = zero)),
% 0.20/0.38 inference(modus_ponens,[status(thm)],[19, 17])).
% 0.20/0.38 tff(21,plain,
% 0.20/0.38 (~![X0: $i] : (domain(multiplication(X0, domain(zero))) = zero)),
% 0.20/0.38 inference(modus_ponens,[status(thm)],[20, 17])).
% 0.20/0.38 tff(22,plain,
% 0.20/0.38 (~![X0: $i] : (domain(multiplication(X0, domain(zero))) = zero)),
% 0.20/0.38 inference(modus_ponens,[status(thm)],[21, 17])).
% 0.20/0.38 tff(23,plain,
% 0.20/0.38 (~![X0: $i] : (domain(multiplication(X0, domain(zero))) = zero)),
% 0.20/0.38 inference(modus_ponens,[status(thm)],[22, 17])).
% 0.20/0.38 tff(24,plain,
% 0.20/0.38 (~![X0: $i] : (domain(multiplication(X0, zero)) = zero)),
% 0.20/0.38 inference(modus_ponens,[status(thm)],[23, 16])).
% 0.20/0.38 tff(25,plain,
% 0.20/0.38 (~![X0: $i] : (domain(multiplication(X0, zero)) = zero)),
% 0.20/0.38 inference(modus_ponens,[status(thm)],[24, 15])).
% 0.20/0.38 tff(26,plain,
% 0.20/0.38 (~![X0: $i] : (domain(multiplication(X0, zero)) = zero)),
% 0.20/0.38 inference(modus_ponens,[status(thm)],[25, 15])).
% 0.20/0.38 tff(27,plain,
% 0.20/0.38 (~![X0: $i] : (domain(multiplication(X0, zero)) = zero)),
% 0.20/0.38 inference(modus_ponens,[status(thm)],[26, 15])).
% 0.20/0.38 tff(28,plain,(
% 0.20/0.38 ~(domain(multiplication(X0!0, zero)) = zero)),
% 0.20/0.38 inference(skolemize,[status(sab)],[27])).
% 0.20/0.38 tff(29,plain,
% 0.20/0.38 ($false),
% 0.20/0.38 inference(unit_resolution,[status(thm)],[28, 14])).
% 0.20/0.38 % SZS output end Proof
%------------------------------------------------------------------------------