TSTP Solution File: LCL013-1 by Twee---2.4.2
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Twee---2.4.2
% Problem : LCL013-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 : n026.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:02 EDT 2023
% Result : Unsatisfiable 0.12s 0.38s
% Output : Proof 0.19s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : LCL013-1 : TPTP v8.1.2. Released v1.0.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 : n026.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 : Fri Aug 25 02:18:17 EDT 2023
% 0.12/0.34 % CPUTime :
% 0.12/0.38 Command-line arguments: --no-flatten-goal
% 0.12/0.38
% 0.12/0.38 % SZS status Unsatisfiable
% 0.12/0.38
% 0.12/0.38 % SZS output start Proof
% 0.12/0.38 Take the following subset of the input axioms:
% 0.12/0.38 fof(condensed_detachment, axiom, ![X, Y]: (~is_a_theorem(equivalent(X, Y)) | (~is_a_theorem(X) | is_a_theorem(Y)))).
% 0.12/0.38 fof(prove_um, negated_conjecture, ~is_a_theorem(equivalent(equivalent(equivalent(a, b), c), equivalent(b, equivalent(c, a))))).
% 0.12/0.38 fof(xgf, axiom, ![Z, X2, Y2]: is_a_theorem(equivalent(X2, equivalent(equivalent(Y2, equivalent(X2, Z)), equivalent(Z, Y2))))).
% 0.12/0.38
% 0.12/0.38 Now clausify the problem and encode Horn clauses using encoding 3 of
% 0.12/0.38 http://www.cse.chalmers.se/~nicsma/papers/horn.pdf.
% 0.12/0.38 We repeatedly replace C & s=t => u=v by the two clauses:
% 0.12/0.38 fresh(y, y, x1...xn) = u
% 0.12/0.38 C => fresh(s, t, x1...xn) = v
% 0.12/0.38 where fresh is a fresh function symbol and x1..xn are the free
% 0.12/0.38 variables of u and v.
% 0.12/0.38 A predicate p(X) is encoded as p(X)=true (this is sound, because the
% 0.12/0.38 input problem has no model of domain size 1).
% 0.12/0.38
% 0.12/0.38 The encoding turns the above axioms into the following unit equations and goals:
% 0.12/0.38
% 0.12/0.38 Axiom 1 (condensed_detachment): fresh2(X, X, Y) = true.
% 0.12/0.38 Axiom 2 (condensed_detachment): fresh(X, X, Y, Z) = is_a_theorem(Z).
% 0.12/0.38 Axiom 3 (condensed_detachment): fresh(is_a_theorem(equivalent(X, Y)), true, X, Y) = fresh2(is_a_theorem(X), true, Y).
% 0.19/0.38 Axiom 4 (xgf): is_a_theorem(equivalent(X, equivalent(equivalent(Y, equivalent(X, Z)), equivalent(Z, Y)))) = true.
% 0.19/0.38
% 0.19/0.38 Goal 1 (prove_um): is_a_theorem(equivalent(equivalent(equivalent(a, b), c), equivalent(b, equivalent(c, a)))) = true.
% 0.19/0.38 Proof:
% 0.19/0.38 is_a_theorem(equivalent(equivalent(equivalent(a, b), c), equivalent(b, equivalent(c, a))))
% 0.19/0.38 = { by axiom 2 (condensed_detachment) R->L }
% 0.19/0.38 fresh(true, true, equivalent(equivalent(b, equivalent(c, a)), equivalent(equivalent(c, equivalent(equivalent(b, equivalent(c, a)), equivalent(a, b))), equivalent(equivalent(a, b), c))), equivalent(equivalent(equivalent(a, b), c), equivalent(b, equivalent(c, a))))
% 0.19/0.38 = { by axiom 1 (condensed_detachment) R->L }
% 0.19/0.38 fresh(fresh2(true, true, equivalent(equivalent(equivalent(b, equivalent(c, a)), equivalent(equivalent(c, equivalent(equivalent(b, equivalent(c, a)), equivalent(a, b))), equivalent(equivalent(a, b), c))), equivalent(equivalent(equivalent(a, b), c), equivalent(b, equivalent(c, a))))), true, equivalent(equivalent(b, equivalent(c, a)), equivalent(equivalent(c, equivalent(equivalent(b, equivalent(c, a)), equivalent(a, b))), equivalent(equivalent(a, b), c))), equivalent(equivalent(equivalent(a, b), c), equivalent(b, equivalent(c, a))))
% 0.19/0.38 = { by axiom 4 (xgf) R->L }
% 0.19/0.38 fresh(fresh2(is_a_theorem(equivalent(c, equivalent(equivalent(b, equivalent(c, a)), equivalent(a, b)))), true, equivalent(equivalent(equivalent(b, equivalent(c, a)), equivalent(equivalent(c, equivalent(equivalent(b, equivalent(c, a)), equivalent(a, b))), equivalent(equivalent(a, b), c))), equivalent(equivalent(equivalent(a, b), c), equivalent(b, equivalent(c, a))))), true, equivalent(equivalent(b, equivalent(c, a)), equivalent(equivalent(c, equivalent(equivalent(b, equivalent(c, a)), equivalent(a, b))), equivalent(equivalent(a, b), c))), equivalent(equivalent(equivalent(a, b), c), equivalent(b, equivalent(c, a))))
% 0.19/0.38 = { by axiom 3 (condensed_detachment) R->L }
% 0.19/0.39 fresh(fresh(is_a_theorem(equivalent(equivalent(c, equivalent(equivalent(b, equivalent(c, a)), equivalent(a, b))), equivalent(equivalent(equivalent(b, equivalent(c, a)), equivalent(equivalent(c, equivalent(equivalent(b, equivalent(c, a)), equivalent(a, b))), equivalent(equivalent(a, b), c))), equivalent(equivalent(equivalent(a, b), c), equivalent(b, equivalent(c, a)))))), true, equivalent(c, equivalent(equivalent(b, equivalent(c, a)), equivalent(a, b))), equivalent(equivalent(equivalent(b, equivalent(c, a)), equivalent(equivalent(c, equivalent(equivalent(b, equivalent(c, a)), equivalent(a, b))), equivalent(equivalent(a, b), c))), equivalent(equivalent(equivalent(a, b), c), equivalent(b, equivalent(c, a))))), true, equivalent(equivalent(b, equivalent(c, a)), equivalent(equivalent(c, equivalent(equivalent(b, equivalent(c, a)), equivalent(a, b))), equivalent(equivalent(a, b), c))), equivalent(equivalent(equivalent(a, b), c), equivalent(b, equivalent(c, a))))
% 0.19/0.39 = { by axiom 4 (xgf) }
% 0.19/0.39 fresh(fresh(true, true, equivalent(c, equivalent(equivalent(b, equivalent(c, a)), equivalent(a, b))), equivalent(equivalent(equivalent(b, equivalent(c, a)), equivalent(equivalent(c, equivalent(equivalent(b, equivalent(c, a)), equivalent(a, b))), equivalent(equivalent(a, b), c))), equivalent(equivalent(equivalent(a, b), c), equivalent(b, equivalent(c, a))))), true, equivalent(equivalent(b, equivalent(c, a)), equivalent(equivalent(c, equivalent(equivalent(b, equivalent(c, a)), equivalent(a, b))), equivalent(equivalent(a, b), c))), equivalent(equivalent(equivalent(a, b), c), equivalent(b, equivalent(c, a))))
% 0.19/0.39 = { by axiom 2 (condensed_detachment) }
% 0.19/0.39 fresh(is_a_theorem(equivalent(equivalent(equivalent(b, equivalent(c, a)), equivalent(equivalent(c, equivalent(equivalent(b, equivalent(c, a)), equivalent(a, b))), equivalent(equivalent(a, b), c))), equivalent(equivalent(equivalent(a, b), c), equivalent(b, equivalent(c, a))))), true, equivalent(equivalent(b, equivalent(c, a)), equivalent(equivalent(c, equivalent(equivalent(b, equivalent(c, a)), equivalent(a, b))), equivalent(equivalent(a, b), c))), equivalent(equivalent(equivalent(a, b), c), equivalent(b, equivalent(c, a))))
% 0.19/0.39 = { by axiom 3 (condensed_detachment) }
% 0.19/0.39 fresh2(is_a_theorem(equivalent(equivalent(b, equivalent(c, a)), equivalent(equivalent(c, equivalent(equivalent(b, equivalent(c, a)), equivalent(a, b))), equivalent(equivalent(a, b), c)))), true, equivalent(equivalent(equivalent(a, b), c), equivalent(b, equivalent(c, a))))
% 0.19/0.39 = { by axiom 4 (xgf) }
% 0.19/0.39 fresh2(true, true, equivalent(equivalent(equivalent(a, b), c), equivalent(b, equivalent(c, a))))
% 0.19/0.39 = { by axiom 1 (condensed_detachment) }
% 0.19/0.39 true
% 0.19/0.39 % SZS output end Proof
% 0.19/0.39
% 0.19/0.39 RESULT: Unsatisfiable (the axioms are contradictory).
%------------------------------------------------------------------------------