%------------------------------------------------------------------------------
% File     : Twee---2.4.2
% Problem  : CSR069+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 : n008.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:41 EDT 2023

% Result   : Theorem 24.66s 3.62s
% Output   : Proof 24.93s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : CSR069+2 : TPTP v8.1.2. Released v3.4.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 : n008.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 : Mon Aug 28 12:04:32 EDT 2023
% 0.14/0.34  % CPUTime  : 
% 24.66/3.62  Command-line arguments: --flip-ordering --lhs-weight 1 --depth-weight 60 --distributivity-heuristic
% 24.66/3.62  
% 24.66/3.62  % SZS status Theorem
% 24.66/3.62  
% 24.66/3.62  % SZS output start Proof
% 24.66/3.62  Take the following subset of the input axioms:
% 24.93/3.62    fof(ax1_463, axiom, mtvisible(c_tptpgeo_member1_mt) => borderson(c_georegion_l4_x38_y24, c_georegion_l4_x39_y24)).
% 24.93/3.62    fof(query119, conjecture, mtvisible(c_tptpgeo_member1_mt) => borderson(c_georegion_l4_x38_y24, c_georegion_l4_x39_y24)).
% 24.93/3.62  
% 24.93/3.63  Now clausify the problem and encode Horn clauses using encoding 3 of
% 24.93/3.63  http://www.cse.chalmers.se/~nicsma/papers/horn.pdf.
% 24.93/3.63  We repeatedly replace C & s=t => u=v by the two clauses:
% 24.93/3.63    fresh(y, y, x1...xn) = u
% 24.93/3.63    C => fresh(s, t, x1...xn) = v
% 24.93/3.63  where fresh is a fresh function symbol and x1..xn are the free
% 24.93/3.63  variables of u and v.
% 24.93/3.63  A predicate p(X) is encoded as p(X)=true (this is sound, because the
% 24.93/3.63  input problem has no model of domain size 1).
% 24.93/3.63  
% 24.93/3.63  The encoding turns the above axioms into the following unit equations and goals:
% 24.93/3.63  
% 24.93/3.63  Axiom 1 (query119): mtvisible(c_tptpgeo_member1_mt) = true2.
% 24.93/3.63  Axiom 2 (ax1_463): fresh501(X, X) = true2.
% 24.93/3.63  Axiom 3 (ax1_463): fresh501(mtvisible(c_tptpgeo_member1_mt), true2) = borderson(c_georegion_l4_x38_y24, c_georegion_l4_x39_y24).
% 24.93/3.63  
% 24.93/3.63  Goal 1 (query119_1): borderson(c_georegion_l4_x38_y24, c_georegion_l4_x39_y24) = true2.
% 24.93/3.63  Proof:
% 24.93/3.63    borderson(c_georegion_l4_x38_y24, c_georegion_l4_x39_y24)
% 24.93/3.63  = { by axiom 3 (ax1_463) R->L }
% 24.93/3.63    fresh501(mtvisible(c_tptpgeo_member1_mt), true2)
% 24.93/3.63  = { by axiom 1 (query119) }
% 24.93/3.63    fresh501(true2, true2)
% 24.93/3.63  = { by axiom 2 (ax1_463) }
% 24.93/3.63    true2
% 24.93/3.63  % SZS output end Proof
% 24.93/3.63  
% 24.93/3.63  RESULT: Theorem (the conjecture is true).
%------------------------------------------------------------------------------