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