%------------------------------------------------------------------------------
% File     : Twee---2.4.2
% Problem  : ALG396-1 : TPTP v8.1.2. Released v4.1.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 : n004.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 16:43:10 EDT 2023

% Result   : Unsatisfiable 50.36s 6.89s
% Output   : Proof 50.36s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : ALG396-1 : TPTP v8.1.2. Released v4.1.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.12/0.34  % Computer : n004.cluster.edu
% 0.12/0.34  % Model    : x86_64 x86_64
% 0.12/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34  % Memory   : 8042.1875MB
% 0.12/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34  % CPULimit : 300
% 0.12/0.34  % WCLimit  : 300
% 0.12/0.34  % DateTime : Mon Aug 28 02:31:37 EDT 2023
% 0.12/0.34  % CPUTime  : 
% 50.36/6.89  Command-line arguments: --no-flatten-goal
% 50.36/6.89  
% 50.36/6.89  % SZS status Unsatisfiable
% 50.36/6.89  
% 50.36/6.89  % SZS output start Proof
% 50.36/6.89  Take the following subset of the input axioms:
% 50.36/6.89    fof(cls_conjecture_0, negated_conjecture, c_Polynomial_Opoly(v_pa____, v_x____, tc_Complex_Ocomplex)!=c_Polynomial_Opoly(v_q____, c_HOL_Ominus__class_Ominus(v_x____, v_c____, tc_Complex_Ocomplex), tc_Complex_Ocomplex)).
% 50.36/6.89    fof(cls_th_0, axiom, ![V_x]: c_Polynomial_Opoly(v_q____, c_HOL_Ominus__class_Ominus(V_x, v_c____, tc_Complex_Ocomplex), tc_Complex_Ocomplex)=c_Polynomial_Opoly(v_pa____, V_x, tc_Complex_Ocomplex)).
% 50.36/6.89  
% 50.36/6.89  Now clausify the problem and encode Horn clauses using encoding 3 of
% 50.36/6.89  http://www.cse.chalmers.se/~nicsma/papers/horn.pdf.
% 50.36/6.89  We repeatedly replace C & s=t => u=v by the two clauses:
% 50.36/6.89    fresh(y, y, x1...xn) = u
% 50.36/6.89    C => fresh(s, t, x1...xn) = v
% 50.36/6.89  where fresh is a fresh function symbol and x1..xn are the free
% 50.36/6.89  variables of u and v.
% 50.36/6.89  A predicate p(X) is encoded as p(X)=true (this is sound, because the
% 50.36/6.89  input problem has no model of domain size 1).
% 50.36/6.89  
% 50.36/6.89  The encoding turns the above axioms into the following unit equations and goals:
% 50.36/6.89  
% 50.36/6.89  Axiom 1 (cls_th_0): c_Polynomial_Opoly(v_q____, c_HOL_Ominus__class_Ominus(X, v_c____, tc_Complex_Ocomplex), tc_Complex_Ocomplex) = c_Polynomial_Opoly(v_pa____, X, tc_Complex_Ocomplex).
% 50.36/6.89  
% 50.36/6.89  Goal 1 (cls_conjecture_0): c_Polynomial_Opoly(v_pa____, v_x____, tc_Complex_Ocomplex) = c_Polynomial_Opoly(v_q____, c_HOL_Ominus__class_Ominus(v_x____, v_c____, tc_Complex_Ocomplex), tc_Complex_Ocomplex).
% 50.36/6.89  Proof:
% 50.36/6.89    c_Polynomial_Opoly(v_pa____, v_x____, tc_Complex_Ocomplex)
% 50.36/6.89  = { by axiom 1 (cls_th_0) R->L }
% 50.36/6.89    c_Polynomial_Opoly(v_q____, c_HOL_Ominus__class_Ominus(v_x____, v_c____, tc_Complex_Ocomplex), tc_Complex_Ocomplex)
% 50.36/6.89  % SZS output end Proof
% 50.36/6.89  
% 50.36/6.89  RESULT: Unsatisfiable (the axioms are contradictory).
%------------------------------------------------------------------------------