%------------------------------------------------------------------------------
% File     : Twee---2.4.2
% Problem  : CSR046+2 : 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 : n001.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:20 EDT 2023

% Result   : Theorem 25.81s 3.80s
% Output   : Proof 25.81s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13  % Problem  : CSR046+2 : TPTP v8.1.2. Released v3.4.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.15/0.36  % Computer : n001.cluster.edu
% 0.15/0.36  % Model    : x86_64 x86_64
% 0.15/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36  % Memory   : 8042.1875MB
% 0.15/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36  % CPULimit : 300
% 0.15/0.36  % WCLimit  : 300
% 0.15/0.36  % DateTime : Mon Aug 28 14:54:05 EDT 2023
% 0.15/0.36  % CPUTime  : 
% 25.81/3.80  Command-line arguments: --flip-ordering --lhs-weight 1 --depth-weight 60 --distributivity-heuristic
% 25.81/3.80  
% 25.81/3.80  % SZS status Theorem
% 25.81/3.80  
% 25.81/3.80  % SZS output start Proof
% 25.81/3.80  Take the following subset of the input axioms:
% 25.81/3.80    fof(ax1_399, axiom, genls(c_tptpcol_16_50958, c_tptpcol_15_50957)).
% 25.81/3.80    fof(query96, conjecture, mtvisible(f_contentmtofcdafromeventfn(f_urlreferentfn(f_urlfn(s_http_wwwfuntriviacomplayquizcfmqid60926origin)), c_translation_0_885)) => genls(c_tptpcol_16_50958, c_tptpcol_15_50957)).
% 25.81/3.80  
% 25.81/3.80  Now clausify the problem and encode Horn clauses using encoding 3 of
% 25.81/3.80  http://www.cse.chalmers.se/~nicsma/papers/horn.pdf.
% 25.81/3.80  We repeatedly replace C & s=t => u=v by the two clauses:
% 25.81/3.80    fresh(y, y, x1...xn) = u
% 25.81/3.80    C => fresh(s, t, x1...xn) = v
% 25.81/3.80  where fresh is a fresh function symbol and x1..xn are the free
% 25.81/3.80  variables of u and v.
% 25.81/3.80  A predicate p(X) is encoded as p(X)=true (this is sound, because the
% 25.81/3.80  input problem has no model of domain size 1).
% 25.81/3.80  
% 25.81/3.80  The encoding turns the above axioms into the following unit equations and goals:
% 25.81/3.80  
% 25.81/3.80  Axiom 1 (ax1_399): genls(c_tptpcol_16_50958, c_tptpcol_15_50957) = true2.
% 25.81/3.80  
% 25.81/3.80  Goal 1 (query96_1): genls(c_tptpcol_16_50958, c_tptpcol_15_50957) = true2.
% 25.81/3.80  Proof:
% 25.81/3.80    genls(c_tptpcol_16_50958, c_tptpcol_15_50957)
% 25.81/3.80  = { by axiom 1 (ax1_399) }
% 25.81/3.80    true2
% 25.81/3.80  % SZS output end Proof
% 25.81/3.80  
% 25.81/3.80  RESULT: Theorem (the conjecture is true).
%------------------------------------------------------------------------------