%------------------------------------------------------------------------------
% File     : Twee---2.4.2
% Problem  : SYN132-1 : TPTP v8.1.2. Released v1.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 : n016.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:17 EDT 2023

% Result   : Unsatisfiable 11.97s 1.94s
% Output   : Proof 11.97s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : SYN132-1 : TPTP v8.1.2. Released v1.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 : n016.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 : Sat Aug 26 21:19:27 EDT 2023
% 0.12/0.34  % CPUTime  : 
% 11.97/1.94  Command-line arguments: --set-join --lhs-weight 1 --no-flatten-goal --complete-subsets --goal-heuristic
% 11.97/1.94  
% 11.97/1.94  % SZS status Unsatisfiable
% 11.97/1.94  
% 11.97/1.94  % SZS output start Proof
% 11.97/1.94  Take the following subset of the input axioms:
% 11.97/1.94    fof(axiom_12, axiom, ![X]: m0(a, X, a)).
% 11.97/1.94    fof(prove_this, negated_conjecture, ![X2]: ~m0(X2, e, a)).
% 11.97/1.94  
% 11.97/1.94  Now clausify the problem and encode Horn clauses using encoding 3 of
% 11.97/1.94  http://www.cse.chalmers.se/~nicsma/papers/horn.pdf.
% 11.97/1.94  We repeatedly replace C & s=t => u=v by the two clauses:
% 11.97/1.94    fresh(y, y, x1...xn) = u
% 11.97/1.94    C => fresh(s, t, x1...xn) = v
% 11.97/1.94  where fresh is a fresh function symbol and x1..xn are the free
% 11.97/1.94  variables of u and v.
% 11.97/1.94  A predicate p(X) is encoded as p(X)=true (this is sound, because the
% 11.97/1.94  input problem has no model of domain size 1).
% 11.97/1.94  
% 11.97/1.94  The encoding turns the above axioms into the following unit equations and goals:
% 11.97/1.94  
% 11.97/1.94  Axiom 1 (axiom_12): m0(a, X, a) = true2.
% 11.97/1.94  
% 11.97/1.94  Goal 1 (prove_this): m0(X, e, a) = true2.
% 11.97/1.94  The goal is true when:
% 11.97/1.94    X = a
% 11.97/1.94  
% 11.97/1.94  Proof:
% 11.97/1.94    m0(a, e, a)
% 11.97/1.94  = { by axiom 1 (axiom_12) }
% 11.97/1.94    true2
% 11.97/1.94  % SZS output end Proof
% 11.97/1.94  
% 11.97/1.94  RESULT: Unsatisfiable (the axioms are contradictory).
%------------------------------------------------------------------------------