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