%------------------------------------------------------------------------------
% File     : Twee---2.4.2
% Problem  : CSR051+1 : TPTP v8.1.2. Released v3.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 : n009.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 : Wed Aug 30 21:41:24 EDT 2023

% Result   : Theorem 0.21s 0.43s
% Output   : Proof 0.21s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13  % Problem  : CSR051+1 : TPTP v8.1.2. Released v3.4.0.
% 0.03/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 : n009.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 : Mon Aug 28 07:19:35 EDT 2023
% 0.14/0.36  % CPUTime  : 
% 0.21/0.43  Command-line arguments: --no-flatten-goal
% 0.21/0.43  
% 0.21/0.43  % SZS status Theorem
% 0.21/0.43  
% 0.21/0.43  % SZS output start Proof
% 0.21/0.43  Take the following subset of the input axioms:
% 0.21/0.43    fof(just1, axiom, mtvisible(c_tptp_member3356_mt) => marriagelicensedocument(c_tptpmarriagelicensedocument)).
% 0.21/0.43    fof(just2, axiom, ![OBJ, COL1, COL2]: ~(isa(OBJ, COL1) & (isa(OBJ, COL2) & disjointwith(COL1, COL2)))).
% 0.21/0.43    fof(query51, conjecture, ?[X]: (mtvisible(c_tptp_member3356_mt) => marriagelicensedocument(X))).
% 0.21/0.43  
% 0.21/0.43  Now clausify the problem and encode Horn clauses using encoding 3 of
% 0.21/0.43  http://www.cse.chalmers.se/~nicsma/papers/horn.pdf.
% 0.21/0.43  We repeatedly replace C & s=t => u=v by the two clauses:
% 0.21/0.43    fresh(y, y, x1...xn) = u
% 0.21/0.43    C => fresh(s, t, x1...xn) = v
% 0.21/0.43  where fresh is a fresh function symbol and x1..xn are the free
% 0.21/0.43  variables of u and v.
% 0.21/0.43  A predicate p(X) is encoded as p(X)=true (this is sound, because the
% 0.21/0.43  input problem has no model of domain size 1).
% 0.21/0.43  
% 0.21/0.43  The encoding turns the above axioms into the following unit equations and goals:
% 0.21/0.43  
% 0.21/0.43  Axiom 1 (query51): mtvisible(c_tptp_member3356_mt) = true2.
% 0.21/0.44  Axiom 2 (just1): fresh31(X, X) = true2.
% 0.21/0.44  Axiom 3 (just1): fresh31(mtvisible(c_tptp_member3356_mt), true2) = marriagelicensedocument(c_tptpmarriagelicensedocument).
% 0.21/0.44  
% 0.21/0.44  Goal 1 (query51_1): marriagelicensedocument(X) = true2.
% 0.21/0.44  The goal is true when:
% 0.21/0.44    X = c_tptpmarriagelicensedocument
% 0.21/0.44  
% 0.21/0.44  Proof:
% 0.21/0.44    marriagelicensedocument(c_tptpmarriagelicensedocument)
% 0.21/0.44  = { by axiom 3 (just1) R->L }
% 0.21/0.44    fresh31(mtvisible(c_tptp_member3356_mt), true2)
% 0.21/0.44  = { by axiom 1 (query51) }
% 0.21/0.44    fresh31(true2, true2)
% 0.21/0.44  = { by axiom 2 (just1) }
% 0.21/0.44    true2
% 0.21/0.44  % SZS output end Proof
% 0.21/0.44  
% 0.21/0.44  RESULT: Theorem (the conjecture is true).
%------------------------------------------------------------------------------