TSTP Solution File: KLE059+1 by Z3---4.8.9.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Z3---4.8.9.0
% Problem : KLE059+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp
% Command : z3_tptp -proof -model -t:%d -file:%s
% Computer : n019.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:03 EDT 2022
% Result : Theorem 0.19s 0.39s
% Output : Proof 0.19s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : KLE059+1 : TPTP v8.1.0. Released v4.0.0.
% 0.03/0.13 % Command : z3_tptp -proof -model -t:%d -file:%s
% 0.13/0.34 % Computer : n019.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Thu Sep 1 08:13:20 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.13/0.34 Z3tptp [4.8.9.0] (c) 2006-20**. Microsoft Corp.
% 0.13/0.34 Usage: tptp [options] [-file:]file
% 0.13/0.34 -h, -? prints this message.
% 0.13/0.34 -smt2 print SMT-LIB2 benchmark.
% 0.13/0.34 -m, -model generate model.
% 0.13/0.34 -p, -proof generate proof.
% 0.13/0.34 -c, -core generate unsat core of named formulas.
% 0.13/0.34 -st, -statistics display statistics.
% 0.13/0.34 -t:timeout set timeout (in second).
% 0.13/0.34 -smt2status display status in smt2 format instead of SZS.
% 0.13/0.34 -check_status check the status produced by Z3 against annotation in benchmark.
% 0.13/0.34 -<param>:<value> configuration parameter and value.
% 0.13/0.34 -o:<output-file> file to place output in.
% 0.19/0.39 % SZS status Theorem
% 0.19/0.39 % SZS output start Proof
% 0.19/0.39 tff(domain_type, type, (
% 0.19/0.39 domain: $i > $i)).
% 0.19/0.39 tff(tptp_fun_X1_0_type, type, (
% 0.19/0.39 tptp_fun_X1_0: $i)).
% 0.19/0.39 tff(addition_type, type, (
% 0.19/0.39 addition: ( $i * $i ) > $i)).
% 0.19/0.39 tff(tptp_fun_X0_1_type, type, (
% 0.19/0.39 tptp_fun_X0_1: $i)).
% 0.19/0.39 tff(1,plain,
% 0.19/0.39 ((~![X0: $i, X1: $i] : ((~(addition(X0, X1) = X1)) | (addition(domain(X0), domain(X1)) = domain(X1)))) <=> (~![X0: $i, X1: $i] : ((~(addition(X0, X1) = X1)) | (addition(domain(X0), domain(X1)) = domain(X1))))),
% 0.19/0.39 inference(rewrite,[status(thm)],[])).
% 0.19/0.39 tff(2,plain,
% 0.19/0.39 ((~![X0: $i, X1: $i] : ((addition(X0, X1) = X1) => (addition(domain(X0), domain(X1)) = domain(X1)))) <=> (~![X0: $i, X1: $i] : ((~(addition(X0, X1) = X1)) | (addition(domain(X0), domain(X1)) = domain(X1))))),
% 0.19/0.39 inference(rewrite,[status(thm)],[])).
% 0.19/0.39 tff(3,axiom,(~![X0: $i, X1: $i] : ((addition(X0, X1) = X1) => (addition(domain(X0), domain(X1)) = domain(X1)))), file('/export/starexec/sandbox/benchmark/theBenchmark.p','goals')).
% 0.19/0.39 tff(4,plain,
% 0.19/0.39 (~![X0: $i, X1: $i] : ((~(addition(X0, X1) = X1)) | (addition(domain(X0), domain(X1)) = domain(X1)))),
% 0.19/0.39 inference(modus_ponens,[status(thm)],[3, 2])).
% 0.19/0.39 tff(5,plain,
% 0.19/0.39 (~![X0: $i, X1: $i] : ((~(addition(X0, X1) = X1)) | (addition(domain(X0), domain(X1)) = domain(X1)))),
% 0.19/0.39 inference(modus_ponens,[status(thm)],[4, 1])).
% 0.19/0.39 tff(6,plain,
% 0.19/0.39 (~![X0: $i, X1: $i] : ((~(addition(X0, X1) = X1)) | (addition(domain(X0), domain(X1)) = domain(X1)))),
% 0.19/0.39 inference(modus_ponens,[status(thm)],[5, 1])).
% 0.19/0.39 tff(7,plain,
% 0.19/0.39 (~![X0: $i, X1: $i] : ((~(addition(X0, X1) = X1)) | (addition(domain(X0), domain(X1)) = domain(X1)))),
% 0.19/0.39 inference(modus_ponens,[status(thm)],[6, 1])).
% 0.19/0.39 tff(8,plain,
% 0.19/0.39 (~![X0: $i, X1: $i] : ((~(addition(X0, X1) = X1)) | (addition(domain(X0), domain(X1)) = domain(X1)))),
% 0.19/0.39 inference(modus_ponens,[status(thm)],[7, 1])).
% 0.19/0.39 tff(9,plain,
% 0.19/0.39 (~![X0: $i, X1: $i] : ((~(addition(X0, X1) = X1)) | (addition(domain(X0), domain(X1)) = domain(X1)))),
% 0.19/0.39 inference(modus_ponens,[status(thm)],[8, 1])).
% 0.19/0.39 tff(10,plain,
% 0.19/0.39 (~![X0: $i, X1: $i] : ((~(addition(X0, X1) = X1)) | (addition(domain(X0), domain(X1)) = domain(X1)))),
% 0.19/0.39 inference(modus_ponens,[status(thm)],[9, 1])).
% 0.19/0.39 tff(11,plain,(
% 0.19/0.39 ~((~(addition(X0!1, X1!0) = X1!0)) | (addition(domain(X0!1), domain(X1!0)) = domain(X1!0)))),
% 0.19/0.39 inference(skolemize,[status(sab)],[10])).
% 0.19/0.39 tff(12,plain,
% 0.19/0.39 (addition(X0!1, X1!0) = X1!0),
% 0.19/0.39 inference(or_elim,[status(thm)],[11])).
% 0.19/0.39 tff(13,plain,
% 0.19/0.39 (X1!0 = addition(X0!1, X1!0)),
% 0.19/0.39 inference(symmetry,[status(thm)],[12])).
% 0.19/0.39 tff(14,plain,
% 0.19/0.39 (domain(X1!0) = domain(addition(X0!1, X1!0))),
% 0.19/0.39 inference(monotonicity,[status(thm)],[13])).
% 0.19/0.39 tff(15,plain,
% 0.19/0.39 (domain(addition(X0!1, X1!0)) = domain(X1!0)),
% 0.19/0.39 inference(symmetry,[status(thm)],[14])).
% 0.19/0.39 tff(16,plain,
% 0.19/0.39 (^[X0: $i, X1: $i] : refl((domain(addition(X0, X1)) = addition(domain(X0), domain(X1))) <=> (domain(addition(X0, X1)) = addition(domain(X0), domain(X1))))),
% 0.19/0.39 inference(bind,[status(th)],[])).
% 0.19/0.39 tff(17,plain,
% 0.19/0.39 (![X0: $i, X1: $i] : (domain(addition(X0, X1)) = addition(domain(X0), domain(X1))) <=> ![X0: $i, X1: $i] : (domain(addition(X0, X1)) = addition(domain(X0), domain(X1)))),
% 0.19/0.39 inference(quant_intro,[status(thm)],[16])).
% 0.19/0.39 tff(18,plain,
% 0.19/0.39 (![X0: $i, X1: $i] : (domain(addition(X0, X1)) = addition(domain(X0), domain(X1))) <=> ![X0: $i, X1: $i] : (domain(addition(X0, X1)) = addition(domain(X0), domain(X1)))),
% 0.19/0.39 inference(rewrite,[status(thm)],[])).
% 0.19/0.39 tff(19,axiom,(![X0: $i, X1: $i] : (domain(addition(X0, X1)) = addition(domain(X0), domain(X1)))), file('/export/starexec/sandbox/benchmark/Axioms/KLE001+5.ax','domain5')).
% 0.19/0.39 tff(20,plain,
% 0.19/0.39 (![X0: $i, X1: $i] : (domain(addition(X0, X1)) = addition(domain(X0), domain(X1)))),
% 0.19/0.39 inference(modus_ponens,[status(thm)],[19, 18])).
% 0.19/0.39 tff(21,plain,(
% 0.19/0.39 ![X0: $i, X1: $i] : (domain(addition(X0, X1)) = addition(domain(X0), domain(X1)))),
% 0.19/0.39 inference(skolemize,[status(sab)],[20])).
% 0.19/0.39 tff(22,plain,
% 0.19/0.39 (![X0: $i, X1: $i] : (domain(addition(X0, X1)) = addition(domain(X0), domain(X1)))),
% 0.19/0.39 inference(modus_ponens,[status(thm)],[21, 17])).
% 0.19/0.39 tff(23,plain,
% 0.19/0.39 ((~![X0: $i, X1: $i] : (domain(addition(X0, X1)) = addition(domain(X0), domain(X1)))) | (domain(addition(X0!1, X1!0)) = addition(domain(X0!1), domain(X1!0)))),
% 0.19/0.39 inference(quant_inst,[status(thm)],[])).
% 0.19/0.39 tff(24,plain,
% 0.19/0.39 (domain(addition(X0!1, X1!0)) = addition(domain(X0!1), domain(X1!0))),
% 0.19/0.39 inference(unit_resolution,[status(thm)],[23, 22])).
% 0.19/0.39 tff(25,plain,
% 0.19/0.39 (addition(domain(X0!1), domain(X1!0)) = domain(addition(X0!1, X1!0))),
% 0.19/0.39 inference(symmetry,[status(thm)],[24])).
% 0.19/0.39 tff(26,plain,
% 0.19/0.39 (addition(domain(X0!1), domain(X1!0)) = domain(X1!0)),
% 0.19/0.39 inference(transitivity,[status(thm)],[25, 15])).
% 0.19/0.39 tff(27,plain,
% 0.19/0.39 (~(addition(domain(X0!1), domain(X1!0)) = domain(X1!0))),
% 0.19/0.39 inference(or_elim,[status(thm)],[11])).
% 0.19/0.39 tff(28,plain,
% 0.19/0.39 ($false),
% 0.19/0.39 inference(unit_resolution,[status(thm)],[27, 26])).
% 0.19/0.39 % SZS output end Proof
%------------------------------------------------------------------------------