%------------------------------------------------------------------------------
% File     : Twee---2.4.2
% Problem  : SYN146-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 : 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:21 EDT 2023

% Result   : Unsatisfiable 11.91s 1.90s
% Output   : Proof 11.91s
% Verified : 
% SZS Type : -

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