TSTP Solution File: SWC044-1 by Twee---2.4.2

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Twee---2.4.2
% Problem  : SWC044-1 : TPTP v8.1.2. Released v2.4.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 : n012.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 20:53:35 EDT 2023

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

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : SWC044-1 : TPTP v8.1.2. Released v2.4.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.35  % Computer : n012.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.35  % CPULimit : 300
% 0.13/0.35  % WCLimit  : 300
% 0.13/0.35  % DateTime : Mon Aug 28 18:09:39 EDT 2023
% 0.13/0.35  % CPUTime  : 
% 0.21/0.81  Command-line arguments: --flip-ordering --lhs-weight 1 --depth-weight 60 --distributivity-heuristic
% 0.21/0.81  
% 0.21/0.81  % SZS status Unsatisfiable
% 0.21/0.81  
% 0.21/0.81  % SZS output start Proof
% 0.21/0.81  Take the following subset of the input axioms:
% 0.21/0.81    fof(clause82, axiom, ![U]: (~rearsegP(nil, U) | (~ssList(U) | nil=U))).
% 0.21/0.81    fof(co1_1, negated_conjecture, ssList(sk1)).
% 0.21/0.81    fof(co1_5, negated_conjecture, nil=sk2).
% 0.21/0.81    fof(co1_6, negated_conjecture, sk2=sk4).
% 0.21/0.81    fof(co1_7, negated_conjecture, sk1=sk3).
% 0.21/0.81    fof(co1_8, negated_conjecture, rearsegP(sk4, sk3)).
% 0.21/0.81    fof(co1_9, negated_conjecture, nil!=sk1).
% 0.21/0.81  
% 0.21/0.81  Now clausify the problem and encode Horn clauses using encoding 3 of
% 0.21/0.81  http://www.cse.chalmers.se/~nicsma/papers/horn.pdf.
% 0.21/0.81  We repeatedly replace C & s=t => u=v by the two clauses:
% 0.21/0.81    fresh(y, y, x1...xn) = u
% 0.21/0.81    C => fresh(s, t, x1...xn) = v
% 0.21/0.81  where fresh is a fresh function symbol and x1..xn are the free
% 0.21/0.81  variables of u and v.
% 0.21/0.81  A predicate p(X) is encoded as p(X)=true (this is sound, because the
% 0.21/0.81  input problem has no model of domain size 1).
% 0.21/0.81  
% 0.21/0.81  The encoding turns the above axioms into the following unit equations and goals:
% 0.21/0.81  
% 0.21/0.81  Axiom 1 (co1_5): nil = sk2.
% 0.21/0.81  Axiom 2 (co1_7): sk1 = sk3.
% 0.21/0.81  Axiom 3 (co1_6): sk2 = sk4.
% 0.21/0.81  Axiom 4 (co1_1): ssList(sk1) = true2.
% 0.21/0.81  Axiom 5 (co1_8): rearsegP(sk4, sk3) = true2.
% 0.21/0.81  Axiom 6 (clause82): fresh37(X, X, Y) = nil.
% 0.21/0.81  Axiom 7 (clause82): fresh10(X, X, Y) = Y.
% 0.21/0.81  Axiom 8 (clause82): fresh37(rearsegP(nil, X), true2, X) = fresh10(ssList(X), true2, X).
% 0.21/0.81  
% 0.21/0.81  Goal 1 (co1_9): nil = sk1.
% 0.21/0.81  Proof:
% 0.21/0.81    nil
% 0.21/0.81  = { by axiom 6 (clause82) R->L }
% 0.21/0.81    fresh37(true2, true2, sk1)
% 0.21/0.81  = { by axiom 5 (co1_8) R->L }
% 0.21/0.81    fresh37(rearsegP(sk4, sk3), true2, sk1)
% 0.21/0.81  = { by axiom 3 (co1_6) R->L }
% 0.21/0.81    fresh37(rearsegP(sk2, sk3), true2, sk1)
% 0.21/0.81  = { by axiom 1 (co1_5) R->L }
% 0.21/0.81    fresh37(rearsegP(nil, sk3), true2, sk1)
% 0.21/0.81  = { by axiom 2 (co1_7) R->L }
% 0.21/0.81    fresh37(rearsegP(nil, sk1), true2, sk1)
% 0.21/0.81  = { by axiom 8 (clause82) }
% 0.21/0.81    fresh10(ssList(sk1), true2, sk1)
% 0.21/0.81  = { by axiom 4 (co1_1) }
% 0.21/0.81    fresh10(true2, true2, sk1)
% 0.21/0.81  = { by axiom 7 (clause82) }
% 0.21/0.81    sk1
% 0.21/0.81  % SZS output end Proof
% 0.21/0.81  
% 0.21/0.81  RESULT: Unsatisfiable (the axioms are contradictory).
%------------------------------------------------------------------------------