TSTP Solution File: SWC269+1 by Twee---2.4.2
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Twee---2.4.2
% Problem : SWC269+1 : TPTP v8.1.2. Released v2.4.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 : n014.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 20:54:43 EDT 2023
% Result : Theorem 3.22s 0.78s
% Output : Proof 3.22s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SWC269+1 : TPTP v8.1.2. Released v2.4.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.17/0.34 % Computer : n014.cluster.edu
% 0.17/0.34 % Model : x86_64 x86_64
% 0.17/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.34 % Memory : 8042.1875MB
% 0.17/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.17/0.34 % CPULimit : 300
% 0.17/0.34 % WCLimit : 300
% 0.17/0.34 % DateTime : Mon Aug 28 15:43:45 EDT 2023
% 0.17/0.34 % CPUTime :
% 3.22/0.78 Command-line arguments: --kbo-weight0 --lhs-weight 5 --flip-ordering --normalise-queue-percent 10 --cp-renormalise-threshold 10 --goal-heuristic
% 3.22/0.78
% 3.22/0.78 % SZS status Theorem
% 3.22/0.78
% 3.22/0.78 % SZS output start Proof
% 3.22/0.78 Take the following subset of the input axioms:
% 3.22/0.78 fof(co1, conjecture, ![U]: (ssList(U) => ![V]: (ssList(V) => ![W]: (ssList(W) => ![X]: (ssList(X) => (V!=X | (U!=W | (~frontsegP(X, W) | (~totalorderedP(W) | (?[Y]: (ssList(Y) & (neq(W, Y) & (frontsegP(X, Y) & (segmentP(Y, W) & totalorderedP(Y))))) | totalorderedP(U))))))))))).
% 3.22/0.78
% 3.22/0.78 Now clausify the problem and encode Horn clauses using encoding 3 of
% 3.22/0.78 http://www.cse.chalmers.se/~nicsma/papers/horn.pdf.
% 3.22/0.78 We repeatedly replace C & s=t => u=v by the two clauses:
% 3.22/0.78 fresh(y, y, x1...xn) = u
% 3.22/0.78 C => fresh(s, t, x1...xn) = v
% 3.22/0.78 where fresh is a fresh function symbol and x1..xn are the free
% 3.22/0.78 variables of u and v.
% 3.22/0.78 A predicate p(X) is encoded as p(X)=true (this is sound, because the
% 3.22/0.78 input problem has no model of domain size 1).
% 3.22/0.78
% 3.22/0.78 The encoding turns the above axioms into the following unit equations and goals:
% 3.22/0.78
% 3.22/0.78 Axiom 1 (co1): u = w.
% 3.22/0.78 Axiom 2 (co1_7): totalorderedP(w) = true2.
% 3.22/0.78
% 3.22/0.78 Goal 1 (co1_9): totalorderedP(u) = true2.
% 3.22/0.78 Proof:
% 3.22/0.78 totalorderedP(u)
% 3.22/0.78 = { by axiom 1 (co1) }
% 3.22/0.78 totalorderedP(w)
% 3.22/0.78 = { by axiom 2 (co1_7) }
% 3.22/0.78 true2
% 3.22/0.78 % SZS output end Proof
% 3.22/0.78
% 3.22/0.78 RESULT: Theorem (the conjecture is true).
%------------------------------------------------------------------------------