%------------------------------------------------------------------------------
% File     : Twee---2.4.2
% Problem  : LCL432-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 : n011.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 : Thu Aug 31 08:18:55 EDT 2023

% Result   : Unsatisfiable 44.75s 6.06s
% Output   : Proof 44.75s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : LCL432-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.13/0.34  % Computer : n011.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit : 300
% 0.13/0.34  % WCLimit  : 300
% 0.13/0.34  % DateTime : Fri Aug 25 00:25:37 EDT 2023
% 0.13/0.34  % CPUTime  : 
% 44.75/6.06  Command-line arguments: --lhs-weight 1 --flip-ordering --normalise-queue-percent 10 --cp-renormalise-threshold 10
% 44.75/6.06  
% 44.75/6.06  % SZS status Unsatisfiable
% 44.75/6.06  
% 44.75/6.06  % SZS output start Proof
% 44.75/6.06  Take the following subset of the input axioms:
% 44.75/6.06    fof(cls_PropLog_Ocompleteness__0_0, axiom, ![T_a, V_p]: (~c_PropLog_Osat(c_emptyset, V_p, T_a) | c_in(V_p, c_PropLog_Othms(c_emptyset, T_a), tc_PropLog_Opl(T_a)))).
% 44.75/6.06    fof(cls_conjecture_0, negated_conjecture, c_PropLog_Osat(c_emptyset, v_x, t_a)).
% 44.75/6.06    fof(cls_conjecture_1, negated_conjecture, ~c_in(v_x, c_PropLog_Othms(c_emptyset, t_a), tc_PropLog_Opl(t_a))).
% 44.75/6.06  
% 44.75/6.06  Now clausify the problem and encode Horn clauses using encoding 3 of
% 44.75/6.06  http://www.cse.chalmers.se/~nicsma/papers/horn.pdf.
% 44.75/6.06  We repeatedly replace C & s=t => u=v by the two clauses:
% 44.75/6.06    fresh(y, y, x1...xn) = u
% 44.75/6.06    C => fresh(s, t, x1...xn) = v
% 44.75/6.06  where fresh is a fresh function symbol and x1..xn are the free
% 44.75/6.06  variables of u and v.
% 44.75/6.06  A predicate p(X) is encoded as p(X)=true (this is sound, because the
% 44.75/6.06  input problem has no model of domain size 1).
% 44.75/6.06  
% 44.75/6.06  The encoding turns the above axioms into the following unit equations and goals:
% 44.75/6.06  
% 44.75/6.06  Axiom 1 (cls_conjecture_0): c_PropLog_Osat(c_emptyset, v_x, t_a) = true2.
% 44.75/6.06  Axiom 2 (cls_PropLog_Ocompleteness__0_0): fresh1075(X, X, Y, Z) = true2.
% 44.75/6.06  Axiom 3 (cls_PropLog_Ocompleteness__0_0): fresh1075(c_PropLog_Osat(c_emptyset, X, Y), true2, X, Y) = c_in(X, c_PropLog_Othms(c_emptyset, Y), tc_PropLog_Opl(Y)).
% 44.75/6.06  
% 44.75/6.06  Goal 1 (cls_conjecture_1): c_in(v_x, c_PropLog_Othms(c_emptyset, t_a), tc_PropLog_Opl(t_a)) = true2.
% 44.75/6.06  Proof:
% 44.75/6.06    c_in(v_x, c_PropLog_Othms(c_emptyset, t_a), tc_PropLog_Opl(t_a))
% 44.75/6.06  = { by axiom 3 (cls_PropLog_Ocompleteness__0_0) R->L }
% 44.75/6.06    fresh1075(c_PropLog_Osat(c_emptyset, v_x, t_a), true2, v_x, t_a)
% 44.75/6.06  = { by axiom 1 (cls_conjecture_0) }
% 44.75/6.06    fresh1075(true2, true2, v_x, t_a)
% 44.75/6.06  = { by axiom 2 (cls_PropLog_Ocompleteness__0_0) }
% 44.75/6.06    true2
% 44.75/6.06  % SZS output end Proof
% 44.75/6.06  
% 44.75/6.06  RESULT: Unsatisfiable (the axioms are contradictory).
%------------------------------------------------------------------------------