%------------------------------------------------------------------------------
% File     : Twee---2.4.2
% Problem  : SWV395+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 : n015.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:05 EDT 2023

% Result   : Theorem 0.22s 0.46s
% Output   : Proof 0.22s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13  % Problem  : SWV395+1 : TPTP v8.1.2. Released v3.3.0.
% 0.00/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 : n015.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 : Tue Aug 29 03:45:10 EDT 2023
% 0.14/0.35  % CPUTime  : 
% 0.22/0.46  Command-line arguments: --set-join --lhs-weight 1 --no-flatten-goal --complete-subsets --goal-heuristic
% 0.22/0.46  
% 0.22/0.46  % SZS status Theorem
% 0.22/0.46  
% 0.22/0.46  % SZS output start Proof
% 0.22/0.46  Take the following subset of the input axioms:
% 0.22/0.46    fof(ax20, axiom, ![U]: ~contains_slb(create_slb, U)).
% 0.22/0.46    fof(ax22, axiom, ![V, U2]: ~pair_in_list(create_slb, U2, V)).
% 0.22/0.46    fof(ax38, axiom, ![W, X, Y, U2, V2]: (strictly_less_than(X, Y) => (check_cpq(triple(U2, insert_slb(V2, pair(X, Y)), W)) <=> $false))).
% 0.22/0.46    fof(ax40, axiom, ![U2, V2]: (ok(triple(U2, V2, bad)) <=> $false)).
% 0.22/0.46    fof(l31_co, conjecture, ![U2, V2, W2, X2]: ((pair_in_list(create_slb, W2, X2) & (strictly_less_than(W2, X2) & ok(remove_cpq(triple(U2, create_slb, V2), W2)))) => pair_in_list(remove_slb(create_slb, W2), W2, X2))).
% 0.22/0.46    fof(stricly_smaller_definition, axiom, ![U2, V2]: (strictly_less_than(U2, V2) <=> (less_than(U2, V2) & ~less_than(V2, U2)))).
% 0.22/0.46  
% 0.22/0.46  Now clausify the problem and encode Horn clauses using encoding 3 of
% 0.22/0.46  http://www.cse.chalmers.se/~nicsma/papers/horn.pdf.
% 0.22/0.46  We repeatedly replace C & s=t => u=v by the two clauses:
% 0.22/0.46    fresh(y, y, x1...xn) = u
% 0.22/0.46    C => fresh(s, t, x1...xn) = v
% 0.22/0.46  where fresh is a fresh function symbol and x1..xn are the free
% 0.22/0.46  variables of u and v.
% 0.22/0.46  A predicate p(X) is encoded as p(X)=true (this is sound, because the
% 0.22/0.46  input problem has no model of domain size 1).
% 0.22/0.46  
% 0.22/0.46  The encoding turns the above axioms into the following unit equations and goals:
% 0.22/0.46  
% 0.22/0.46  Axiom 1 (l31_co_1): pair_in_list(create_slb, w, x) = true2.
% 0.22/0.46  
% 0.22/0.46  Goal 1 (ax22): pair_in_list(create_slb, X, Y) = true2.
% 0.22/0.46  The goal is true when:
% 0.22/0.46    X = w
% 0.22/0.46    Y = x
% 0.22/0.46  
% 0.22/0.46  Proof:
% 0.22/0.46    pair_in_list(create_slb, w, x)
% 0.22/0.46  = { by axiom 1 (l31_co_1) }
% 0.22/0.46    true2
% 0.22/0.46  % SZS output end Proof
% 0.22/0.46  
% 0.22/0.46  RESULT: Theorem (the conjecture is true).
%------------------------------------------------------------------------------