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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Twee---2.4.2
% Problem  : SYN677-1 : TPTP v8.1.2. Released v2.5.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 : n013.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 : Fri Sep  1 03:35:40 EDT 2023

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

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : SYN677-1 : TPTP v8.1.2. Released v2.5.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 : n013.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 : Sat Aug 26 16:58:47 EDT 2023
% 0.13/0.35  % CPUTime  : 
% 0.20/0.56  Command-line arguments: --kbo-weight0 --lhs-weight 5 --flip-ordering --normalise-queue-percent 10 --cp-renormalise-threshold 10 --goal-heuristic
% 0.20/0.56  
% 0.20/0.56  % SZS status Unsatisfiable
% 0.20/0.56  
% 0.20/0.57  % SZS output start Proof
% 0.20/0.57  Take the following subset of the input axioms:
% 0.20/0.57    fof(not_p2_19, negated_conjecture, ![X96]: ~p2(X96, f16(X96, f9(f17(c31))))).
% 0.20/0.57    fof(p25_11, negated_conjecture, p25(c36, c33)).
% 0.20/0.57    fof(p25_13, negated_conjecture, p25(c32, c36)).
% 0.20/0.57    fof(p2_30, negated_conjecture, ![X35, X36, X37]: (p2(X36, X37) | (~p2(X35, X36) | ~p2(X35, X37)))).
% 0.20/0.57    fof(p2_40, negated_conjecture, p2(f11(f4(c32), c34), f16(f11(f4(c36), c34), f9(f17(c31))))).
% 0.20/0.57    fof(p2_50, negated_conjecture, ![X42]: (p2(f11(f4(X42), c34), f11(f4(c32), c34)) | (~p25(X42, c33) | ~p25(c32, X42)))).
% 0.20/0.57    fof(p2_6, negated_conjecture, ![X35_2]: p2(X35_2, X35_2)).
% 0.20/0.57  
% 0.20/0.57  Now clausify the problem and encode Horn clauses using encoding 3 of
% 0.20/0.57  http://www.cse.chalmers.se/~nicsma/papers/horn.pdf.
% 0.20/0.57  We repeatedly replace C & s=t => u=v by the two clauses:
% 0.20/0.57    fresh(y, y, x1...xn) = u
% 0.20/0.57    C => fresh(s, t, x1...xn) = v
% 0.20/0.57  where fresh is a fresh function symbol and x1..xn are the free
% 0.20/0.57  variables of u and v.
% 0.20/0.57  A predicate p(X) is encoded as p(X)=true (this is sound, because the
% 0.20/0.57  input problem has no model of domain size 1).
% 0.20/0.57  
% 0.20/0.57  The encoding turns the above axioms into the following unit equations and goals:
% 0.20/0.57  
% 0.20/0.57  Axiom 1 (p2_6): p2(X, X) = true2.
% 0.20/0.57  Axiom 2 (p25_13): p25(c32, c36) = true2.
% 0.20/0.57  Axiom 3 (p25_11): p25(c36, c33) = true2.
% 0.20/0.57  Axiom 4 (p2_50): fresh51(X, X, Y) = true2.
% 0.20/0.57  Axiom 5 (p2_50): fresh50(X, X, Y) = fresh51(p25(Y, c33), true2, Y).
% 0.20/0.57  Axiom 6 (p2_30): fresh15(X, X, Y, Z) = true2.
% 0.20/0.57  Axiom 7 (p2_30): fresh16(X, X, Y, Z, W) = p2(Y, Z).
% 0.20/0.57  Axiom 8 (p2_50): fresh50(p25(c32, X), true2, X) = p2(f11(f4(X), c34), f11(f4(c32), c34)).
% 0.20/0.57  Axiom 9 (p2_30): fresh16(p2(X, Y), true2, Z, Y, X) = fresh15(p2(X, Z), true2, Z, Y).
% 0.20/0.57  Axiom 10 (p2_40): p2(f11(f4(c32), c34), f16(f11(f4(c36), c34), f9(f17(c31)))) = true2.
% 0.20/0.57  
% 0.20/0.57  Goal 1 (not_p2_19): p2(X, f16(X, f9(f17(c31)))) = true2.
% 0.20/0.57  The goal is true when:
% 0.20/0.57    X = f11(f4(c36), c34)
% 0.20/0.57  
% 0.20/0.57  Proof:
% 0.20/0.57    p2(f11(f4(c36), c34), f16(f11(f4(c36), c34), f9(f17(c31))))
% 0.20/0.57  = { by axiom 7 (p2_30) R->L }
% 0.20/0.57    fresh16(true2, true2, f11(f4(c36), c34), f16(f11(f4(c36), c34), f9(f17(c31))), f11(f4(c32), c34))
% 0.20/0.57  = { by axiom 10 (p2_40) R->L }
% 0.20/0.57    fresh16(p2(f11(f4(c32), c34), f16(f11(f4(c36), c34), f9(f17(c31)))), true2, f11(f4(c36), c34), f16(f11(f4(c36), c34), f9(f17(c31))), f11(f4(c32), c34))
% 0.20/0.57  = { by axiom 9 (p2_30) }
% 0.20/0.57    fresh15(p2(f11(f4(c32), c34), f11(f4(c36), c34)), true2, f11(f4(c36), c34), f16(f11(f4(c36), c34), f9(f17(c31))))
% 0.20/0.57  = { by axiom 7 (p2_30) R->L }
% 0.20/0.57    fresh15(fresh16(true2, true2, f11(f4(c32), c34), f11(f4(c36), c34), f11(f4(c36), c34)), true2, f11(f4(c36), c34), f16(f11(f4(c36), c34), f9(f17(c31))))
% 0.20/0.57  = { by axiom 1 (p2_6) R->L }
% 0.20/0.57    fresh15(fresh16(p2(f11(f4(c36), c34), f11(f4(c36), c34)), true2, f11(f4(c32), c34), f11(f4(c36), c34), f11(f4(c36), c34)), true2, f11(f4(c36), c34), f16(f11(f4(c36), c34), f9(f17(c31))))
% 0.20/0.57  = { by axiom 9 (p2_30) }
% 0.20/0.57    fresh15(fresh15(p2(f11(f4(c36), c34), f11(f4(c32), c34)), true2, f11(f4(c32), c34), f11(f4(c36), c34)), true2, f11(f4(c36), c34), f16(f11(f4(c36), c34), f9(f17(c31))))
% 0.20/0.57  = { by axiom 8 (p2_50) R->L }
% 0.20/0.57    fresh15(fresh15(fresh50(p25(c32, c36), true2, c36), true2, f11(f4(c32), c34), f11(f4(c36), c34)), true2, f11(f4(c36), c34), f16(f11(f4(c36), c34), f9(f17(c31))))
% 0.20/0.57  = { by axiom 2 (p25_13) }
% 0.20/0.57    fresh15(fresh15(fresh50(true2, true2, c36), true2, f11(f4(c32), c34), f11(f4(c36), c34)), true2, f11(f4(c36), c34), f16(f11(f4(c36), c34), f9(f17(c31))))
% 0.20/0.57  = { by axiom 5 (p2_50) }
% 0.20/0.57    fresh15(fresh15(fresh51(p25(c36, c33), true2, c36), true2, f11(f4(c32), c34), f11(f4(c36), c34)), true2, f11(f4(c36), c34), f16(f11(f4(c36), c34), f9(f17(c31))))
% 0.20/0.57  = { by axiom 3 (p25_11) }
% 0.20/0.57    fresh15(fresh15(fresh51(true2, true2, c36), true2, f11(f4(c32), c34), f11(f4(c36), c34)), true2, f11(f4(c36), c34), f16(f11(f4(c36), c34), f9(f17(c31))))
% 0.20/0.57  = { by axiom 4 (p2_50) }
% 0.20/0.57    fresh15(fresh15(true2, true2, f11(f4(c32), c34), f11(f4(c36), c34)), true2, f11(f4(c36), c34), f16(f11(f4(c36), c34), f9(f17(c31))))
% 0.20/0.57  = { by axiom 6 (p2_30) }
% 0.20/0.57    fresh15(true2, true2, f11(f4(c36), c34), f16(f11(f4(c36), c34), f9(f17(c31))))
% 0.20/0.57  = { by axiom 6 (p2_30) }
% 0.20/0.57    true2
% 0.20/0.57  % SZS output end Proof
% 0.20/0.57  
% 0.20/0.57  RESULT: Unsatisfiable (the axioms are contradictory).
%------------------------------------------------------------------------------