TSTP Solution File: LCL075-1 by Twee---2.4.2
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Twee---2.4.2
% Problem : LCL075-1 : 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 : n032.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 08:17:17 EDT 2023
% Result : Unsatisfiable 0.12s 0.39s
% Output : Proof 0.12s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.08 % Problem : LCL075-1 : TPTP v8.1.2. Released v1.0.0.
% 0.00/0.09 % Command : parallel-twee %s --tstp --conditional-encoding if --smaller --drop-non-horn --give-up-on-saturation --explain-encoding --formal-proof
% 0.09/0.28 % Computer : n032.cluster.edu
% 0.09/0.28 % Model : x86_64 x86_64
% 0.09/0.28 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.28 % Memory : 8042.1875MB
% 0.09/0.28 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.28 % CPULimit : 300
% 0.09/0.28 % WCLimit : 300
% 0.09/0.28 % DateTime : Fri Aug 25 00:06:27 EDT 2023
% 0.09/0.28 % CPUTime :
% 0.12/0.39 Command-line arguments: --no-flatten-goal
% 0.12/0.39
% 0.12/0.39 % SZS status Unsatisfiable
% 0.12/0.39
% 0.12/0.40 % SZS output start Proof
% 0.12/0.40 Take the following subset of the input axioms:
% 0.12/0.40 fof(cn_CAMerideth, axiom, ![X, Y, Z, U, V]: is_a_theorem(implies(implies(implies(implies(implies(X, Y), implies(not(Z), not(U))), Z), V), implies(implies(V, X), implies(U, X))))).
% 0.12/0.40 fof(condensed_detachment, axiom, ![X2, Y2]: (~is_a_theorem(implies(X2, Y2)) | (~is_a_theorem(X2) | is_a_theorem(Y2)))).
% 0.12/0.40 fof(prove_cn_3, negated_conjecture, ~is_a_theorem(implies(a, implies(not(a), b)))).
% 0.12/0.40
% 0.12/0.40 Now clausify the problem and encode Horn clauses using encoding 3 of
% 0.12/0.40 http://www.cse.chalmers.se/~nicsma/papers/horn.pdf.
% 0.12/0.40 We repeatedly replace C & s=t => u=v by the two clauses:
% 0.12/0.40 fresh(y, y, x1...xn) = u
% 0.12/0.40 C => fresh(s, t, x1...xn) = v
% 0.12/0.40 where fresh is a fresh function symbol and x1..xn are the free
% 0.12/0.40 variables of u and v.
% 0.12/0.40 A predicate p(X) is encoded as p(X)=true (this is sound, because the
% 0.12/0.40 input problem has no model of domain size 1).
% 0.12/0.40
% 0.12/0.40 The encoding turns the above axioms into the following unit equations and goals:
% 0.12/0.40
% 0.12/0.40 Axiom 1 (condensed_detachment): fresh2(X, X, Y) = true.
% 0.12/0.40 Axiom 2 (condensed_detachment): fresh(X, X, Y, Z) = is_a_theorem(Z).
% 0.12/0.40 Axiom 3 (condensed_detachment): fresh(is_a_theorem(implies(X, Y)), true, X, Y) = fresh2(is_a_theorem(X), true, Y).
% 0.12/0.40 Axiom 4 (cn_CAMerideth): is_a_theorem(implies(implies(implies(implies(implies(X, Y), implies(not(Z), not(W))), Z), V), implies(implies(V, X), implies(W, X)))) = true.
% 0.12/0.40
% 0.12/0.40 Lemma 5: fresh2(is_a_theorem(implies(implies(implies(implies(X, Y), implies(not(Z), not(W))), Z), V)), true, implies(implies(V, X), implies(W, X))) = is_a_theorem(implies(implies(V, X), implies(W, X))).
% 0.12/0.40 Proof:
% 0.12/0.40 fresh2(is_a_theorem(implies(implies(implies(implies(X, Y), implies(not(Z), not(W))), Z), V)), true, implies(implies(V, X), implies(W, X)))
% 0.12/0.40 = { by axiom 3 (condensed_detachment) R->L }
% 0.12/0.40 fresh(is_a_theorem(implies(implies(implies(implies(implies(X, Y), implies(not(Z), not(W))), Z), V), implies(implies(V, X), implies(W, X)))), true, implies(implies(implies(implies(X, Y), implies(not(Z), not(W))), Z), V), implies(implies(V, X), implies(W, X)))
% 0.12/0.40 = { by axiom 4 (cn_CAMerideth) }
% 0.12/0.40 fresh(true, true, implies(implies(implies(implies(X, Y), implies(not(Z), not(W))), Z), V), implies(implies(V, X), implies(W, X)))
% 0.12/0.40 = { by axiom 2 (condensed_detachment) }
% 0.12/0.40 is_a_theorem(implies(implies(V, X), implies(W, X)))
% 0.12/0.40
% 0.12/0.40 Lemma 6: is_a_theorem(implies(implies(implies(X, X), Y), implies(Z, Y))) = true.
% 0.12/0.40 Proof:
% 0.12/0.40 is_a_theorem(implies(implies(implies(X, X), Y), implies(Z, Y)))
% 0.12/0.40 = { by lemma 5 R->L }
% 0.12/0.40 fresh2(is_a_theorem(implies(implies(implies(implies(Y, W), implies(not(X), not(Z))), X), implies(X, X))), true, implies(implies(implies(X, X), Y), implies(Z, Y)))
% 0.12/0.40 = { by lemma 5 R->L }
% 0.12/0.40 fresh2(fresh2(is_a_theorem(implies(implies(implies(implies(X, not(X)), implies(not(implies(not(X), not(Z))), not(X))), implies(not(X), not(Z))), implies(implies(Y, W), implies(not(X), not(Z))))), true, implies(implies(implies(implies(Y, W), implies(not(X), not(Z))), X), implies(X, X))), true, implies(implies(implies(X, X), Y), implies(Z, Y)))
% 0.12/0.40 = { by lemma 5 R->L }
% 0.12/0.40 fresh2(fresh2(fresh2(is_a_theorem(implies(implies(implies(implies(implies(not(X), not(Z)), implies(not(implies(not(X), not(implies(Y, W)))), not(not(implies(not(X), not(Z)))))), implies(not(X), not(implies(Y, W)))), X), implies(implies(X, not(X)), implies(not(implies(not(X), not(Z))), not(X))))), true, implies(implies(implies(implies(X, not(X)), implies(not(implies(not(X), not(Z))), not(X))), implies(not(X), not(Z))), implies(implies(Y, W), implies(not(X), not(Z))))), true, implies(implies(implies(implies(Y, W), implies(not(X), not(Z))), X), implies(X, X))), true, implies(implies(implies(X, X), Y), implies(Z, Y)))
% 0.12/0.40 = { by axiom 4 (cn_CAMerideth) }
% 0.12/0.40 fresh2(fresh2(fresh2(true, true, implies(implies(implies(implies(X, not(X)), implies(not(implies(not(X), not(Z))), not(X))), implies(not(X), not(Z))), implies(implies(Y, W), implies(not(X), not(Z))))), true, implies(implies(implies(implies(Y, W), implies(not(X), not(Z))), X), implies(X, X))), true, implies(implies(implies(X, X), Y), implies(Z, Y)))
% 0.12/0.40 = { by axiom 1 (condensed_detachment) }
% 0.12/0.40 fresh2(fresh2(true, true, implies(implies(implies(implies(Y, W), implies(not(X), not(Z))), X), implies(X, X))), true, implies(implies(implies(X, X), Y), implies(Z, Y)))
% 0.12/0.40 = { by axiom 1 (condensed_detachment) }
% 0.12/0.40 fresh2(true, true, implies(implies(implies(X, X), Y), implies(Z, Y)))
% 0.12/0.40 = { by axiom 1 (condensed_detachment) }
% 0.12/0.40 true
% 0.12/0.40
% 0.12/0.40 Lemma 7: is_a_theorem(implies(implies(implies(X, Y), Z), implies(Y, Z))) = true.
% 0.12/0.40 Proof:
% 0.12/0.40 is_a_theorem(implies(implies(implies(X, Y), Z), implies(Y, Z)))
% 0.12/0.40 = { by lemma 5 R->L }
% 0.12/0.40 fresh2(is_a_theorem(implies(implies(implies(implies(Z, W), implies(not(Y), not(Y))), Y), implies(X, Y))), true, implies(implies(implies(X, Y), Z), implies(Y, Z)))
% 0.12/0.40 = { by lemma 5 R->L }
% 0.12/0.40 fresh2(fresh2(is_a_theorem(implies(implies(implies(implies(Y, V), implies(not(U), not(X))), U), implies(implies(Z, W), implies(not(Y), not(Y))))), true, implies(implies(implies(implies(Z, W), implies(not(Y), not(Y))), Y), implies(X, Y))), true, implies(implies(implies(X, Y), Z), implies(Y, Z)))
% 0.12/0.40 = { by axiom 2 (condensed_detachment) R->L }
% 0.12/0.40 fresh2(fresh2(fresh(true, true, implies(implies(implies(not(Y), not(Y)), implies(not(Y), not(Y))), implies(implies(Z, W), implies(not(Y), not(Y)))), implies(implies(implies(implies(Y, V), implies(not(U), not(X))), U), implies(implies(Z, W), implies(not(Y), not(Y))))), true, implies(implies(implies(implies(Z, W), implies(not(Y), not(Y))), Y), implies(X, Y))), true, implies(implies(implies(X, Y), Z), implies(Y, Z)))
% 0.12/0.40 = { by lemma 6 R->L }
% 0.12/0.40 fresh2(fresh2(fresh(is_a_theorem(implies(implies(implies(implies(not(Y), not(Y)), implies(not(Y), not(Y))), implies(implies(Z, W), implies(not(Y), not(Y)))), implies(implies(implies(implies(Y, V), implies(not(U), not(X))), U), implies(implies(Z, W), implies(not(Y), not(Y)))))), true, implies(implies(implies(not(Y), not(Y)), implies(not(Y), not(Y))), implies(implies(Z, W), implies(not(Y), not(Y)))), implies(implies(implies(implies(Y, V), implies(not(U), not(X))), U), implies(implies(Z, W), implies(not(Y), not(Y))))), true, implies(implies(implies(implies(Z, W), implies(not(Y), not(Y))), Y), implies(X, Y))), true, implies(implies(implies(X, Y), Z), implies(Y, Z)))
% 0.12/0.40 = { by axiom 3 (condensed_detachment) }
% 0.12/0.40 fresh2(fresh2(fresh2(is_a_theorem(implies(implies(implies(not(Y), not(Y)), implies(not(Y), not(Y))), implies(implies(Z, W), implies(not(Y), not(Y))))), true, implies(implies(implies(implies(Y, V), implies(not(U), not(X))), U), implies(implies(Z, W), implies(not(Y), not(Y))))), true, implies(implies(implies(implies(Z, W), implies(not(Y), not(Y))), Y), implies(X, Y))), true, implies(implies(implies(X, Y), Z), implies(Y, Z)))
% 0.12/0.40 = { by lemma 6 }
% 0.12/0.40 fresh2(fresh2(fresh2(true, true, implies(implies(implies(implies(Y, V), implies(not(U), not(X))), U), implies(implies(Z, W), implies(not(Y), not(Y))))), true, implies(implies(implies(implies(Z, W), implies(not(Y), not(Y))), Y), implies(X, Y))), true, implies(implies(implies(X, Y), Z), implies(Y, Z)))
% 0.12/0.40 = { by axiom 1 (condensed_detachment) }
% 0.12/0.40 fresh2(fresh2(true, true, implies(implies(implies(implies(Z, W), implies(not(Y), not(Y))), Y), implies(X, Y))), true, implies(implies(implies(X, Y), Z), implies(Y, Z)))
% 0.12/0.40 = { by axiom 1 (condensed_detachment) }
% 0.12/0.40 fresh2(true, true, implies(implies(implies(X, Y), Z), implies(Y, Z)))
% 0.12/0.40 = { by axiom 1 (condensed_detachment) }
% 0.12/0.40 true
% 0.12/0.40
% 0.12/0.40 Goal 1 (prove_cn_3): is_a_theorem(implies(a, implies(not(a), b))) = true.
% 0.12/0.40 Proof:
% 0.12/0.40 is_a_theorem(implies(a, implies(not(a), b)))
% 0.12/0.40 = { by axiom 2 (condensed_detachment) R->L }
% 0.12/0.40 fresh(true, true, implies(implies(implies(not(b), not(a)), b), implies(not(a), b)), implies(a, implies(not(a), b)))
% 0.12/0.40 = { by axiom 1 (condensed_detachment) R->L }
% 0.12/0.40 fresh(fresh2(true, true, implies(implies(implies(implies(not(b), not(a)), b), implies(not(a), b)), implies(a, implies(not(a), b)))), true, implies(implies(implies(not(b), not(a)), b), implies(not(a), b)), implies(a, implies(not(a), b)))
% 0.12/0.40 = { by lemma 7 R->L }
% 0.12/0.40 fresh(fresh2(is_a_theorem(implies(implies(implies(implies(implies(not(a), b), X), implies(not(b), not(a))), b), implies(implies(not(b), not(a)), b))), true, implies(implies(implies(implies(not(b), not(a)), b), implies(not(a), b)), implies(a, implies(not(a), b)))), true, implies(implies(implies(not(b), not(a)), b), implies(not(a), b)), implies(a, implies(not(a), b)))
% 0.12/0.40 = { by lemma 5 }
% 0.12/0.40 fresh(is_a_theorem(implies(implies(implies(implies(not(b), not(a)), b), implies(not(a), b)), implies(a, implies(not(a), b)))), true, implies(implies(implies(not(b), not(a)), b), implies(not(a), b)), implies(a, implies(not(a), b)))
% 0.12/0.40 = { by axiom 3 (condensed_detachment) }
% 0.12/0.40 fresh2(is_a_theorem(implies(implies(implies(not(b), not(a)), b), implies(not(a), b))), true, implies(a, implies(not(a), b)))
% 0.12/0.40 = { by lemma 7 }
% 0.12/0.40 fresh2(true, true, implies(a, implies(not(a), b)))
% 0.12/0.40 = { by axiom 1 (condensed_detachment) }
% 0.12/0.40 true
% 0.12/0.40 % SZS output end Proof
% 0.12/0.40
% 0.12/0.40 RESULT: Unsatisfiable (the axioms are contradictory).
%------------------------------------------------------------------------------