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

% Result   : Unsatisfiable 12.59s 1.99s
% Output   : Proof 12.59s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : SYN105-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.13/0.34  % Computer : n010.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 : Sat Aug 26 19:20:49 EDT 2023
% 0.13/0.34  % CPUTime  : 
% 12.59/1.99  Command-line arguments: --no-flatten-goal
% 12.59/1.99  
% 12.59/1.99  % SZS status Unsatisfiable
% 12.59/1.99  
% 12.59/1.99  % SZS output start Proof
% 12.59/1.99  Take the following subset of the input axioms:
% 12.59/1.99    fof(axiom_15, axiom, n0(a, b)).
% 12.59/1.99    fof(prove_this, negated_conjecture, ~k1(b)).
% 12.59/1.99    fof(rule_001, axiom, ![I, J]: (k1(I) | ~n0(J, I))).
% 12.59/1.99  
% 12.59/1.99  Now clausify the problem and encode Horn clauses using encoding 3 of
% 12.59/1.99  http://www.cse.chalmers.se/~nicsma/papers/horn.pdf.
% 12.59/1.99  We repeatedly replace C & s=t => u=v by the two clauses:
% 12.59/1.99    fresh(y, y, x1...xn) = u
% 12.59/1.99    C => fresh(s, t, x1...xn) = v
% 12.59/1.99  where fresh is a fresh function symbol and x1..xn are the free
% 12.59/1.99  variables of u and v.
% 12.59/1.99  A predicate p(X) is encoded as p(X)=true (this is sound, because the
% 12.59/1.99  input problem has no model of domain size 1).
% 12.59/1.99  
% 12.59/1.99  The encoding turns the above axioms into the following unit equations and goals:
% 12.59/1.99  
% 12.59/1.99  Axiom 1 (axiom_15): n0(a, b) = true.
% 12.59/1.99  Axiom 2 (rule_001): fresh440(X, X, Y) = true.
% 12.59/1.99  Axiom 3 (rule_001): fresh440(n0(X, Y), true, Y) = k1(Y).
% 12.59/1.99  
% 12.59/1.99  Goal 1 (prove_this): k1(b) = true.
% 12.59/1.99  Proof:
% 12.59/1.99    k1(b)
% 12.59/1.99  = { by axiom 3 (rule_001) R->L }
% 12.59/1.99    fresh440(n0(a, b), true, b)
% 12.59/1.99  = { by axiom 1 (axiom_15) }
% 12.59/1.99    fresh440(true, true, b)
% 12.59/1.99  = { by axiom 2 (rule_001) }
% 12.59/1.99    true
% 12.59/1.99  % SZS output end Proof
% 12.59/1.99  
% 12.59/1.99  RESULT: Unsatisfiable (the axioms are contradictory).
%------------------------------------------------------------------------------