TSTP Solution File: CAT001-4 by Twee---2.4.2

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Twee---2.4.2
% Problem  : CAT001-4 : 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 : n006.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 18:18:47 EDT 2023

% Result   : Unsatisfiable 0.20s 0.40s
% Output   : Proof 0.20s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : CAT001-4 : 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.13/0.34  % Computer : n006.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 : Sun Aug 27 00:14:07 EDT 2023
% 0.13/0.34  % CPUTime  : 
% 0.20/0.40  Command-line arguments: --kbo-weight0 --lhs-weight 5 --flip-ordering --normalise-queue-percent 10 --cp-renormalise-threshold 10 --goal-heuristic
% 0.20/0.40  
% 0.20/0.40  % SZS status Unsatisfiable
% 0.20/0.40  
% 0.20/0.41  % SZS output start Proof
% 0.20/0.41  Take the following subset of the input axioms:
% 0.20/0.41    fof(associativity_of_compose, axiom, ![X, Y, Z]: compose(X, compose(Y, Z))=compose(compose(X, Y), Z)).
% 0.20/0.41    fof(bh_equals_bg, hypothesis, compose(b, h)=compose(b, g)).
% 0.20/0.41    fof(monomorphism, hypothesis, ![X2, Y2, Z2]: (compose(compose(a, b), X2)!=Y2 | (compose(compose(a, b), Z2)!=Y2 | X2=Z2))).
% 0.20/0.41    fof(prove_h_equals_g, negated_conjecture, h!=g).
% 0.20/0.41  
% 0.20/0.41  Now clausify the problem and encode Horn clauses using encoding 3 of
% 0.20/0.41  http://www.cse.chalmers.se/~nicsma/papers/horn.pdf.
% 0.20/0.41  We repeatedly replace C & s=t => u=v by the two clauses:
% 0.20/0.41    fresh(y, y, x1...xn) = u
% 0.20/0.41    C => fresh(s, t, x1...xn) = v
% 0.20/0.41  where fresh is a fresh function symbol and x1..xn are the free
% 0.20/0.41  variables of u and v.
% 0.20/0.41  A predicate p(X) is encoded as p(X)=true (this is sound, because the
% 0.20/0.41  input problem has no model of domain size 1).
% 0.20/0.41  
% 0.20/0.41  The encoding turns the above axioms into the following unit equations and goals:
% 0.20/0.41  
% 0.20/0.41  Axiom 1 (bh_equals_bg): compose(b, h) = compose(b, g).
% 0.20/0.41  Axiom 2 (associativity_of_compose): compose(X, compose(Y, Z)) = compose(compose(X, Y), Z).
% 0.20/0.41  Axiom 3 (monomorphism): fresh2(X, X, Y, Z) = Z.
% 0.20/0.41  Axiom 4 (monomorphism): fresh3(X, X, Y, Z, W) = Y.
% 0.20/0.41  Axiom 5 (monomorphism): fresh3(compose(compose(a, b), X), Y, Z, Y, X) = fresh2(compose(compose(a, b), Z), Y, Z, X).
% 0.20/0.41  
% 0.20/0.41  Goal 1 (prove_h_equals_g): h = g.
% 0.20/0.41  Proof:
% 0.20/0.41    h
% 0.20/0.41  = { by axiom 4 (monomorphism) R->L }
% 0.20/0.41    fresh3(compose(a, compose(b, g)), compose(a, compose(b, g)), h, compose(a, compose(b, g)), g)
% 0.20/0.41  = { by axiom 2 (associativity_of_compose) }
% 0.20/0.41    fresh3(compose(compose(a, b), g), compose(a, compose(b, g)), h, compose(a, compose(b, g)), g)
% 0.20/0.41  = { by axiom 5 (monomorphism) }
% 0.20/0.41    fresh2(compose(compose(a, b), h), compose(a, compose(b, g)), h, g)
% 0.20/0.41  = { by axiom 2 (associativity_of_compose) R->L }
% 0.20/0.41    fresh2(compose(a, compose(b, h)), compose(a, compose(b, g)), h, g)
% 0.20/0.41  = { by axiom 1 (bh_equals_bg) R->L }
% 0.20/0.41    fresh2(compose(a, compose(b, h)), compose(a, compose(b, h)), h, g)
% 0.20/0.41  = { by axiom 3 (monomorphism) }
% 0.20/0.41    g
% 0.20/0.41  % SZS output end Proof
% 0.20/0.41  
% 0.20/0.41  RESULT: Unsatisfiable (the axioms are contradictory).
%------------------------------------------------------------------------------