TSTP Solution File: NUM840+1 by Twee---2.4.2

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Twee---2.4.2
% Problem  : NUM840+1 : TPTP v8.1.2. Released v4.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : parallel-twee %s --tstp --conditional-encoding if --smaller --drop-non-horn --give-up-on-saturation --explain-encoding --formal-proof

% Computer : n018.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 : Thu Aug 31 11:58:33 EDT 2023

% Result   : Theorem 17.08s 2.58s
% Output   : Proof 17.08s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : NUM840+1 : TPTP v8.1.2. Released v4.1.0.
% 0.00/0.13  % Command  : parallel-twee %s --tstp --conditional-encoding if --smaller --drop-non-horn --give-up-on-saturation --explain-encoding --formal-proof
% 0.12/0.34  % Computer : n018.cluster.edu
% 0.12/0.34  % Model    : x86_64 x86_64
% 0.12/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34  % Memory   : 8042.1875MB
% 0.12/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34  % CPULimit : 300
% 0.12/0.34  % WCLimit  : 300
% 0.12/0.34  % DateTime : Fri Aug 25 14:22:29 EDT 2023
% 0.12/0.34  % CPUTime  : 
% 17.08/2.58  Command-line arguments: --no-flatten-goal
% 17.08/2.58  
% 17.08/2.58  % SZS status Theorem
% 17.08/2.58  
% 17.08/2.58  % SZS output start Proof
% 17.08/2.58  Take the following subset of the input axioms:
% 17.08/2.58    fof('ass(cond(140, 0), 0)', axiom, ![Vd208, Vd209]: (greater(Vd208, Vd209) => less(Vd209, Vd208))).
% 17.08/2.58    fof('ass(cond(189, 0), 0)', axiom, ![Vd295, Vd296]: greater(vplus(Vd295, Vd296), Vd295)).
% 17.08/2.58    fof('ass(cond(33, 0), 0)', axiom, ![Vd46, Vd47, Vd48]: vplus(vplus(Vd46, Vd47), Vd48)=vplus(Vd46, vplus(Vd47, Vd48))).
% 17.08/2.58    fof('ass(cond(61, 0), 0)', axiom, ![Vd78, Vd79]: vplus(Vd79, Vd78)=vplus(Vd78, Vd79)).
% 17.08/2.58    fof('ass(cond(81, 0), 0)', axiom, ![Vd104, Vd105]: (Vd104!=Vd105 => ![Vd107]: vplus(Vd107, Vd104)!=vplus(Vd107, Vd105))).
% 17.08/2.58    fof('def(cond(conseq(axiom(3)), 11), 1)', axiom, ![Vd193, Vd194]: (greater(Vd194, Vd193) <=> ?[Vd196]: Vd194=vplus(Vd193, Vd196))).
% 17.08/2.58    fof('def(cond(conseq(axiom(3)), 12), 1)', axiom, ![Vd198, Vd199]: (less(Vd199, Vd198) <=> ?[Vd201]: Vd198=vplus(Vd199, Vd201))).
% 17.08/2.58    fof('holds(antec(conjunct2(conjunct2(204))), 335, 0)', axiom, less(vplus(vd328, vd330), vplus(vd329, vd330))).
% 17.08/2.58    fof('holds(conseq(conjunct2(conjunct2(204))), 336, 0)', conjecture, less(vd328, vd329)).
% 17.08/2.58  
% 17.08/2.58  Now clausify the problem and encode Horn clauses using encoding 3 of
% 17.08/2.58  http://www.cse.chalmers.se/~nicsma/papers/horn.pdf.
% 17.08/2.58  We repeatedly replace C & s=t => u=v by the two clauses:
% 17.08/2.58    fresh(y, y, x1...xn) = u
% 17.08/2.58    C => fresh(s, t, x1...xn) = v
% 17.08/2.58  where fresh is a fresh function symbol and x1..xn are the free
% 17.08/2.58  variables of u and v.
% 17.08/2.58  A predicate p(X) is encoded as p(X)=true (this is sound, because the
% 17.08/2.58  input problem has no model of domain size 1).
% 17.08/2.58  
% 17.08/2.58  The encoding turns the above axioms into the following unit equations and goals:
% 17.08/2.58  
% 17.08/2.58  Axiom 1 (ass(cond(61, 0), 0)): vplus(X, Y) = vplus(Y, X).
% 17.08/2.58  Axiom 2 (ass(cond(140, 0), 0)): fresh24(X, X, Y, Z) = true2.
% 17.08/2.58  Axiom 3 (def(cond(conseq(axiom(3)), 12), 1)_1): fresh5(X, X, Y, Z) = Y.
% 17.08/2.58  Axiom 4 (def(cond(conseq(axiom(3)), 11), 1)_1): fresh4(X, X, Y, Z) = Z.
% 17.08/2.58  Axiom 5 (ass(cond(81, 0), 0)): fresh2(X, X, Y, Z) = Z.
% 17.08/2.58  Axiom 6 (ass(cond(189, 0), 0)): greater(vplus(X, Y), X) = true2.
% 17.08/2.58  Axiom 7 (ass(cond(33, 0), 0)): vplus(vplus(X, Y), Z) = vplus(X, vplus(Y, Z)).
% 17.08/2.58  Axiom 8 (ass(cond(140, 0), 0)): fresh24(greater(X, Y), true2, X, Y) = less(Y, X).
% 17.08/2.58  Axiom 9 (def(cond(conseq(axiom(3)), 12), 1)_1): fresh5(less(X, Y), true2, Y, X) = vplus(X, vd201(Y, X)).
% 17.08/2.58  Axiom 10 (def(cond(conseq(axiom(3)), 11), 1)_1): fresh4(greater(X, Y), true2, Y, X) = vplus(Y, vd196(Y, X)).
% 17.08/2.58  Axiom 11 (holds(antec(conjunct2(conjunct2(204))), 335, 0)): less(vplus(vd328, vd330), vplus(vd329, vd330)) = true2.
% 17.08/2.58  Axiom 12 (ass(cond(81, 0), 0)): fresh2(vplus(X, Y), vplus(X, Z), Y, Z) = Y.
% 17.08/2.58  
% 17.08/2.58  Lemma 13: vd196(X, vplus(X, Y)) = Y.
% 17.08/2.58  Proof:
% 17.08/2.58    vd196(X, vplus(X, Y))
% 17.08/2.58  = { by axiom 5 (ass(cond(81, 0), 0)) R->L }
% 17.08/2.58    fresh2(vplus(X, Y), vplus(X, Y), Y, vd196(X, vplus(X, Y)))
% 17.08/2.58  = { by axiom 4 (def(cond(conseq(axiom(3)), 11), 1)_1) R->L }
% 17.08/2.58    fresh2(vplus(X, Y), fresh4(true2, true2, X, vplus(X, Y)), Y, vd196(X, vplus(X, Y)))
% 17.08/2.58  = { by axiom 6 (ass(cond(189, 0), 0)) R->L }
% 17.08/2.58    fresh2(vplus(X, Y), fresh4(greater(vplus(X, Y), X), true2, X, vplus(X, Y)), Y, vd196(X, vplus(X, Y)))
% 17.08/2.58  = { by axiom 10 (def(cond(conseq(axiom(3)), 11), 1)_1) }
% 17.08/2.58    fresh2(vplus(X, Y), vplus(X, vd196(X, vplus(X, Y))), Y, vd196(X, vplus(X, Y)))
% 17.08/2.58  = { by axiom 12 (ass(cond(81, 0), 0)) }
% 17.08/2.58    Y
% 17.08/2.58  
% 17.08/2.58  Goal 1 (holds(conseq(conjunct2(conjunct2(204))), 336, 0)): less(vd328, vd329) = true2.
% 17.08/2.58  Proof:
% 17.08/2.58    less(vd328, vd329)
% 17.08/2.58  = { by axiom 8 (ass(cond(140, 0), 0)) R->L }
% 17.08/2.58    fresh24(greater(vd329, vd328), true2, vd329, vd328)
% 17.08/2.58  = { by lemma 13 R->L }
% 17.08/2.58    fresh24(greater(vd196(vd330, vplus(vd330, vd329)), vd328), true2, vd329, vd328)
% 17.08/2.58  = { by axiom 1 (ass(cond(61, 0), 0)) }
% 17.08/2.58    fresh24(greater(vd196(vd330, vplus(vd329, vd330)), vd328), true2, vd329, vd328)
% 17.08/2.58  = { by axiom 3 (def(cond(conseq(axiom(3)), 12), 1)_1) R->L }
% 17.08/2.58    fresh24(greater(vd196(vd330, fresh5(true2, true2, vplus(vd329, vd330), vplus(vd328, vd330))), vd328), true2, vd329, vd328)
% 17.08/2.58  = { by axiom 11 (holds(antec(conjunct2(conjunct2(204))), 335, 0)) R->L }
% 17.08/2.58    fresh24(greater(vd196(vd330, fresh5(less(vplus(vd328, vd330), vplus(vd329, vd330)), true2, vplus(vd329, vd330), vplus(vd328, vd330))), vd328), true2, vd329, vd328)
% 17.08/2.58  = { by axiom 9 (def(cond(conseq(axiom(3)), 12), 1)_1) }
% 17.08/2.58    fresh24(greater(vd196(vd330, vplus(vplus(vd328, vd330), vd201(vplus(vd329, vd330), vplus(vd328, vd330)))), vd328), true2, vd329, vd328)
% 17.08/2.58  = { by axiom 7 (ass(cond(33, 0), 0)) }
% 17.08/2.58    fresh24(greater(vd196(vd330, vplus(vd328, vplus(vd330, vd201(vplus(vd329, vd330), vplus(vd328, vd330))))), vd328), true2, vd329, vd328)
% 17.08/2.58  = { by axiom 1 (ass(cond(61, 0), 0)) R->L }
% 17.08/2.58    fresh24(greater(vd196(vd330, vplus(vplus(vd330, vd201(vplus(vd329, vd330), vplus(vd328, vd330))), vd328)), vd328), true2, vd329, vd328)
% 17.08/2.58  = { by axiom 7 (ass(cond(33, 0), 0)) }
% 17.08/2.58    fresh24(greater(vd196(vd330, vplus(vd330, vplus(vd201(vplus(vd329, vd330), vplus(vd328, vd330)), vd328))), vd328), true2, vd329, vd328)
% 17.08/2.58  = { by axiom 1 (ass(cond(61, 0), 0)) }
% 17.08/2.58    fresh24(greater(vd196(vd330, vplus(vd330, vplus(vd328, vd201(vplus(vd329, vd330), vplus(vd328, vd330))))), vd328), true2, vd329, vd328)
% 17.08/2.58  = { by lemma 13 }
% 17.08/2.58    fresh24(greater(vplus(vd328, vd201(vplus(vd329, vd330), vplus(vd328, vd330))), vd328), true2, vd329, vd328)
% 17.08/2.58  = { by axiom 6 (ass(cond(189, 0), 0)) }
% 17.08/2.58    fresh24(true2, true2, vd329, vd328)
% 17.08/2.58  = { by axiom 2 (ass(cond(140, 0), 0)) }
% 17.08/2.58    true2
% 17.08/2.58  % SZS output end Proof
% 17.08/2.58  
% 17.08/2.58  RESULT: Theorem (the conjecture is true).
%------------------------------------------------------------------------------