TSTP Solution File: SYN226-1 by Twee---2.4.2
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Twee---2.4.2
% Problem : SYN226-1 : TPTP v8.1.2. Released v1.1.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 : n008.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:33:40 EDT 2023
% Result : Unsatisfiable 13.12s 2.08s
% Output : Proof 13.57s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SYN226-1 : TPTP v8.1.2. Released v1.1.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.12/0.34 % Computer : n008.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Sat Aug 26 20:28:47 EDT 2023
% 0.12/0.34 % CPUTime :
% 13.12/2.08 Command-line arguments: --ground-connectedness --complete-subsets
% 13.12/2.08
% 13.12/2.08 % SZS status Unsatisfiable
% 13.12/2.08
% 13.57/2.09 % SZS output start Proof
% 13.57/2.09 Take the following subset of the input axioms:
% 13.57/2.09 fof(axiom_14, axiom, ![X]: p0(b, X)).
% 13.57/2.09 fof(axiom_15, axiom, n0(a, b)).
% 13.57/2.09 fof(prove_this, negated_conjecture, ~l3(b, b)).
% 13.57/2.09 fof(rule_001, axiom, ![I, J]: (k1(I) | ~n0(J, I))).
% 13.57/2.09 fof(rule_069, axiom, ![C, B]: (p1(B, B, C) | ~p0(C, B))).
% 13.57/2.09 fof(rule_136, axiom, m2(b) | ~k1(b)).
% 13.57/2.09 fof(rule_137, axiom, ![A2, C2, B2]: (n2(A2) | ~p1(B2, C2, A2))).
% 13.57/2.09 fof(rule_217, axiom, ![C2]: (l3(C2, C2) | (~n2(C2) | ~m2(b)))).
% 13.57/2.09
% 13.57/2.09 Now clausify the problem and encode Horn clauses using encoding 3 of
% 13.57/2.09 http://www.cse.chalmers.se/~nicsma/papers/horn.pdf.
% 13.57/2.09 We repeatedly replace C & s=t => u=v by the two clauses:
% 13.57/2.09 fresh(y, y, x1...xn) = u
% 13.57/2.09 C => fresh(s, t, x1...xn) = v
% 13.57/2.09 where fresh is a fresh function symbol and x1..xn are the free
% 13.57/2.09 variables of u and v.
% 13.57/2.09 A predicate p(X) is encoded as p(X)=true (this is sound, because the
% 13.57/2.09 input problem has no model of domain size 1).
% 13.57/2.09
% 13.57/2.09 The encoding turns the above axioms into the following unit equations and goals:
% 13.57/2.09
% 13.57/2.09 Axiom 1 (rule_136): fresh263(X, X) = true.
% 13.57/2.09 Axiom 2 (axiom_15): n0(a, b) = true.
% 13.57/2.09 Axiom 3 (axiom_14): p0(b, X) = true.
% 13.57/2.09 Axiom 4 (rule_001): fresh440(X, X, Y) = true.
% 13.57/2.09 Axiom 5 (rule_136): fresh263(k1(b), true) = m2(b).
% 13.57/2.09 Axiom 6 (rule_137): fresh262(X, X, Y) = true.
% 13.57/2.09 Axiom 7 (rule_217): fresh156(X, X, Y) = l3(Y, Y).
% 13.57/2.09 Axiom 8 (rule_217): fresh155(X, X, Y) = true.
% 13.57/2.09 Axiom 9 (rule_069): fresh349(X, X, Y, Z) = true.
% 13.57/2.09 Axiom 10 (rule_217): fresh156(n2(X), true, X) = fresh155(m2(b), true, X).
% 13.57/2.09 Axiom 11 (rule_001): fresh440(n0(X, Y), true, Y) = k1(Y).
% 13.57/2.09 Axiom 12 (rule_069): fresh349(p0(X, Y), true, Y, X) = p1(Y, Y, X).
% 13.57/2.09 Axiom 13 (rule_137): fresh262(p1(X, Y, Z), true, Z) = n2(Z).
% 13.57/2.09
% 13.57/2.09 Goal 1 (prove_this): l3(b, b) = true.
% 13.57/2.09 Proof:
% 13.57/2.09 l3(b, b)
% 13.57/2.09 = { by axiom 7 (rule_217) R->L }
% 13.57/2.09 fresh156(true, true, b)
% 13.57/2.09 = { by axiom 6 (rule_137) R->L }
% 13.57/2.09 fresh156(fresh262(true, true, b), true, b)
% 13.57/2.09 = { by axiom 9 (rule_069) R->L }
% 13.57/2.09 fresh156(fresh262(fresh349(true, true, X, b), true, b), true, b)
% 13.57/2.09 = { by axiom 3 (axiom_14) R->L }
% 13.57/2.09 fresh156(fresh262(fresh349(p0(b, X), true, X, b), true, b), true, b)
% 13.57/2.09 = { by axiom 12 (rule_069) }
% 13.57/2.09 fresh156(fresh262(p1(X, X, b), true, b), true, b)
% 13.57/2.09 = { by axiom 13 (rule_137) }
% 13.57/2.09 fresh156(n2(b), true, b)
% 13.57/2.09 = { by axiom 10 (rule_217) }
% 13.57/2.09 fresh155(m2(b), true, b)
% 13.57/2.09 = { by axiom 5 (rule_136) R->L }
% 13.57/2.09 fresh155(fresh263(k1(b), true), true, b)
% 13.57/2.09 = { by axiom 11 (rule_001) R->L }
% 13.57/2.09 fresh155(fresh263(fresh440(n0(a, b), true, b), true), true, b)
% 13.57/2.09 = { by axiom 2 (axiom_15) }
% 13.57/2.09 fresh155(fresh263(fresh440(true, true, b), true), true, b)
% 13.57/2.09 = { by axiom 4 (rule_001) }
% 13.57/2.09 fresh155(fresh263(true, true), true, b)
% 13.57/2.09 = { by axiom 1 (rule_136) }
% 13.57/2.09 fresh155(true, true, b)
% 13.57/2.09 = { by axiom 8 (rule_217) }
% 13.57/2.09 true
% 13.57/2.09 % SZS output end Proof
% 13.57/2.09
% 13.57/2.09 RESULT: Unsatisfiable (the axioms are contradictory).
%------------------------------------------------------------------------------