%------------------------------------------------------------------------------
% File     : Twee---2.4.2
% Problem  : SWV410+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 : n023.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:04:08 EDT 2023

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

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : SWV410+1 : TPTP v8.1.2. Released v3.3.0.
% 0.03/0.13  % Command  : parallel-twee %s --tstp --conditional-encoding if --smaller --drop-non-horn --give-up-on-saturation --explain-encoding --formal-proof
% 0.13/0.34  % Computer : n023.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit : 300
% 0.13/0.34  % WCLimit  : 300
% 0.13/0.34  % DateTime : Tue Aug 29 04:33:25 EDT 2023
% 0.13/0.34  % CPUTime  : 
% 0.19/0.38  Command-line arguments: --lhs-weight 1 --flip-ordering --normalise-queue-percent 10 --cp-renormalise-threshold 10
% 0.19/0.38  
% 0.19/0.38  % SZS status Theorem
% 0.19/0.38  
% 0.19/0.38  % SZS output start Proof
% 0.19/0.38  Take the following subset of the input axioms:
% 0.19/0.38    fof(ax20, axiom, ![U]: ~contains_slb(create_slb, U)).
% 0.19/0.38    fof(ax22, axiom, ![V, U2]: ~pair_in_list(create_slb, U2, V)).
% 0.19/0.38    fof(l46_co, conjecture, ![U2]: (contains_slb(create_slb, U2) => ?[V2]: pair_in_list(create_slb, U2, V2))).
% 0.19/0.38    fof(stricly_smaller_definition, axiom, ![U2, V2]: (strictly_less_than(U2, V2) <=> (less_than(U2, V2) & ~less_than(V2, U2)))).
% 0.19/0.38  
% 0.19/0.38  Now clausify the problem and encode Horn clauses using encoding 3 of
% 0.19/0.38  http://www.cse.chalmers.se/~nicsma/papers/horn.pdf.
% 0.19/0.38  We repeatedly replace C & s=t => u=v by the two clauses:
% 0.19/0.38    fresh(y, y, x1...xn) = u
% 0.19/0.38    C => fresh(s, t, x1...xn) = v
% 0.19/0.38  where fresh is a fresh function symbol and x1..xn are the free
% 0.19/0.38  variables of u and v.
% 0.19/0.38  A predicate p(X) is encoded as p(X)=true (this is sound, because the
% 0.19/0.38  input problem has no model of domain size 1).
% 0.19/0.38  
% 0.19/0.38  The encoding turns the above axioms into the following unit equations and goals:
% 0.19/0.38  
% 0.19/0.38  Axiom 1 (l46_co): contains_slb(create_slb, u) = true2.
% 0.19/0.38  
% 0.19/0.38  Goal 1 (ax20): contains_slb(create_slb, X) = true2.
% 0.19/0.38  The goal is true when:
% 0.19/0.38    X = u
% 0.19/0.38  
% 0.19/0.38  Proof:
% 0.19/0.38    contains_slb(create_slb, u)
% 0.19/0.38  = { by axiom 1 (l46_co) }
% 0.19/0.38    true2
% 0.19/0.38  % SZS output end Proof
% 0.19/0.38  
% 0.19/0.38  RESULT: Theorem (the conjecture is true).
%------------------------------------------------------------------------------