TSTP Solution File: SYN003-1.006 by Twee---2.4.2
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Twee---2.4.2
% Problem : SYN003-1.006 : 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 : n019.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:32:41 EDT 2023
% Result : Unsatisfiable 0.13s 0.39s
% Output : Proof 0.13s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SYN003-1.006 : TPTP v8.1.2. Released v1.0.0.
% 0.13/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 : n019.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 : Sat Aug 26 17:03:58 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.13/0.39 Command-line arguments: --lhs-weight 1 --flip-ordering --normalise-queue-percent 10 --cp-renormalise-threshold 10
% 0.13/0.39
% 0.13/0.39 % SZS status Unsatisfiable
% 0.13/0.39
% 0.13/0.40 % SZS output start Proof
% 0.13/0.40 Take the following subset of the input axioms:
% 0.13/0.40 fof(base_1, negated_conjecture, p_1).
% 0.13/0.40 fof(base_2, negated_conjecture, ~p_6).
% 0.13/0.40 fof(base_3, negated_conjecture, q).
% 0.13/0.40 fof(pqp_1, negated_conjecture, ~p_1 | (~q_1 | p_2)).
% 0.13/0.41 fof(pqp_2, negated_conjecture, ~p_2 | (~q_2 | p_3)).
% 0.13/0.41 fof(pqp_3, negated_conjecture, ~p_3 | (~q_3 | p_4)).
% 0.13/0.41 fof(pqp_4, negated_conjecture, ~p_4 | (~q_4 | p_5)).
% 0.13/0.41 fof(pqp_5, negated_conjecture, ~p_5 | (~q_5 | p_6)).
% 0.13/0.41 fof(qq_1, negated_conjecture, ~q | q_1).
% 0.13/0.41 fof(qq_2, negated_conjecture, ~q | q_2).
% 0.13/0.41 fof(qq_3, negated_conjecture, ~q | q_3).
% 0.13/0.41 fof(qq_4, negated_conjecture, ~q | q_4).
% 0.13/0.41 fof(qq_5, negated_conjecture, ~q | q_5).
% 0.13/0.41
% 0.13/0.41 Now clausify the problem and encode Horn clauses using encoding 3 of
% 0.13/0.41 http://www.cse.chalmers.se/~nicsma/papers/horn.pdf.
% 0.13/0.41 We repeatedly replace C & s=t => u=v by the two clauses:
% 0.13/0.41 fresh(y, y, x1...xn) = u
% 0.13/0.41 C => fresh(s, t, x1...xn) = v
% 0.13/0.41 where fresh is a fresh function symbol and x1..xn are the free
% 0.13/0.41 variables of u and v.
% 0.13/0.41 A predicate p(X) is encoded as p(X)=true (this is sound, because the
% 0.13/0.41 input problem has no model of domain size 1).
% 0.13/0.41
% 0.13/0.42 The encoding turns the above axioms into the following unit equations and goals:
% 0.13/0.42
% 0.13/0.42 Axiom 1 (base_3): q = true.
% 0.13/0.42 Axiom 2 (base_1): p_1 = true.
% 0.13/0.42 Axiom 3 (pqp_1): fresh30(X, X) = true.
% 0.13/0.42 Axiom 4 (pqp_1): fresh29(X, X) = p_2.
% 0.13/0.42 Axiom 5 (pqp_1): fresh29(q_1, true) = fresh30(p_1, true).
% 0.13/0.42 Axiom 6 (pqp_2): fresh28(X, X) = p_3.
% 0.13/0.42 Axiom 7 (pqp_2): fresh27(X, X) = true.
% 0.13/0.42 Axiom 8 (pqp_2): fresh28(q_2, true) = fresh27(p_2, true).
% 0.13/0.42 Axiom 9 (pqp_3): fresh26(X, X) = p_4.
% 0.13/0.42 Axiom 10 (pqp_3): fresh25(X, X) = true.
% 0.13/0.42 Axiom 11 (pqp_3): fresh26(q_3, true) = fresh25(p_3, true).
% 0.13/0.42 Axiom 12 (pqp_4): fresh24(X, X) = p_5.
% 0.13/0.42 Axiom 13 (pqp_4): fresh23(X, X) = true.
% 0.13/0.42 Axiom 14 (pqp_4): fresh24(q_4, true) = fresh23(p_4, true).
% 0.13/0.42 Axiom 15 (pqp_5): fresh22(X, X) = p_6.
% 0.13/0.42 Axiom 16 (pqp_5): fresh21(X, X) = true.
% 0.13/0.42 Axiom 17 (pqp_5): fresh22(q_5, true) = fresh21(p_5, true).
% 0.13/0.42 Axiom 18 (qq_1): fresh10(X, X) = true.
% 0.13/0.42 Axiom 19 (qq_1): fresh10(q, true) = q_1.
% 0.13/0.42 Axiom 20 (qq_2): fresh9(X, X) = true.
% 0.13/0.42 Axiom 21 (qq_2): fresh9(q, true) = q_2.
% 0.13/0.42 Axiom 22 (qq_3): fresh8(X, X) = true.
% 0.13/0.42 Axiom 23 (qq_3): fresh8(q, true) = q_3.
% 0.13/0.42 Axiom 24 (qq_4): fresh7(X, X) = true.
% 0.13/0.42 Axiom 25 (qq_4): fresh7(q, true) = q_4.
% 0.13/0.42 Axiom 26 (qq_5): fresh6(X, X) = true.
% 0.13/0.42 Axiom 27 (qq_5): fresh6(q, true) = q_5.
% 0.13/0.42
% 0.13/0.42 Goal 1 (base_2): p_6 = true.
% 0.13/0.42 Proof:
% 0.13/0.42 p_6
% 0.13/0.42 = { by axiom 15 (pqp_5) R->L }
% 0.13/0.42 fresh22(true, true)
% 0.13/0.42 = { by axiom 26 (qq_5) R->L }
% 0.13/0.42 fresh22(fresh6(true, true), true)
% 0.13/0.42 = { by axiom 1 (base_3) R->L }
% 0.13/0.42 fresh22(fresh6(q, true), true)
% 0.13/0.42 = { by axiom 27 (qq_5) }
% 0.13/0.42 fresh22(q_5, true)
% 0.13/0.42 = { by axiom 17 (pqp_5) }
% 0.13/0.42 fresh21(p_5, true)
% 0.13/0.42 = { by axiom 12 (pqp_4) R->L }
% 0.13/0.42 fresh21(fresh24(true, true), true)
% 0.13/0.42 = { by axiom 24 (qq_4) R->L }
% 0.13/0.42 fresh21(fresh24(fresh7(true, true), true), true)
% 0.13/0.42 = { by axiom 1 (base_3) R->L }
% 0.13/0.42 fresh21(fresh24(fresh7(q, true), true), true)
% 0.13/0.42 = { by axiom 25 (qq_4) }
% 0.13/0.42 fresh21(fresh24(q_4, true), true)
% 0.13/0.42 = { by axiom 14 (pqp_4) }
% 0.13/0.42 fresh21(fresh23(p_4, true), true)
% 0.13/0.42 = { by axiom 9 (pqp_3) R->L }
% 0.13/0.42 fresh21(fresh23(fresh26(true, true), true), true)
% 0.13/0.42 = { by axiom 22 (qq_3) R->L }
% 0.13/0.42 fresh21(fresh23(fresh26(fresh8(true, true), true), true), true)
% 0.13/0.42 = { by axiom 1 (base_3) R->L }
% 0.13/0.42 fresh21(fresh23(fresh26(fresh8(q, true), true), true), true)
% 0.13/0.42 = { by axiom 23 (qq_3) }
% 0.13/0.42 fresh21(fresh23(fresh26(q_3, true), true), true)
% 0.13/0.42 = { by axiom 11 (pqp_3) }
% 0.13/0.42 fresh21(fresh23(fresh25(p_3, true), true), true)
% 0.13/0.42 = { by axiom 6 (pqp_2) R->L }
% 0.13/0.42 fresh21(fresh23(fresh25(fresh28(true, true), true), true), true)
% 0.13/0.42 = { by axiom 20 (qq_2) R->L }
% 0.13/0.42 fresh21(fresh23(fresh25(fresh28(fresh9(true, true), true), true), true), true)
% 0.13/0.42 = { by axiom 1 (base_3) R->L }
% 0.13/0.42 fresh21(fresh23(fresh25(fresh28(fresh9(q, true), true), true), true), true)
% 0.13/0.42 = { by axiom 21 (qq_2) }
% 0.13/0.42 fresh21(fresh23(fresh25(fresh28(q_2, true), true), true), true)
% 0.13/0.42 = { by axiom 8 (pqp_2) }
% 0.13/0.42 fresh21(fresh23(fresh25(fresh27(p_2, true), true), true), true)
% 0.13/0.42 = { by axiom 4 (pqp_1) R->L }
% 0.13/0.42 fresh21(fresh23(fresh25(fresh27(fresh29(true, true), true), true), true), true)
% 0.13/0.42 = { by axiom 18 (qq_1) R->L }
% 0.13/0.42 fresh21(fresh23(fresh25(fresh27(fresh29(fresh10(true, true), true), true), true), true), true)
% 0.13/0.42 = { by axiom 1 (base_3) R->L }
% 0.13/0.42 fresh21(fresh23(fresh25(fresh27(fresh29(fresh10(q, true), true), true), true), true), true)
% 0.13/0.42 = { by axiom 19 (qq_1) }
% 0.13/0.42 fresh21(fresh23(fresh25(fresh27(fresh29(q_1, true), true), true), true), true)
% 0.13/0.42 = { by axiom 5 (pqp_1) }
% 0.13/0.42 fresh21(fresh23(fresh25(fresh27(fresh30(p_1, true), true), true), true), true)
% 0.13/0.42 = { by axiom 2 (base_1) }
% 0.13/0.42 fresh21(fresh23(fresh25(fresh27(fresh30(true, true), true), true), true), true)
% 0.13/0.42 = { by axiom 3 (pqp_1) }
% 0.13/0.42 fresh21(fresh23(fresh25(fresh27(true, true), true), true), true)
% 0.13/0.42 = { by axiom 7 (pqp_2) }
% 0.13/0.42 fresh21(fresh23(fresh25(true, true), true), true)
% 0.13/0.42 = { by axiom 10 (pqp_3) }
% 0.13/0.42 fresh21(fresh23(true, true), true)
% 0.13/0.42 = { by axiom 13 (pqp_4) }
% 0.13/0.42 fresh21(true, true)
% 0.13/0.42 = { by axiom 16 (pqp_5) }
% 0.13/0.42 true
% 0.13/0.42 % SZS output end Proof
% 0.13/0.42
% 0.13/0.42 RESULT: Unsatisfiable (the axioms are contradictory).
%------------------------------------------------------------------------------