TSTP Solution File: LCL321-3 by Twee---2.4.2
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Twee---2.4.2
% Problem : LCL321-3 : TPTP v8.1.2. Released v2.3.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 : n011.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:18:31 EDT 2023
% Result : Unsatisfiable 0.20s 0.49s
% Output : Proof 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : LCL321-3 : TPTP v8.1.2. Released v2.3.0.
% 0.12/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 : n011.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 : Fri Aug 25 01:16:52 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.20/0.49 Command-line arguments: --ground-connectedness --complete-subsets
% 0.20/0.49
% 0.20/0.49 % SZS status Unsatisfiable
% 0.20/0.49
% 0.20/0.50 % SZS output start Proof
% 0.20/0.50 Take the following subset of the input axioms:
% 0.20/0.50 fof(axiom_1_3, axiom, ![A, B]: axiom(implies(A, or(B, A)))).
% 0.20/0.50 fof(axiom_1_4, axiom, ![A2, B2]: axiom(implies(or(A2, B2), or(B2, A2)))).
% 0.20/0.50 fof(axiom_1_5, axiom, ![C, A2, B2]: axiom(implies(or(A2, or(B2, C)), or(B2, or(A2, C))))).
% 0.20/0.50 fof(implies_definition, axiom, ![X, Y]: implies(X, Y)=or(not(X), Y)).
% 0.20/0.50 fof(prove_this, negated_conjecture, ~theorem(or(implies(p, q), implies(p, not(q))))).
% 0.20/0.50 fof(rule_1, axiom, ![X2]: (theorem(X2) | ~axiom(X2))).
% 0.20/0.50 fof(rule_2, axiom, ![X2, Y2]: (theorem(X2) | (~theorem(implies(Y2, X2)) | ~theorem(Y2)))).
% 0.20/0.50
% 0.20/0.50 Now clausify the problem and encode Horn clauses using encoding 3 of
% 0.20/0.50 http://www.cse.chalmers.se/~nicsma/papers/horn.pdf.
% 0.20/0.50 We repeatedly replace C & s=t => u=v by the two clauses:
% 0.20/0.50 fresh(y, y, x1...xn) = u
% 0.20/0.50 C => fresh(s, t, x1...xn) = v
% 0.20/0.50 where fresh is a fresh function symbol and x1..xn are the free
% 0.20/0.50 variables of u and v.
% 0.20/0.50 A predicate p(X) is encoded as p(X)=true (this is sound, because the
% 0.20/0.50 input problem has no model of domain size 1).
% 0.20/0.50
% 0.20/0.50 The encoding turns the above axioms into the following unit equations and goals:
% 0.20/0.50
% 0.20/0.50 Axiom 1 (rule_2): fresh(X, X, Y) = true.
% 0.20/0.50 Axiom 2 (rule_1): fresh2(X, X, Y) = true.
% 0.20/0.50 Axiom 3 (implies_definition): implies(X, Y) = or(not(X), Y).
% 0.20/0.50 Axiom 4 (rule_2): fresh3(X, X, Y, Z) = theorem(Y).
% 0.20/0.50 Axiom 5 (rule_1): fresh2(axiom(X), true, X) = theorem(X).
% 0.20/0.50 Axiom 6 (axiom_1_3): axiom(implies(X, or(Y, X))) = true.
% 0.20/0.50 Axiom 7 (rule_2): fresh3(theorem(implies(X, Y)), true, Y, X) = fresh(theorem(X), true, Y).
% 0.20/0.50 Axiom 8 (axiom_1_4): axiom(implies(or(X, Y), or(Y, X))) = true.
% 0.20/0.50 Axiom 9 (axiom_1_5): axiom(implies(or(X, or(Y, Z)), or(Y, or(X, Z)))) = true.
% 0.20/0.50
% 0.20/0.50 Lemma 10: axiom(implies(X, implies(Y, X))) = true.
% 0.20/0.50 Proof:
% 0.20/0.50 axiom(implies(X, implies(Y, X)))
% 0.20/0.50 = { by axiom 3 (implies_definition) }
% 0.20/0.50 axiom(implies(X, or(not(Y), X)))
% 0.20/0.50 = { by axiom 6 (axiom_1_3) }
% 0.20/0.50 true
% 0.20/0.50
% 0.20/0.50 Goal 1 (prove_this): theorem(or(implies(p, q), implies(p, not(q)))) = true.
% 0.20/0.50 Proof:
% 0.20/0.50 theorem(or(implies(p, q), implies(p, not(q))))
% 0.20/0.50 = { by axiom 4 (rule_2) R->L }
% 0.20/0.50 fresh3(true, true, or(implies(p, q), implies(p, not(q))), implies(p, or(implies(p, q), not(q))))
% 0.20/0.50 = { by axiom 2 (rule_1) R->L }
% 0.20/0.50 fresh3(fresh2(true, true, implies(implies(p, or(implies(p, q), not(q))), or(implies(p, q), implies(p, not(q))))), true, or(implies(p, q), implies(p, not(q))), implies(p, or(implies(p, q), not(q))))
% 0.20/0.50 = { by axiom 9 (axiom_1_5) R->L }
% 0.20/0.50 fresh3(fresh2(axiom(implies(or(not(p), or(implies(p, q), not(q))), or(implies(p, q), or(not(p), not(q))))), true, implies(implies(p, or(implies(p, q), not(q))), or(implies(p, q), implies(p, not(q))))), true, or(implies(p, q), implies(p, not(q))), implies(p, or(implies(p, q), not(q))))
% 0.20/0.50 = { by axiom 3 (implies_definition) R->L }
% 0.20/0.50 fresh3(fresh2(axiom(implies(implies(p, or(implies(p, q), not(q))), or(implies(p, q), or(not(p), not(q))))), true, implies(implies(p, or(implies(p, q), not(q))), or(implies(p, q), implies(p, not(q))))), true, or(implies(p, q), implies(p, not(q))), implies(p, or(implies(p, q), not(q))))
% 0.20/0.50 = { by axiom 3 (implies_definition) R->L }
% 0.20/0.50 fresh3(fresh2(axiom(implies(implies(p, or(implies(p, q), not(q))), or(implies(p, q), implies(p, not(q))))), true, implies(implies(p, or(implies(p, q), not(q))), or(implies(p, q), implies(p, not(q))))), true, or(implies(p, q), implies(p, not(q))), implies(p, or(implies(p, q), not(q))))
% 0.20/0.50 = { by axiom 5 (rule_1) }
% 0.20/0.50 fresh3(theorem(implies(implies(p, or(implies(p, q), not(q))), or(implies(p, q), implies(p, not(q))))), true, or(implies(p, q), implies(p, not(q))), implies(p, or(implies(p, q), not(q))))
% 0.20/0.50 = { by axiom 7 (rule_2) }
% 0.20/0.50 fresh(theorem(implies(p, or(implies(p, q), not(q)))), true, or(implies(p, q), implies(p, not(q))))
% 0.20/0.50 = { by axiom 4 (rule_2) R->L }
% 0.20/0.50 fresh(fresh3(true, true, implies(p, or(implies(p, q), not(q))), or(implies(p, q), not(q))), true, or(implies(p, q), implies(p, not(q))))
% 0.20/0.50 = { by axiom 2 (rule_1) R->L }
% 0.20/0.50 fresh(fresh3(fresh2(true, true, implies(or(implies(p, q), not(q)), implies(p, or(implies(p, q), not(q))))), true, implies(p, or(implies(p, q), not(q))), or(implies(p, q), not(q))), true, or(implies(p, q), implies(p, not(q))))
% 0.20/0.50 = { by lemma 10 R->L }
% 0.20/0.50 fresh(fresh3(fresh2(axiom(implies(or(implies(p, q), not(q)), implies(p, or(implies(p, q), not(q))))), true, implies(or(implies(p, q), not(q)), implies(p, or(implies(p, q), not(q))))), true, implies(p, or(implies(p, q), not(q))), or(implies(p, q), not(q))), true, or(implies(p, q), implies(p, not(q))))
% 0.20/0.50 = { by axiom 5 (rule_1) }
% 0.20/0.50 fresh(fresh3(theorem(implies(or(implies(p, q), not(q)), implies(p, or(implies(p, q), not(q))))), true, implies(p, or(implies(p, q), not(q))), or(implies(p, q), not(q))), true, or(implies(p, q), implies(p, not(q))))
% 0.20/0.50 = { by axiom 7 (rule_2) }
% 0.20/0.50 fresh(fresh(theorem(or(implies(p, q), not(q))), true, implies(p, or(implies(p, q), not(q)))), true, or(implies(p, q), implies(p, not(q))))
% 0.20/0.50 = { by axiom 4 (rule_2) R->L }
% 0.20/0.50 fresh(fresh(fresh3(true, true, or(implies(p, q), not(q)), or(not(q), implies(p, q))), true, implies(p, or(implies(p, q), not(q)))), true, or(implies(p, q), implies(p, not(q))))
% 0.20/0.50 = { by axiom 2 (rule_1) R->L }
% 0.20/0.50 fresh(fresh(fresh3(fresh2(true, true, implies(or(not(q), implies(p, q)), or(implies(p, q), not(q)))), true, or(implies(p, q), not(q)), or(not(q), implies(p, q))), true, implies(p, or(implies(p, q), not(q)))), true, or(implies(p, q), implies(p, not(q))))
% 0.20/0.50 = { by axiom 8 (axiom_1_4) R->L }
% 0.20/0.50 fresh(fresh(fresh3(fresh2(axiom(implies(or(not(q), implies(p, q)), or(implies(p, q), not(q)))), true, implies(or(not(q), implies(p, q)), or(implies(p, q), not(q)))), true, or(implies(p, q), not(q)), or(not(q), implies(p, q))), true, implies(p, or(implies(p, q), not(q)))), true, or(implies(p, q), implies(p, not(q))))
% 0.20/0.50 = { by axiom 5 (rule_1) }
% 0.20/0.50 fresh(fresh(fresh3(theorem(implies(or(not(q), implies(p, q)), or(implies(p, q), not(q)))), true, or(implies(p, q), not(q)), or(not(q), implies(p, q))), true, implies(p, or(implies(p, q), not(q)))), true, or(implies(p, q), implies(p, not(q))))
% 0.20/0.50 = { by axiom 7 (rule_2) }
% 0.20/0.50 fresh(fresh(fresh(theorem(or(not(q), implies(p, q))), true, or(implies(p, q), not(q))), true, implies(p, or(implies(p, q), not(q)))), true, or(implies(p, q), implies(p, not(q))))
% 0.20/0.50 = { by axiom 5 (rule_1) R->L }
% 0.20/0.50 fresh(fresh(fresh(fresh2(axiom(or(not(q), implies(p, q))), true, or(not(q), implies(p, q))), true, or(implies(p, q), not(q))), true, implies(p, or(implies(p, q), not(q)))), true, or(implies(p, q), implies(p, not(q))))
% 0.20/0.50 = { by axiom 3 (implies_definition) R->L }
% 0.20/0.50 fresh(fresh(fresh(fresh2(axiom(implies(q, implies(p, q))), true, or(not(q), implies(p, q))), true, or(implies(p, q), not(q))), true, implies(p, or(implies(p, q), not(q)))), true, or(implies(p, q), implies(p, not(q))))
% 0.20/0.50 = { by lemma 10 }
% 0.20/0.50 fresh(fresh(fresh(fresh2(true, true, or(not(q), implies(p, q))), true, or(implies(p, q), not(q))), true, implies(p, or(implies(p, q), not(q)))), true, or(implies(p, q), implies(p, not(q))))
% 0.20/0.50 = { by axiom 2 (rule_1) }
% 0.20/0.50 fresh(fresh(fresh(true, true, or(implies(p, q), not(q))), true, implies(p, or(implies(p, q), not(q)))), true, or(implies(p, q), implies(p, not(q))))
% 0.20/0.50 = { by axiom 1 (rule_2) }
% 0.20/0.50 fresh(fresh(true, true, implies(p, or(implies(p, q), not(q)))), true, or(implies(p, q), implies(p, not(q))))
% 0.20/0.50 = { by axiom 1 (rule_2) }
% 0.20/0.50 fresh(true, true, or(implies(p, q), implies(p, not(q))))
% 0.20/0.50 = { by axiom 1 (rule_2) }
% 0.20/0.50 true
% 0.20/0.50 % SZS output end Proof
% 0.20/0.50
% 0.20/0.50 RESULT: Unsatisfiable (the axioms are contradictory).
%------------------------------------------------------------------------------