TSTP Solution File: ROB021-1 by Z3---4.8.9.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Z3---4.8.9.0
% Problem  : ROB021-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm  : none
% Format   : tptp
% Command  : z3_tptp -proof -model -t:%d -file:%s

% Computer : n004.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 : Tue Sep 20 03:22:07 EDT 2022

% Result   : Unsatisfiable 0.13s 0.38s
% Output   : Proof 0.13s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem  : ROB021-1 : TPTP v8.1.0. Released v1.0.0.
% 0.11/0.13  % Command  : z3_tptp -proof -model -t:%d -file:%s
% 0.13/0.34  % Computer : n004.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 : Fri Sep  2 22:59:34 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.13/0.35  Z3tptp [4.8.9.0] (c) 2006-20**. Microsoft Corp.
% 0.13/0.35  Usage: tptp [options] [-file:]file
% 0.13/0.35    -h, -?       prints this message.
% 0.13/0.35    -smt2        print SMT-LIB2 benchmark.
% 0.13/0.35    -m, -model   generate model.
% 0.13/0.35    -p, -proof   generate proof.
% 0.13/0.35    -c, -core    generate unsat core of named formulas.
% 0.13/0.35    -st, -statistics display statistics.
% 0.13/0.35    -t:timeout   set timeout (in second).
% 0.13/0.35    -smt2status  display status in smt2 format instead of SZS.
% 0.13/0.35    -check_status check the status produced by Z3 against annotation in benchmark.
% 0.13/0.35    -<param>:<value> configuration parameter and value.
% 0.13/0.35    -o:<output-file> file to place output in.
% 0.13/0.38  % SZS status Unsatisfiable
% 0.13/0.38  % SZS output start Proof
% 0.13/0.38  tff(b_type, type, (
% 0.13/0.38     b: $i)).
% 0.13/0.38  tff(add_type, type, (
% 0.13/0.38     add: ( $i * $i ) > $i)).
% 0.13/0.38  tff(negate_type, type, (
% 0.13/0.38     negate: $i > $i)).
% 0.13/0.38  tff(a_type, type, (
% 0.13/0.38     a: $i)).
% 0.13/0.38  tff(inj_0_type, type, (
% 0.13/0.38     inj_0: $i > $i)).
% 0.13/0.38  tff(1,plain,
% 0.13/0.38      (![Xk!0: $i] : (inj_0(negate(Xk!0)) = Xk!0) <=> ![Xk!0: $i] : (inj_0(negate(Xk!0)) = Xk!0)),
% 0.13/0.38      inference(rewrite,[status(thm)],[])).
% 0.13/0.38  tff(2,plain,
% 0.13/0.38      (![Y: $i, X: $i] : ((~(negate(X) = negate(Y))) | (X = Y)) <=> ![Xk!0: $i] : (inj_0(negate(Xk!0)) = Xk!0)),
% 0.13/0.38      inference(rewrite,[status(thm)],[])).
% 0.13/0.38  tff(3,plain,
% 0.13/0.38      (![Y: $i, X: $i] : ((~(negate(X) = negate(Y))) | (X = Y)) <=> ![Y: $i, X: $i] : ((~(negate(X) = negate(Y))) | (X = Y))),
% 0.13/0.38      inference(rewrite,[status(thm)],[])).
% 0.13/0.38  tff(4,axiom,(![Y: $i, X: $i] : ((~(negate(X) = negate(Y))) | (X = Y))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p','negative_equality_implies_positive_equality')).
% 0.13/0.38  tff(5,plain,
% 0.13/0.38      (![Y: $i, X: $i] : ((~(negate(X) = negate(Y))) | (X = Y))),
% 0.13/0.38      inference(modus_ponens,[status(thm)],[4, 3])).
% 0.13/0.38  tff(6,plain,(
% 0.13/0.38      ![Y: $i, X: $i] : ((~(negate(X) = negate(Y))) | (X = Y))),
% 0.13/0.38      inference(skolemize,[status(sab)],[5])).
% 0.13/0.38  tff(7,plain,
% 0.13/0.38      (![Xk!0: $i] : (inj_0(negate(Xk!0)) = Xk!0)),
% 0.13/0.38      inference(modus_ponens,[status(thm)],[6, 2])).
% 0.13/0.38  tff(8,plain,
% 0.13/0.38      (![Xk!0: $i] : (inj_0(negate(Xk!0)) = Xk!0)),
% 0.13/0.38      inference(modus_ponens,[status(thm)],[7, 1])).
% 0.13/0.38  tff(9,plain,
% 0.13/0.38      ((~![Xk!0: $i] : (inj_0(negate(Xk!0)) = Xk!0)) | (inj_0(negate(b)) = b)),
% 0.13/0.38      inference(quant_inst,[status(thm)],[])).
% 0.13/0.38  tff(10,plain,
% 0.13/0.38      (inj_0(negate(b)) = b),
% 0.13/0.38      inference(unit_resolution,[status(thm)],[9, 8])).
% 0.13/0.38  tff(11,plain,
% 0.13/0.38      (^[Y: $i, X: $i] : refl((add(X, Y) = add(Y, X)) <=> (add(X, Y) = add(Y, X)))),
% 0.13/0.38      inference(bind,[status(th)],[])).
% 0.13/0.38  tff(12,plain,
% 0.13/0.38      (![Y: $i, X: $i] : (add(X, Y) = add(Y, X)) <=> ![Y: $i, X: $i] : (add(X, Y) = add(Y, X))),
% 0.13/0.38      inference(quant_intro,[status(thm)],[11])).
% 0.13/0.38  tff(13,plain,
% 0.13/0.38      (![Y: $i, X: $i] : (add(X, Y) = add(Y, X)) <=> ![Y: $i, X: $i] : (add(X, Y) = add(Y, X))),
% 0.13/0.38      inference(rewrite,[status(thm)],[])).
% 0.13/0.38  tff(14,axiom,(![Y: $i, X: $i] : (add(X, Y) = add(Y, X))), file('/export/starexec/sandbox2/benchmark/Axioms/ROB001-0.ax','commutativity_of_add')).
% 0.13/0.38  tff(15,plain,
% 0.13/0.38      (![Y: $i, X: $i] : (add(X, Y) = add(Y, X))),
% 0.13/0.38      inference(modus_ponens,[status(thm)],[14, 13])).
% 0.13/0.38  tff(16,plain,(
% 0.13/0.38      ![Y: $i, X: $i] : (add(X, Y) = add(Y, X))),
% 0.13/0.38      inference(skolemize,[status(sab)],[15])).
% 0.13/0.38  tff(17,plain,
% 0.13/0.38      (![Y: $i, X: $i] : (add(X, Y) = add(Y, X))),
% 0.13/0.38      inference(modus_ponens,[status(thm)],[16, 12])).
% 0.13/0.38  tff(18,plain,
% 0.13/0.38      ((~![Y: $i, X: $i] : (add(X, Y) = add(Y, X))) | (add(negate(a), negate(b)) = add(negate(b), negate(a)))),
% 0.13/0.38      inference(quant_inst,[status(thm)],[])).
% 0.13/0.38  tff(19,plain,
% 0.13/0.38      (add(negate(a), negate(b)) = add(negate(b), negate(a))),
% 0.13/0.38      inference(unit_resolution,[status(thm)],[18, 17])).
% 0.13/0.38  tff(20,plain,
% 0.13/0.38      (add(negate(b), negate(a)) = add(negate(a), negate(b))),
% 0.13/0.38      inference(symmetry,[status(thm)],[19])).
% 0.13/0.38  tff(21,plain,
% 0.13/0.38      (negate(add(negate(b), negate(a))) = negate(add(negate(a), negate(b)))),
% 0.13/0.38      inference(monotonicity,[status(thm)],[20])).
% 0.13/0.38  tff(22,plain,
% 0.13/0.38      ((~![Y: $i, X: $i] : (add(X, Y) = add(Y, X))) | (add(a, negate(b)) = add(negate(b), a))),
% 0.13/0.38      inference(quant_inst,[status(thm)],[])).
% 0.13/0.38  tff(23,plain,
% 0.13/0.38      (add(a, negate(b)) = add(negate(b), a)),
% 0.13/0.38      inference(unit_resolution,[status(thm)],[22, 17])).
% 0.13/0.38  tff(24,plain,
% 0.13/0.38      (add(negate(b), a) = add(a, negate(b))),
% 0.13/0.38      inference(symmetry,[status(thm)],[23])).
% 0.13/0.38  tff(25,plain,
% 0.13/0.38      (negate(add(negate(b), a)) = negate(add(a, negate(b)))),
% 0.13/0.38      inference(monotonicity,[status(thm)],[24])).
% 0.13/0.38  tff(26,plain,
% 0.13/0.38      (add(negate(add(negate(b), a)), negate(add(negate(b), negate(a)))) = add(negate(add(a, negate(b))), negate(add(negate(a), negate(b))))),
% 0.13/0.38      inference(monotonicity,[status(thm)],[25, 21])).
% 0.13/0.38  tff(27,plain,
% 0.13/0.38      (add(negate(add(a, negate(b))), negate(add(negate(a), negate(b)))) = add(negate(add(negate(b), a)), negate(add(negate(b), negate(a))))),
% 0.13/0.38      inference(symmetry,[status(thm)],[26])).
% 0.13/0.38  tff(28,plain,
% 0.13/0.38      ((~![Y: $i, X: $i] : (add(X, Y) = add(Y, X))) | (add(negate(add(a, negate(b))), negate(add(negate(a), negate(b)))) = add(negate(add(negate(a), negate(b))), negate(add(a, negate(b)))))),
% 0.13/0.38      inference(quant_inst,[status(thm)],[])).
% 0.13/0.38  tff(29,plain,
% 0.13/0.38      (add(negate(add(a, negate(b))), negate(add(negate(a), negate(b)))) = add(negate(add(negate(a), negate(b))), negate(add(a, negate(b))))),
% 0.13/0.38      inference(unit_resolution,[status(thm)],[28, 17])).
% 0.13/0.38  tff(30,plain,
% 0.13/0.38      (add(negate(add(negate(a), negate(b))), negate(add(a, negate(b)))) = add(negate(add(a, negate(b))), negate(add(negate(a), negate(b))))),
% 0.13/0.38      inference(symmetry,[status(thm)],[29])).
% 0.13/0.38  tff(31,plain,
% 0.13/0.38      (add(negate(add(negate(a), negate(b))), negate(add(a, negate(b)))) = add(negate(add(negate(b), a)), negate(add(negate(b), negate(a))))),
% 0.13/0.38      inference(transitivity,[status(thm)],[30, 27])).
% 0.13/0.38  tff(32,plain,
% 0.13/0.38      (negate(add(negate(add(negate(a), negate(b))), negate(add(a, negate(b))))) = negate(add(negate(add(negate(b), a)), negate(add(negate(b), negate(a)))))),
% 0.13/0.38      inference(monotonicity,[status(thm)],[31])).
% 0.13/0.38  tff(33,plain,
% 0.13/0.38      (negate(add(negate(add(negate(b), a)), negate(add(negate(b), negate(a))))) = negate(add(negate(add(negate(a), negate(b))), negate(add(a, negate(b)))))),
% 0.13/0.38      inference(symmetry,[status(thm)],[32])).
% 0.13/0.38  tff(34,plain,
% 0.13/0.38      (^[Y: $i, X: $i] : refl((negate(add(negate(add(X, Y)), negate(add(X, negate(Y))))) = X) <=> (negate(add(negate(add(X, Y)), negate(add(X, negate(Y))))) = X))),
% 0.13/0.38      inference(bind,[status(th)],[])).
% 0.13/0.38  tff(35,plain,
% 0.13/0.38      (![Y: $i, X: $i] : (negate(add(negate(add(X, Y)), negate(add(X, negate(Y))))) = X) <=> ![Y: $i, X: $i] : (negate(add(negate(add(X, Y)), negate(add(X, negate(Y))))) = X)),
% 0.13/0.38      inference(quant_intro,[status(thm)],[34])).
% 0.13/0.38  tff(36,plain,
% 0.13/0.38      (![Y: $i, X: $i] : (negate(add(negate(add(X, Y)), negate(add(X, negate(Y))))) = X) <=> ![Y: $i, X: $i] : (negate(add(negate(add(X, Y)), negate(add(X, negate(Y))))) = X)),
% 0.13/0.38      inference(rewrite,[status(thm)],[])).
% 0.13/0.38  tff(37,axiom,(![Y: $i, X: $i] : (negate(add(negate(add(X, Y)), negate(add(X, negate(Y))))) = X)), file('/export/starexec/sandbox2/benchmark/Axioms/ROB001-0.ax','robbins_axiom')).
% 0.13/0.38  tff(38,plain,
% 0.13/0.38      (![Y: $i, X: $i] : (negate(add(negate(add(X, Y)), negate(add(X, negate(Y))))) = X)),
% 0.13/0.38      inference(modus_ponens,[status(thm)],[37, 36])).
% 0.13/0.38  tff(39,plain,(
% 0.13/0.38      ![Y: $i, X: $i] : (negate(add(negate(add(X, Y)), negate(add(X, negate(Y))))) = X)),
% 0.13/0.38      inference(skolemize,[status(sab)],[38])).
% 0.13/0.38  tff(40,plain,
% 0.13/0.38      (![Y: $i, X: $i] : (negate(add(negate(add(X, Y)), negate(add(X, negate(Y))))) = X)),
% 0.13/0.38      inference(modus_ponens,[status(thm)],[39, 35])).
% 0.13/0.38  tff(41,plain,
% 0.13/0.38      ((~![Y: $i, X: $i] : (negate(add(negate(add(X, Y)), negate(add(X, negate(Y))))) = X)) | (negate(add(negate(add(negate(b), a)), negate(add(negate(b), negate(a))))) = negate(b))),
% 0.13/0.38      inference(quant_inst,[status(thm)],[])).
% 0.13/0.38  tff(42,plain,
% 0.13/0.38      (negate(add(negate(add(negate(b), a)), negate(add(negate(b), negate(a))))) = negate(b)),
% 0.13/0.38      inference(unit_resolution,[status(thm)],[41, 40])).
% 0.13/0.38  tff(43,plain,
% 0.13/0.38      (negate(b) = negate(add(negate(add(negate(b), a)), negate(add(negate(b), negate(a)))))),
% 0.13/0.38      inference(symmetry,[status(thm)],[42])).
% 0.13/0.38  tff(44,plain,
% 0.13/0.38      (negate(b) = negate(add(negate(add(negate(a), negate(b))), negate(add(a, negate(b)))))),
% 0.13/0.38      inference(transitivity,[status(thm)],[43, 33])).
% 0.13/0.38  tff(45,plain,
% 0.13/0.38      (inj_0(negate(b)) = inj_0(negate(add(negate(add(negate(a), negate(b))), negate(add(a, negate(b))))))),
% 0.13/0.38      inference(monotonicity,[status(thm)],[44])).
% 0.13/0.38  tff(46,plain,
% 0.13/0.38      (inj_0(negate(add(negate(add(negate(a), negate(b))), negate(add(a, negate(b)))))) = inj_0(negate(b))),
% 0.13/0.38      inference(symmetry,[status(thm)],[45])).
% 0.13/0.38  tff(47,plain,
% 0.13/0.38      ((~![Xk!0: $i] : (inj_0(negate(Xk!0)) = Xk!0)) | (inj_0(negate(add(negate(add(negate(a), negate(b))), negate(add(a, negate(b)))))) = add(negate(add(negate(a), negate(b))), negate(add(a, negate(b)))))),
% 0.13/0.38      inference(quant_inst,[status(thm)],[])).
% 0.13/0.38  tff(48,plain,
% 0.13/0.38      (inj_0(negate(add(negate(add(negate(a), negate(b))), negate(add(a, negate(b)))))) = add(negate(add(negate(a), negate(b))), negate(add(a, negate(b))))),
% 0.13/0.38      inference(unit_resolution,[status(thm)],[47, 8])).
% 0.13/0.39  tff(49,plain,
% 0.13/0.39      (add(negate(add(negate(a), negate(b))), negate(add(a, negate(b)))) = inj_0(negate(add(negate(add(negate(a), negate(b))), negate(add(a, negate(b))))))),
% 0.13/0.39      inference(symmetry,[status(thm)],[48])).
% 0.13/0.39  tff(50,plain,
% 0.13/0.39      (add(negate(add(a, negate(b))), negate(add(negate(a), negate(b)))) = b),
% 0.13/0.39      inference(transitivity,[status(thm)],[29, 49, 46, 10])).
% 0.13/0.39  tff(51,plain,
% 0.13/0.39      ((~(add(negate(add(a, negate(b))), negate(add(negate(a), negate(b)))) = b)) <=> (~(add(negate(add(a, negate(b))), negate(add(negate(a), negate(b)))) = b))),
% 0.13/0.39      inference(rewrite,[status(thm)],[])).
% 0.13/0.39  tff(52,axiom,(~(add(negate(add(a, negate(b))), negate(add(negate(a), negate(b)))) = b)), file('/export/starexec/sandbox2/benchmark/theBenchmark.p','prove_huntingtons_axiom')).
% 0.13/0.39  tff(53,plain,
% 0.13/0.39      (~(add(negate(add(a, negate(b))), negate(add(negate(a), negate(b)))) = b)),
% 0.13/0.39      inference(modus_ponens,[status(thm)],[52, 51])).
% 0.13/0.39  tff(54,plain,
% 0.13/0.39      ($false),
% 0.13/0.39      inference(unit_resolution,[status(thm)],[53, 50])).
% 0.13/0.39  % SZS output end Proof
%------------------------------------------------------------------------------