%------------------------------------------------------------------------------
% File     : Twee---2.4.2
% Problem  : SYN165-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 : n010.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:26 EDT 2023

% Result   : Unsatisfiable 11.82s 2.05s
% Output   : Proof 11.82s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13  % Problem  : SYN165-1 : TPTP v8.1.2. Released v1.1.0.
% 0.00/0.14  % Command  : parallel-twee %s --tstp --conditional-encoding if --smaller --drop-non-horn --give-up-on-saturation --explain-encoding --formal-proof
% 0.13/0.35  % Computer : n010.cluster.edu
% 0.13/0.35  % Model    : x86_64 x86_64
% 0.13/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35  % Memory   : 8042.1875MB
% 0.13/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35  % CPULimit : 300
% 0.13/0.35  % WCLimit  : 300
% 0.13/0.35  % DateTime : Sat Aug 26 18:06:35 EDT 2023
% 0.13/0.35  % CPUTime  : 
% 11.82/2.05  Command-line arguments: --no-flatten-goal
% 11.82/2.05  
% 11.82/2.05  % SZS status Unsatisfiable
% 11.82/2.05  
% 11.82/2.05  % SZS output start Proof
% 11.82/2.05  Take the following subset of the input axioms:
% 11.82/2.05    fof(axiom_20, axiom, l0(a)).
% 11.82/2.05    fof(prove_this, negated_conjecture, ![X]: ~p1(X, a, X)).
% 11.82/2.05    fof(rule_088, axiom, p1(a, a, a) | ~l0(a)).
% 11.82/2.05  
% 11.82/2.05  Now clausify the problem and encode Horn clauses using encoding 3 of
% 11.82/2.05  http://www.cse.chalmers.se/~nicsma/papers/horn.pdf.
% 11.82/2.05  We repeatedly replace C & s=t => u=v by the two clauses:
% 11.82/2.05    fresh(y, y, x1...xn) = u
% 11.82/2.05    C => fresh(s, t, x1...xn) = v
% 11.82/2.05  where fresh is a fresh function symbol and x1..xn are the free
% 11.82/2.05  variables of u and v.
% 11.82/2.05  A predicate p(X) is encoded as p(X)=true (this is sound, because the
% 11.82/2.05  input problem has no model of domain size 1).
% 11.82/2.05  
% 11.82/2.05  The encoding turns the above axioms into the following unit equations and goals:
% 11.82/2.05  
% 11.82/2.05  Axiom 1 (axiom_20): l0(a) = true2.
% 11.82/2.05  Axiom 2 (rule_088): fresh323(X, X) = true2.
% 11.82/2.06  Axiom 3 (rule_088): fresh323(l0(a), true2) = p1(a, a, a).
% 11.82/2.06  
% 11.82/2.06  Goal 1 (prove_this): p1(X, a, X) = true2.
% 11.82/2.06  The goal is true when:
% 11.82/2.06    X = a
% 11.82/2.06  
% 11.82/2.06  Proof:
% 11.82/2.06    p1(a, a, a)
% 11.82/2.06  = { by axiom 3 (rule_088) R->L }
% 11.82/2.06    fresh323(l0(a), true2)
% 11.82/2.06  = { by axiom 1 (axiom_20) }
% 11.82/2.06    fresh323(true2, true2)
% 11.82/2.06  = { by axiom 2 (rule_088) }
% 11.82/2.06    true2
% 11.82/2.06  % SZS output end Proof
% 11.82/2.06  
% 11.82/2.06  RESULT: Unsatisfiable (the axioms are contradictory).
%------------------------------------------------------------------------------