%------------------------------------------------------------------------------
% File     : Twee---2.4.2
% Problem  : SEU306+2 : 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 : n006.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 17:52:07 EDT 2023

% Result   : Theorem 61.97s 8.32s
% Output   : Proof 61.97s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : SEU306+2 : TPTP v8.1.2. Released v3.3.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.14/0.34  % Computer : n006.cluster.edu
% 0.14/0.34  % Model    : x86_64 x86_64
% 0.14/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34  % Memory   : 8042.1875MB
% 0.14/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34  % CPULimit : 300
% 0.14/0.34  % WCLimit  : 300
% 0.14/0.34  % DateTime : Wed Aug 23 18:42:08 EDT 2023
% 0.14/0.35  % CPUTime  : 
% 61.97/8.32  Command-line arguments: --lhs-weight 1 --flip-ordering --normalise-queue-percent 10 --cp-renormalise-threshold 10
% 61.97/8.32  
% 61.97/8.32  % SZS status Theorem
% 61.97/8.32  
% 61.97/8.32  % SZS output start Proof
% 61.97/8.32  Take the following subset of the input axioms:
% 61.97/8.32    fof(d3_pre_topc, axiom, ![A2]: (one_sorted_str(A2) => cast_as_carrier_subset(A2)=the_carrier(A2))).
% 61.97/8.32    fof(t12_pre_topc, conjecture, ![A]: (one_sorted_str(A) => cast_as_carrier_subset(A)=the_carrier(A))).
% 61.97/8.32  
% 61.97/8.32  Now clausify the problem and encode Horn clauses using encoding 3 of
% 61.97/8.32  http://www.cse.chalmers.se/~nicsma/papers/horn.pdf.
% 61.97/8.32  We repeatedly replace C & s=t => u=v by the two clauses:
% 61.97/8.32    fresh(y, y, x1...xn) = u
% 61.97/8.32    C => fresh(s, t, x1...xn) = v
% 61.97/8.32  where fresh is a fresh function symbol and x1..xn are the free
% 61.97/8.32  variables of u and v.
% 61.97/8.32  A predicate p(X) is encoded as p(X)=true (this is sound, because the
% 61.97/8.32  input problem has no model of domain size 1).
% 61.97/8.32  
% 61.97/8.32  The encoding turns the above axioms into the following unit equations and goals:
% 61.97/8.32  
% 61.97/8.32  Axiom 1 (t12_pre_topc): one_sorted_str(a) = true2.
% 61.97/8.32  Axiom 2 (d3_pre_topc): fresh684(X, X, Y) = the_carrier(Y).
% 61.97/8.32  Axiom 3 (d3_pre_topc): fresh684(one_sorted_str(X), true2, X) = cast_as_carrier_subset(X).
% 61.97/8.32  
% 61.97/8.32  Goal 1 (t12_pre_topc_1): cast_as_carrier_subset(a) = the_carrier(a).
% 61.97/8.32  Proof:
% 61.97/8.32    cast_as_carrier_subset(a)
% 61.97/8.32  = { by axiom 3 (d3_pre_topc) R->L }
% 61.97/8.32    fresh684(one_sorted_str(a), true2, a)
% 61.97/8.32  = { by axiom 1 (t12_pre_topc) }
% 61.97/8.32    fresh684(true2, true2, a)
% 61.97/8.32  = { by axiom 2 (d3_pre_topc) }
% 61.97/8.32    the_carrier(a)
% 61.97/8.32  % SZS output end Proof
% 61.97/8.32  
% 61.97/8.32  RESULT: Theorem (the conjecture is true).
%------------------------------------------------------------------------------