TSTP Solution File: NUM620+3 by Twee---2.4.2
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Twee---2.4.2
% Problem : NUM620+3 : TPTP v8.1.2. Released v4.0.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 : n017.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:57:19 EDT 2023
% Result : Theorem 9.32s 1.61s
% Output : Proof 9.32s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : NUM620+3 : TPTP v8.1.2. Released v4.0.0.
% 0.08/0.14 % Command : parallel-twee %s --tstp --conditional-encoding if --smaller --drop-non-horn --give-up-on-saturation --explain-encoding --formal-proof
% 0.14/0.35 % Computer : n017.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Fri Aug 25 15:32:40 EDT 2023
% 0.14/0.36 % CPUTime :
% 9.32/1.61 Command-line arguments: --flip-ordering --lhs-weight 1 --depth-weight 60 --distributivity-heuristic
% 9.32/1.61
% 9.32/1.61 % SZS status Theorem
% 9.32/1.61
% 9.32/1.61 % SZS output start Proof
% 9.32/1.61 Take the following subset of the input axioms:
% 9.32/1.61 fof(m__, conjecture, (![W0]: (aElementOf0(W0, sdtlpdtrp0(xN, xm)) => aElementOf0(W0, sdtlpdtrp0(xN, szszuzczcdt0(xn)))) & aSubsetOf0(sdtlpdtrp0(xN, xm), sdtlpdtrp0(xN, szszuzczcdt0(xn)))) => aElementOf0(xx, sdtlpdtrp0(xN, szszuzczcdt0(xn)))).
% 9.32/1.61 fof(m__4660, hypothesis, aFunction0(xe) & (szDzozmdt0(xe)=szNzAzT0 & ![W0_2]: (aElementOf0(W0_2, szNzAzT0) => (aElementOf0(sdtlpdtrp0(xe, W0_2), sdtlpdtrp0(xN, W0_2)) & (![W1]: (aElementOf0(W1, sdtlpdtrp0(xN, W0_2)) => sdtlseqdt0(sdtlpdtrp0(xe, W0_2), W1)) & sdtlpdtrp0(xe, W0_2)=szmzizndt0(sdtlpdtrp0(xN, W0_2))))))).
% 9.32/1.61 fof(m__5389, hypothesis, aElementOf0(xm, szNzAzT0) & xx=sdtlpdtrp0(xe, xm)).
% 9.32/1.61
% 9.32/1.61 Now clausify the problem and encode Horn clauses using encoding 3 of
% 9.32/1.61 http://www.cse.chalmers.se/~nicsma/papers/horn.pdf.
% 9.32/1.62 We repeatedly replace C & s=t => u=v by the two clauses:
% 9.32/1.62 fresh(y, y, x1...xn) = u
% 9.32/1.62 C => fresh(s, t, x1...xn) = v
% 9.32/1.62 where fresh is a fresh function symbol and x1..xn are the free
% 9.32/1.62 variables of u and v.
% 9.32/1.62 A predicate p(X) is encoded as p(X)=true (this is sound, because the
% 9.32/1.62 input problem has no model of domain size 1).
% 9.32/1.62
% 9.32/1.62 The encoding turns the above axioms into the following unit equations and goals:
% 9.32/1.62
% 9.32/1.62 Axiom 1 (m__5389_1): aElementOf0(xm, szNzAzT0) = true2.
% 9.32/1.62 Axiom 2 (m__5389): xx = sdtlpdtrp0(xe, xm).
% 9.32/1.62 Axiom 3 (m__4660_3): fresh56(X, X, Y) = true2.
% 9.32/1.62 Axiom 4 (m___1): fresh16(X, X, Y) = true2.
% 9.32/1.62 Axiom 5 (m__4660_3): fresh56(aElementOf0(X, szNzAzT0), true2, X) = aElementOf0(sdtlpdtrp0(xe, X), sdtlpdtrp0(xN, X)).
% 9.32/1.62 Axiom 6 (m___1): fresh16(aElementOf0(X, sdtlpdtrp0(xN, xm)), true2, X) = aElementOf0(X, sdtlpdtrp0(xN, szszuzczcdt0(xn))).
% 9.32/1.62
% 9.32/1.62 Goal 1 (m___2): aElementOf0(xx, sdtlpdtrp0(xN, szszuzczcdt0(xn))) = true2.
% 9.32/1.62 Proof:
% 9.32/1.62 aElementOf0(xx, sdtlpdtrp0(xN, szszuzczcdt0(xn)))
% 9.32/1.62 = { by axiom 2 (m__5389) }
% 9.32/1.62 aElementOf0(sdtlpdtrp0(xe, xm), sdtlpdtrp0(xN, szszuzczcdt0(xn)))
% 9.32/1.62 = { by axiom 6 (m___1) R->L }
% 9.32/1.62 fresh16(aElementOf0(sdtlpdtrp0(xe, xm), sdtlpdtrp0(xN, xm)), true2, sdtlpdtrp0(xe, xm))
% 9.32/1.62 = { by axiom 5 (m__4660_3) R->L }
% 9.32/1.62 fresh16(fresh56(aElementOf0(xm, szNzAzT0), true2, xm), true2, sdtlpdtrp0(xe, xm))
% 9.32/1.62 = { by axiom 1 (m__5389_1) }
% 9.32/1.62 fresh16(fresh56(true2, true2, xm), true2, sdtlpdtrp0(xe, xm))
% 9.32/1.62 = { by axiom 3 (m__4660_3) }
% 9.32/1.62 fresh16(true2, true2, sdtlpdtrp0(xe, xm))
% 9.32/1.62 = { by axiom 4 (m___1) }
% 9.32/1.62 true2
% 9.32/1.62 % SZS output end Proof
% 9.32/1.62
% 9.32/1.62 RESULT: Theorem (the conjecture is true).
%------------------------------------------------------------------------------