%------------------------------------------------------------------------------
% File     : Twee---2.4.2
% Problem  : SWV365+1 : TPTP v8.1.2. Released v3.3.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 : n028.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 23:03:58 EDT 2023

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

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12  % Problem  : SWV365+1 : TPTP v8.1.2. Released v3.3.0.
% 0.06/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.33  % Computer : n028.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33  % CPULimit : 300
% 0.12/0.33  % WCLimit  : 300
% 0.12/0.33  % DateTime : Tue Aug 29 07:35:25 EDT 2023
% 0.12/0.34  % CPUTime  : 
% 0.19/0.48  Command-line arguments: --flatten
% 0.19/0.48  
% 0.19/0.48  % SZS status Theorem
% 0.19/0.48  
% 0.19/0.48  % SZS output start Proof
% 0.19/0.48  Take the following subset of the input axioms:
% 0.19/0.48    fof(ax54, axiom, ![U, V]: i(triple(U, create_slb, V))=create_pq).
% 0.19/0.48    fof(l1_co, conjecture, ![X, Y, U2, V2]: i(triple(U2, create_slb, X))=i(triple(V2, create_slb, Y))).
% 0.19/0.48  
% 0.19/0.48  Now clausify the problem and encode Horn clauses using encoding 3 of
% 0.19/0.48  http://www.cse.chalmers.se/~nicsma/papers/horn.pdf.
% 0.19/0.48  We repeatedly replace C & s=t => u=v by the two clauses:
% 0.19/0.48    fresh(y, y, x1...xn) = u
% 0.19/0.48    C => fresh(s, t, x1...xn) = v
% 0.19/0.48  where fresh is a fresh function symbol and x1..xn are the free
% 0.19/0.48  variables of u and v.
% 0.19/0.48  A predicate p(X) is encoded as p(X)=true (this is sound, because the
% 0.19/0.48  input problem has no model of domain size 1).
% 0.19/0.48  
% 0.19/0.48  The encoding turns the above axioms into the following unit equations and goals:
% 0.19/0.48  
% 0.19/0.48  Axiom 1 (ax54): i(triple(X, create_slb, Y)) = create_pq.
% 0.19/0.48  
% 0.19/0.48  Goal 1 (l1_co): i(triple(u, create_slb, x)) = i(triple(v, create_slb, y)).
% 0.19/0.48  Proof:
% 0.19/0.48    i(triple(u, create_slb, x))
% 0.19/0.48  = { by axiom 1 (ax54) }
% 0.19/0.48    create_pq
% 0.19/0.48  = { by axiom 1 (ax54) R->L }
% 0.19/0.48    i(triple(v, create_slb, y))
% 0.19/0.48  % SZS output end Proof
% 0.19/0.48  
% 0.19/0.48  RESULT: Theorem (the conjecture is true).
%------------------------------------------------------------------------------