%------------------------------------------------------------------------------
% File     : Twee---2.4.2
% Problem  : COL103-1 : TPTP v8.1.2. Released v3.2.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 : n022.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 18:32:09 EDT 2023

% Result   : Unsatisfiable 43.49s 5.99s
% Output   : Proof 43.77s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : COL103-1 : TPTP v8.1.2. Released v3.2.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.18/0.34  % Computer : n022.cluster.edu
% 0.18/0.34  % Model    : x86_64 x86_64
% 0.18/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.34  % Memory   : 8042.1875MB
% 0.18/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.18/0.34  % CPULimit : 300
% 0.18/0.34  % WCLimit  : 300
% 0.18/0.34  % DateTime : Sun Aug 27 05:12:39 EDT 2023
% 0.18/0.34  % CPUTime  : 
% 43.49/5.99  Command-line arguments: --flip-ordering --lhs-weight 1 --depth-weight 60 --distributivity-heuristic
% 43.49/5.99  
% 43.49/5.99  % SZS status Unsatisfiable
% 43.49/5.99  
% 43.49/5.99  % SZS output start Proof
% 43.49/5.99  Take the following subset of the input axioms:
% 43.49/5.99    fof(cls_Transitive__Closure_Ortrancl_Ortrancl__refl_0, axiom, ![V_r, T_a, V_a]: c_in(c_Pair(V_a, V_a, T_a, T_a), c_Transitive__Closure_Ortrancl(V_r, T_a), tc_prod(T_a, T_a))).
% 43.49/5.99    fof(cls_conjecture_0, negated_conjecture, ~c_in(c_Pair(c_Comb_Ocomb_Oop_A_D_D(v_z, v_x), c_Comb_Ocomb_Oop_A_D_D(v_z, v_x), tc_Comb_Ocomb, tc_Comb_Ocomb), c_Transitive__Closure_Ortrancl(c_Comb_Ocontract, tc_Comb_Ocomb), tc_prod(tc_Comb_Ocomb, tc_Comb_Ocomb))).
% 43.49/5.99  
% 43.49/5.99  Now clausify the problem and encode Horn clauses using encoding 3 of
% 43.49/5.99  http://www.cse.chalmers.se/~nicsma/papers/horn.pdf.
% 43.49/5.99  We repeatedly replace C & s=t => u=v by the two clauses:
% 43.49/5.99    fresh(y, y, x1...xn) = u
% 43.49/5.99    C => fresh(s, t, x1...xn) = v
% 43.49/5.99  where fresh is a fresh function symbol and x1..xn are the free
% 43.49/5.99  variables of u and v.
% 43.49/5.99  A predicate p(X) is encoded as p(X)=true (this is sound, because the
% 43.49/5.99  input problem has no model of domain size 1).
% 43.49/5.99  
% 43.49/5.99  The encoding turns the above axioms into the following unit equations and goals:
% 43.49/5.99  
% 43.49/5.99  Axiom 1 (cls_Transitive__Closure_Ortrancl_Ortrancl__refl_0): c_in(c_Pair(X, X, Y, Y), c_Transitive__Closure_Ortrancl(Z, Y), tc_prod(Y, Y)) = true2.
% 43.49/5.99  
% 43.49/5.99  Goal 1 (cls_conjecture_0): c_in(c_Pair(c_Comb_Ocomb_Oop_A_D_D(v_z, v_x), c_Comb_Ocomb_Oop_A_D_D(v_z, v_x), tc_Comb_Ocomb, tc_Comb_Ocomb), c_Transitive__Closure_Ortrancl(c_Comb_Ocontract, tc_Comb_Ocomb), tc_prod(tc_Comb_Ocomb, tc_Comb_Ocomb)) = true2.
% 43.49/5.99  Proof:
% 43.49/5.99    c_in(c_Pair(c_Comb_Ocomb_Oop_A_D_D(v_z, v_x), c_Comb_Ocomb_Oop_A_D_D(v_z, v_x), tc_Comb_Ocomb, tc_Comb_Ocomb), c_Transitive__Closure_Ortrancl(c_Comb_Ocontract, tc_Comb_Ocomb), tc_prod(tc_Comb_Ocomb, tc_Comb_Ocomb))
% 43.49/5.99  = { by axiom 1 (cls_Transitive__Closure_Ortrancl_Ortrancl__refl_0) }
% 43.77/5.99    true2
% 43.77/5.99  % SZS output end Proof
% 43.77/5.99  
% 43.77/5.99  RESULT: Unsatisfiable (the axioms are contradictory).
%------------------------------------------------------------------------------