%------------------------------------------------------------------------------
% File     : Twee---2.4.2
% Problem  : GRP007-1 : TPTP v8.1.2. Released v1.0.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 : n018.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 : Thu Aug 31 01:16:32 EDT 2023

% Result   : Unsatisfiable 0.13s 0.39s
% Output   : Proof 0.13s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12  % Problem  : GRP007-1 : TPTP v8.1.2. Released v1.0.0.
% 0.06/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 : n018.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 : Mon Aug 28 23:35:17 EDT 2023
% 0.13/0.34  % CPUTime  : 
% 0.13/0.39  Command-line arguments: --no-flatten-goal
% 0.13/0.39  
% 0.13/0.39  % SZS status Unsatisfiable
% 0.13/0.39  
% 0.13/0.39  % SZS output start Proof
% 0.13/0.39  Take the following subset of the input axioms:
% 0.13/0.39    fof(another_right_identity, hypothesis, ![A]: product(A, c, A)).
% 0.13/0.39    fof(left_identity, axiom, ![X]: product(identity, X, X)).
% 0.13/0.39    fof(prove_identity_equals_c, negated_conjecture, identity!=c).
% 0.13/0.39    fof(total_function2, axiom, ![Y, Z, W, X2]: (~product(X2, Y, Z) | (~product(X2, Y, W) | Z=W))).
% 0.13/0.39  
% 0.13/0.39  Now clausify the problem and encode Horn clauses using encoding 3 of
% 0.13/0.39  http://www.cse.chalmers.se/~nicsma/papers/horn.pdf.
% 0.13/0.39  We repeatedly replace C & s=t => u=v by the two clauses:
% 0.13/0.39    fresh(y, y, x1...xn) = u
% 0.13/0.39    C => fresh(s, t, x1...xn) = v
% 0.13/0.39  where fresh is a fresh function symbol and x1..xn are the free
% 0.13/0.39  variables of u and v.
% 0.13/0.39  A predicate p(X) is encoded as p(X)=true (this is sound, because the
% 0.13/0.39  input problem has no model of domain size 1).
% 0.13/0.39  
% 0.13/0.39  The encoding turns the above axioms into the following unit equations and goals:
% 0.13/0.39  
% 0.13/0.39  Axiom 1 (another_right_identity): product(X, c, X) = true.
% 0.13/0.39  Axiom 2 (left_identity): product(identity, X, X) = true.
% 0.13/0.39  Axiom 3 (total_function2): fresh(X, X, Y, Z) = Z.
% 0.13/0.39  Axiom 4 (total_function2): fresh2(X, X, Y, Z, W, V) = W.
% 0.13/0.39  Axiom 5 (total_function2): fresh2(product(X, Y, Z), true, X, Y, W, Z) = fresh(product(X, Y, W), true, W, Z).
% 0.13/0.39  
% 0.13/0.39  Goal 1 (prove_identity_equals_c): identity = c.
% 0.13/0.39  Proof:
% 0.13/0.39    identity
% 0.13/0.39  = { by axiom 3 (total_function2) R->L }
% 0.13/0.39    fresh(true, true, c, identity)
% 0.13/0.39  = { by axiom 2 (left_identity) R->L }
% 0.13/0.39    fresh(product(identity, c, c), true, c, identity)
% 0.13/0.39  = { by axiom 5 (total_function2) R->L }
% 0.13/0.39    fresh2(product(identity, c, identity), true, identity, c, c, identity)
% 0.13/0.39  = { by axiom 1 (another_right_identity) }
% 0.13/0.39    fresh2(true, true, identity, c, c, identity)
% 0.13/0.39  = { by axiom 4 (total_function2) }
% 0.13/0.39    c
% 0.13/0.39  % SZS output end Proof
% 0.13/0.39  
% 0.13/0.39  RESULT: Unsatisfiable (the axioms are contradictory).
%------------------------------------------------------------------------------