%------------------------------------------------------------------------------
% File     : Twee---2.4.2
% Problem  : SYN261-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 : n020.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:49 EDT 2023

% Result   : Unsatisfiable 12.40s 1.95s
% Output   : Proof 12.40s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : SYN261-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.14/0.34  % Computer : n020.cluster.edu
% 0.14/0.34  % Model    : x86_64 x86_64
% 0.14/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34  % Memory   : 8042.1875MB
% 0.14/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34  % CPULimit : 300
% 0.14/0.34  % WCLimit  : 300
% 0.14/0.34  % DateTime : Sat Aug 26 18:09:59 EDT 2023
% 0.14/0.34  % CPUTime  : 
% 12.40/1.95  Command-line arguments: --ground-connectedness --complete-subsets
% 12.40/1.95  
% 12.40/1.95  % SZS status Unsatisfiable
% 12.40/1.95  
% 12.40/1.95  % SZS output start Proof
% 12.40/1.95  Take the following subset of the input axioms:
% 12.40/1.95    fof(axiom_14, axiom, ![X]: p0(b, X)).
% 12.40/1.95    fof(prove_this, negated_conjecture, ![X2]: ~p1(b, X2, b)).
% 12.40/1.95    fof(rule_069, axiom, ![C, B]: (p1(B, B, C) | ~p0(C, B))).
% 12.40/1.95  
% 12.40/1.95  Now clausify the problem and encode Horn clauses using encoding 3 of
% 12.40/1.95  http://www.cse.chalmers.se/~nicsma/papers/horn.pdf.
% 12.40/1.95  We repeatedly replace C & s=t => u=v by the two clauses:
% 12.40/1.95    fresh(y, y, x1...xn) = u
% 12.40/1.95    C => fresh(s, t, x1...xn) = v
% 12.40/1.95  where fresh is a fresh function symbol and x1..xn are the free
% 12.40/1.95  variables of u and v.
% 12.40/1.95  A predicate p(X) is encoded as p(X)=true (this is sound, because the
% 12.40/1.95  input problem has no model of domain size 1).
% 12.40/1.95  
% 12.40/1.95  The encoding turns the above axioms into the following unit equations and goals:
% 12.40/1.95  
% 12.40/1.95  Axiom 1 (axiom_14): p0(b, X) = true2.
% 12.40/1.95  Axiom 2 (rule_069): fresh349(X, X, Y, Z) = true2.
% 12.40/1.95  Axiom 3 (rule_069): fresh349(p0(X, Y), true2, Y, X) = p1(Y, Y, X).
% 12.40/1.95  
% 12.40/1.95  Goal 1 (prove_this): p1(b, X, b) = true2.
% 12.40/1.95  The goal is true when:
% 12.40/1.95    X = b
% 12.40/1.95  
% 12.40/1.95  Proof:
% 12.40/1.95    p1(b, b, b)
% 12.40/1.95  = { by axiom 3 (rule_069) R->L }
% 12.40/1.95    fresh349(p0(b, b), true2, b, b)
% 12.40/1.95  = { by axiom 1 (axiom_14) }
% 12.40/1.95    fresh349(true2, true2, b, b)
% 12.40/1.95  = { by axiom 2 (rule_069) }
% 12.40/1.95    true2
% 12.40/1.95  % SZS output end Proof
% 12.40/1.95  
% 12.40/1.95  RESULT: Unsatisfiable (the axioms are contradictory).
%------------------------------------------------------------------------------