%------------------------------------------------------------------------------
% File     : Twee---2.4.2
% Problem  : SWC349+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 : n025.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:55:06 EDT 2023

% Result   : Theorem 0.19s 0.82s
% Output   : Proof 0.19s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : SWC349+1 : TPTP v8.1.2. Released v2.4.0.
% 0.00/0.12  % 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 : n025.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 : Mon Aug 28 18:58:39 EDT 2023
% 0.12/0.34  % CPUTime  : 
% 0.19/0.82  Command-line arguments: --lhs-weight 9 --flip-ordering --complete-subsets --normalise-queue-percent 10 --cp-renormalise-threshold 10
% 0.19/0.82  
% 0.19/0.82  % SZS status Theorem
% 0.19/0.82  
% 0.19/0.82  % SZS output start Proof
% 0.19/0.82  Take the following subset of the input axioms:
% 0.19/0.82    fof(ax45, axiom, ![U]: (ssList(U) => frontsegP(U, nil))).
% 0.19/0.82    fof(co1, conjecture, ![U2]: (ssList(U2) => ![V]: (ssList(V) => ![W]: (ssList(W) => ![X]: (ssList(X) => (nil!=W | (V!=X | (U2!=W | (~neq(V, nil) | frontsegP(V, U2)))))))))).
% 0.19/0.82  
% 0.19/0.82  Now clausify the problem and encode Horn clauses using encoding 3 of
% 0.19/0.82  http://www.cse.chalmers.se/~nicsma/papers/horn.pdf.
% 0.19/0.82  We repeatedly replace C & s=t => u=v by the two clauses:
% 0.19/0.82    fresh(y, y, x1...xn) = u
% 0.19/0.82    C => fresh(s, t, x1...xn) = v
% 0.19/0.82  where fresh is a fresh function symbol and x1..xn are the free
% 0.19/0.82  variables of u and v.
% 0.19/0.82  A predicate p(X) is encoded as p(X)=true (this is sound, because the
% 0.19/0.82  input problem has no model of domain size 1).
% 0.19/0.82  
% 0.19/0.82  The encoding turns the above axioms into the following unit equations and goals:
% 0.19/0.82  
% 0.19/0.82  Axiom 1 (co1): nil = w.
% 0.19/0.82  Axiom 2 (co1_1): u = w.
% 0.19/0.82  Axiom 3 (co1_5): ssList(v) = true2.
% 0.19/0.82  Axiom 4 (ax45): fresh57(X, X, Y) = true2.
% 0.19/0.83  Axiom 5 (ax45): fresh57(ssList(X), true2, X) = frontsegP(X, nil).
% 0.19/0.83  
% 0.19/0.83  Goal 1 (co1_8): frontsegP(v, u) = true2.
% 0.19/0.83  Proof:
% 0.19/0.83    frontsegP(v, u)
% 0.19/0.83  = { by axiom 2 (co1_1) }
% 0.19/0.83    frontsegP(v, w)
% 0.19/0.83  = { by axiom 1 (co1) R->L }
% 0.19/0.83    frontsegP(v, nil)
% 0.19/0.83  = { by axiom 5 (ax45) R->L }
% 0.19/0.83    fresh57(ssList(v), true2, v)
% 0.19/0.83  = { by axiom 3 (co1_5) }
% 0.19/0.83    fresh57(true2, true2, v)
% 0.19/0.83  = { by axiom 4 (ax45) }
% 0.19/0.83    true2
% 0.19/0.83  % SZS output end Proof
% 0.19/0.83  
% 0.19/0.83  RESULT: Theorem (the conjecture is true).
%------------------------------------------------------------------------------