%------------------------------------------------------------------------------
% File     : Twee---2.4.2
% Problem  : SYN095-1.002 : TPTP v8.1.2. Bugfixed v1.2.1.
% 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 : n028.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 : Fri Sep  1 03:33:09 EDT 2023

% Result   : Unsatisfiable 0.23s 0.43s
% Output   : Proof 0.23s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.14/0.16  % Problem  : SYN095-1.002 : TPTP v8.1.2. Bugfixed v1.2.1.
% 0.14/0.17  % Command  : parallel-twee %s --tstp --conditional-encoding if --smaller --drop-non-horn --give-up-on-saturation --explain-encoding --formal-proof
% 0.15/0.38  % Computer : n028.cluster.edu
% 0.15/0.38  % Model    : x86_64 x86_64
% 0.15/0.38  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.38  % Memory   : 8042.1875MB
% 0.15/0.38  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.38  % CPULimit : 300
% 0.15/0.38  % WCLimit  : 300
% 0.15/0.38  % DateTime : Sat Aug 26 21:23:38 EDT 2023
% 0.15/0.38  % CPUTime  : 
% 0.23/0.43  Command-line arguments: --lhs-weight 1 --flip-ordering --normalise-queue-percent 10 --cp-renormalise-threshold 10
% 0.23/0.43  
% 0.23/0.43  % SZS status Unsatisfiable
% 0.23/0.43  
% 0.23/0.43  % SZS output start Proof
% 0.23/0.43  Take the following subset of the input axioms:
% 0.23/0.43    fof(m_s2_goal_1, negated_conjecture, ![X]: ~p_1_2(X)).
% 0.23/0.43    fof(m_s2_type11_1, axiom, ![X2]: (p_1_2(X2) | (~p_2_2(X2) | ~p_1_1(X2)))).
% 0.23/0.43    fof(m_t2_1, axiom, p_1_1(a)).
% 0.23/0.43    fof(m_t2_3, axiom, p_2_2(a)).
% 0.23/0.43  
% 0.23/0.43  Now clausify the problem and encode Horn clauses using encoding 3 of
% 0.23/0.43  http://www.cse.chalmers.se/~nicsma/papers/horn.pdf.
% 0.23/0.43  We repeatedly replace C & s=t => u=v by the two clauses:
% 0.23/0.43    fresh(y, y, x1...xn) = u
% 0.23/0.43    C => fresh(s, t, x1...xn) = v
% 0.23/0.43  where fresh is a fresh function symbol and x1..xn are the free
% 0.23/0.43  variables of u and v.
% 0.23/0.43  A predicate p(X) is encoded as p(X)=true (this is sound, because the
% 0.23/0.43  input problem has no model of domain size 1).
% 0.23/0.43  
% 0.23/0.43  The encoding turns the above axioms into the following unit equations and goals:
% 0.23/0.43  
% 0.23/0.43  Axiom 1 (m_t2_3): p_2_2(a) = true2.
% 0.23/0.43  Axiom 2 (m_t2_1): p_1_1(a) = true2.
% 0.23/0.43  Axiom 3 (m_s2_type11_1): fresh12(X, X, Y) = true2.
% 0.23/0.43  Axiom 4 (m_s2_type11_1): fresh11(X, X, Y) = p_1_2(Y).
% 0.23/0.43  Axiom 5 (m_s2_type11_1): fresh11(p_1_1(X), true2, X) = fresh12(p_2_2(X), true2, X).
% 0.23/0.43  
% 0.23/0.43  Goal 1 (m_s2_goal_1): p_1_2(X) = true2.
% 0.23/0.43  The goal is true when:
% 0.23/0.43    X = a
% 0.23/0.43  
% 0.23/0.43  Proof:
% 0.23/0.43    p_1_2(a)
% 0.23/0.43  = { by axiom 4 (m_s2_type11_1) R->L }
% 0.23/0.43    fresh11(true2, true2, a)
% 0.23/0.43  = { by axiom 2 (m_t2_1) R->L }
% 0.23/0.43    fresh11(p_1_1(a), true2, a)
% 0.23/0.43  = { by axiom 5 (m_s2_type11_1) }
% 0.23/0.43    fresh12(p_2_2(a), true2, a)
% 0.23/0.43  = { by axiom 1 (m_t2_3) }
% 0.23/0.43    fresh12(true2, true2, a)
% 0.23/0.43  = { by axiom 3 (m_s2_type11_1) }
% 0.23/0.43    true2
% 0.23/0.43  % SZS output end Proof
% 0.23/0.43  
% 0.23/0.43  RESULT: Unsatisfiable (the axioms are contradictory).
%------------------------------------------------------------------------------