TSTP Solution File: SEU247+1 by Twee---2.4.2

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Twee---2.4.2
% Problem  : SEU247+1 : TPTP v8.1.2. Released v3.3.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 : Thu Aug 31 17:51:48 EDT 2023

% Result   : Theorem 0.21s 0.40s
% Output   : Proof 0.21s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13  % Problem  : SEU247+1 : TPTP v8.1.2. Released v3.3.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.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 : Wed Aug 23 18:13:16 EDT 2023
% 0.14/0.35  % CPUTime  : 
% 0.21/0.40  Command-line arguments: --set-join --lhs-weight 1 --no-flatten-goal --complete-subsets --goal-heuristic
% 0.21/0.40  
% 0.21/0.40  % SZS status Theorem
% 0.21/0.40  
% 0.21/0.40  % SZS output start Proof
% 0.21/0.40  Take the following subset of the input axioms:
% 0.21/0.41    fof(t140_relat_1, axiom, ![B, C, A2]: (relation(C) => relation_dom_restriction(relation_rng_restriction(A2, C), B)=relation_rng_restriction(A2, relation_dom_restriction(C, B)))).
% 0.21/0.41    fof(t17_wellord1, axiom, ![B2, A2_2]: (relation(B2) => relation_restriction(B2, A2_2)=relation_dom_restriction(relation_rng_restriction(A2_2, B2), A2_2))).
% 0.21/0.41    fof(t18_wellord1, conjecture, ![A, B2]: (relation(B2) => relation_restriction(B2, A)=relation_rng_restriction(A, relation_dom_restriction(B2, A)))).
% 0.21/0.41  
% 0.21/0.41  Now clausify the problem and encode Horn clauses using encoding 3 of
% 0.21/0.41  http://www.cse.chalmers.se/~nicsma/papers/horn.pdf.
% 0.21/0.41  We repeatedly replace C & s=t => u=v by the two clauses:
% 0.21/0.41    fresh(y, y, x1...xn) = u
% 0.21/0.41    C => fresh(s, t, x1...xn) = v
% 0.21/0.41  where fresh is a fresh function symbol and x1..xn are the free
% 0.21/0.41  variables of u and v.
% 0.21/0.41  A predicate p(X) is encoded as p(X)=true (this is sound, because the
% 0.21/0.41  input problem has no model of domain size 1).
% 0.21/0.41  
% 0.21/0.41  The encoding turns the above axioms into the following unit equations and goals:
% 0.21/0.41  
% 0.21/0.41  Axiom 1 (t18_wellord1): relation(b) = true.
% 0.21/0.41  Axiom 2 (t17_wellord1): fresh(X, X, Y, Z) = relation_restriction(Z, Y).
% 0.21/0.41  Axiom 3 (t17_wellord1): fresh(relation(X), true, Y, X) = relation_dom_restriction(relation_rng_restriction(Y, X), Y).
% 0.21/0.41  Axiom 4 (t140_relat_1): fresh2(X, X, Y, Z, W) = relation_rng_restriction(Y, relation_dom_restriction(W, Z)).
% 0.21/0.41  Axiom 5 (t140_relat_1): fresh2(relation(X), true, Y, Z, X) = relation_dom_restriction(relation_rng_restriction(Y, X), Z).
% 0.21/0.41  
% 0.21/0.41  Goal 1 (t18_wellord1_1): relation_restriction(b, a) = relation_rng_restriction(a, relation_dom_restriction(b, a)).
% 0.21/0.41  Proof:
% 0.21/0.41    relation_restriction(b, a)
% 0.21/0.41  = { by axiom 2 (t17_wellord1) R->L }
% 0.21/0.41    fresh(true, true, a, b)
% 0.21/0.41  = { by axiom 1 (t18_wellord1) R->L }
% 0.21/0.41    fresh(relation(b), true, a, b)
% 0.21/0.41  = { by axiom 3 (t17_wellord1) }
% 0.21/0.41    relation_dom_restriction(relation_rng_restriction(a, b), a)
% 0.21/0.41  = { by axiom 5 (t140_relat_1) R->L }
% 0.21/0.41    fresh2(relation(b), true, a, a, b)
% 0.21/0.41  = { by axiom 1 (t18_wellord1) }
% 0.21/0.41    fresh2(true, true, a, a, b)
% 0.21/0.41  = { by axiom 4 (t140_relat_1) }
% 0.21/0.41    relation_rng_restriction(a, relation_dom_restriction(b, a))
% 0.21/0.41  % SZS output end Proof
% 0.21/0.41  
% 0.21/0.41  RESULT: Theorem (the conjecture is true).
%------------------------------------------------------------------------------