%------------------------------------------------------------------------------
% File     : Twee---2.4.2
% Problem  : SYN197-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 : n014.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:33 EDT 2023

% Result   : Unsatisfiable 12.98s 2.12s
% Output   : Proof 12.98s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13  % Problem  : SYN197-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 : n014.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.36  % CPULimit : 300
% 0.13/0.36  % WCLimit  : 300
% 0.13/0.36  % DateTime : Sat Aug 26 19:24:02 EDT 2023
% 0.13/0.36  % CPUTime  : 
% 12.98/2.12  Command-line arguments: --set-join --lhs-weight 1 --no-flatten-goal --complete-subsets --goal-heuristic
% 12.98/2.12  
% 12.98/2.12  % SZS status Unsatisfiable
% 12.98/2.12  
% 12.98/2.12  % SZS output start Proof
% 12.98/2.12  Take the following subset of the input axioms:
% 12.98/2.13    fof(axiom_14, axiom, ![X]: p0(b, X)).
% 12.98/2.13    fof(prove_this, negated_conjecture, ~s1(b)).
% 12.98/2.13    fof(rule_125, axiom, ![I]: (s1(I) | ~p0(I, I))).
% 12.98/2.13  
% 12.98/2.13  Now clausify the problem and encode Horn clauses using encoding 3 of
% 12.98/2.13  http://www.cse.chalmers.se/~nicsma/papers/horn.pdf.
% 12.98/2.13  We repeatedly replace C & s=t => u=v by the two clauses:
% 12.98/2.13    fresh(y, y, x1...xn) = u
% 12.98/2.13    C => fresh(s, t, x1...xn) = v
% 12.98/2.13  where fresh is a fresh function symbol and x1..xn are the free
% 12.98/2.13  variables of u and v.
% 12.98/2.13  A predicate p(X) is encoded as p(X)=true (this is sound, because the
% 12.98/2.13  input problem has no model of domain size 1).
% 12.98/2.13  
% 12.98/2.13  The encoding turns the above axioms into the following unit equations and goals:
% 12.98/2.13  
% 12.98/2.13  Axiom 1 (axiom_14): p0(b, X) = true.
% 12.98/2.13  Axiom 2 (rule_125): fresh275(X, X, Y) = true.
% 12.98/2.13  Axiom 3 (rule_125): fresh275(p0(X, X), true, X) = s1(X).
% 12.98/2.13  
% 12.98/2.13  Goal 1 (prove_this): s1(b) = true.
% 12.98/2.13  Proof:
% 12.98/2.13    s1(b)
% 12.98/2.13  = { by axiom 3 (rule_125) R->L }
% 12.98/2.13    fresh275(p0(b, b), true, b)
% 12.98/2.13  = { by axiom 1 (axiom_14) }
% 12.98/2.13    fresh275(true, true, b)
% 12.98/2.13  = { by axiom 2 (rule_125) }
% 12.98/2.13    true
% 12.98/2.13  % SZS output end Proof
% 12.98/2.13  
% 12.98/2.13  RESULT: Unsatisfiable (the axioms are contradictory).
%------------------------------------------------------------------------------