%------------------------------------------------------------------------------
% File     : Twee---2.4.2
% Problem  : GEO035-3 : 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 : n026.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 : Wed Aug 30 23:26:58 EDT 2023

% Result   : Unsatisfiable 0.21s 0.42s
% Output   : Proof 0.21s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : GEO035-3 : TPTP v8.1.2. Released v1.0.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.35  % Computer : n026.cluster.edu
% 0.14/0.35  % Model    : x86_64 x86_64
% 0.14/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35  % Memory   : 8042.1875MB
% 0.14/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35  % CPULimit : 300
% 0.14/0.35  % WCLimit  : 300
% 0.14/0.35  % DateTime : Tue Aug 29 20:43:35 EDT 2023
% 0.14/0.35  % CPUTime  : 
% 0.21/0.42  Command-line arguments: --lhs-weight 1 --flip-ordering --normalise-queue-percent 10 --cp-renormalise-threshold 10
% 0.21/0.42  
% 0.21/0.42  % SZS status Unsatisfiable
% 0.21/0.42  
% 0.21/0.42  % SZS output start Proof
% 0.21/0.42  Take the following subset of the input axioms:
% 0.21/0.42    fof(identity_for_equidistance, axiom, ![X, Y, Z]: (~equidistant(X, Y, Z, Z) | X=Y)).
% 0.21/0.42    fof(prove_null_extension, negated_conjecture, v!=extension(u, v, w, w)).
% 0.21/0.42    fof(segment_construction2, axiom, ![V, W, X2, Y2]: equidistant(Y2, extension(X2, Y2, W, V), W, V)).
% 0.21/0.42  
% 0.21/0.42  Now clausify the problem and encode Horn clauses using encoding 3 of
% 0.21/0.42  http://www.cse.chalmers.se/~nicsma/papers/horn.pdf.
% 0.21/0.42  We repeatedly replace C & s=t => u=v by the two clauses:
% 0.21/0.42    fresh(y, y, x1...xn) = u
% 0.21/0.42    C => fresh(s, t, x1...xn) = v
% 0.21/0.42  where fresh is a fresh function symbol and x1..xn are the free
% 0.21/0.42  variables of u and v.
% 0.21/0.42  A predicate p(X) is encoded as p(X)=true (this is sound, because the
% 0.21/0.42  input problem has no model of domain size 1).
% 0.21/0.42  
% 0.21/0.42  The encoding turns the above axioms into the following unit equations and goals:
% 0.21/0.42  
% 0.21/0.42  Axiom 1 (identity_for_equidistance): fresh(X, X, Y, Z) = Z.
% 0.21/0.42  Axiom 2 (segment_construction2): equidistant(X, extension(Y, X, Z, W), Z, W) = true.
% 0.21/0.42  Axiom 3 (identity_for_equidistance): fresh(equidistant(X, Y, Z, Z), true, X, Y) = X.
% 0.21/0.42  
% 0.21/0.42  Goal 1 (prove_null_extension): v = extension(u, v, w, w).
% 0.21/0.42  Proof:
% 0.21/0.42    v
% 0.21/0.42  = { by axiom 3 (identity_for_equidistance) R->L }
% 0.21/0.42    fresh(equidistant(v, extension(u, v, w, w), w, w), true, v, extension(u, v, w, w))
% 0.21/0.42  = { by axiom 2 (segment_construction2) }
% 0.21/0.42    fresh(true, true, v, extension(u, v, w, w))
% 0.21/0.42  = { by axiom 1 (identity_for_equidistance) }
% 0.21/0.42    extension(u, v, w, w)
% 0.21/0.42  % SZS output end Proof
% 0.21/0.42  
% 0.21/0.42  RESULT: Unsatisfiable (the axioms are contradictory).
%------------------------------------------------------------------------------