TSTP Solution File: LAT257-1 by Twee---2.4.2
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Twee---2.4.2
% Problem : LAT257-1 : TPTP v8.1.2. Released v3.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 : n007.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 06:27:58 EDT 2023
% Result : Unsatisfiable 7.19s 1.31s
% Output : Proof 7.19s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : LAT257-1 : TPTP v8.1.2. Released v3.1.0.
% 0.07/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.33 % Computer : n007.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % 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 : Thu Aug 24 07:15:40 EDT 2023
% 0.12/0.34 % CPUTime :
% 7.19/1.31 Command-line arguments: --lhs-weight 1 --flip-ordering --normalise-queue-percent 10 --cp-renormalise-threshold 10
% 7.19/1.31
% 7.19/1.31 % SZS status Unsatisfiable
% 7.19/1.31
% 7.19/1.32 % SZS output start Proof
% 7.19/1.32 Take the following subset of the input axioms:
% 7.19/1.32 fof(absorption1, axiom, ![X, Y]: meet(X, join(X, Y))=X).
% 7.19/1.32 fof(absorption2, axiom, ![X2, Y2]: join(X2, meet(X2, Y2))=X2).
% 7.19/1.32 fof(associativity_of_join, axiom, ![Z, X2, Y2]: join(join(X2, Y2), Z)=join(X2, join(Y2, Z))).
% 7.19/1.32 fof(associativity_of_meet, axiom, ![X2, Y2, Z2]: meet(meet(X2, Y2), Z2)=meet(X2, meet(Y2, Z2))).
% 7.19/1.32 fof(commutativity_of_join, axiom, ![X2, Y2]: join(X2, Y2)=join(Y2, X2)).
% 7.19/1.32 fof(commutativity_of_meet, axiom, ![X2, Y2]: meet(X2, Y2)=meet(Y2, X2)).
% 7.19/1.32 fof(complement_join, axiom, ![X2]: join(X2, complement(X2))=one).
% 7.19/1.32 fof(complement_meet, axiom, ![X2]: meet(X2, complement(X2))=zero).
% 7.19/1.32 fof(equation_H82, axiom, ![X2, Y2, Z2]: meet(X2, join(meet(Y2, join(X2, Z2)), meet(Z2, join(X2, Y2))))=join(meet(X2, Y2), meet(X2, Z2))).
% 7.19/1.32 fof(meet_join_complement, axiom, ![X2, Y2]: (meet(X2, Y2)!=zero | (join(X2, Y2)!=one | complement(X2)=Y2))).
% 7.19/1.32 fof(prove_distributivity, negated_conjecture, join(complement(b), complement(a))!=complement(a)).
% 7.19/1.32 fof(prove_distributivity_hypothesis, hypothesis, meet(b, a)=a).
% 7.19/1.32
% 7.19/1.32 Now clausify the problem and encode Horn clauses using encoding 3 of
% 7.19/1.32 http://www.cse.chalmers.se/~nicsma/papers/horn.pdf.
% 7.19/1.32 We repeatedly replace C & s=t => u=v by the two clauses:
% 7.19/1.32 fresh(y, y, x1...xn) = u
% 7.19/1.32 C => fresh(s, t, x1...xn) = v
% 7.19/1.32 where fresh is a fresh function symbol and x1..xn are the free
% 7.19/1.32 variables of u and v.
% 7.19/1.32 A predicate p(X) is encoded as p(X)=true (this is sound, because the
% 7.19/1.32 input problem has no model of domain size 1).
% 7.19/1.32
% 7.19/1.32 The encoding turns the above axioms into the following unit equations and goals:
% 7.19/1.32
% 7.19/1.32 Axiom 1 (commutativity_of_meet): meet(X, Y) = meet(Y, X).
% 7.19/1.32 Axiom 2 (prove_distributivity_hypothesis): meet(b, a) = a.
% 7.19/1.32 Axiom 3 (commutativity_of_join): join(X, Y) = join(Y, X).
% 7.19/1.32 Axiom 4 (complement_meet): meet(X, complement(X)) = zero.
% 7.19/1.32 Axiom 5 (complement_join): join(X, complement(X)) = one.
% 7.19/1.32 Axiom 6 (absorption1): meet(X, join(X, Y)) = X.
% 7.19/1.32 Axiom 7 (associativity_of_meet): meet(meet(X, Y), Z) = meet(X, meet(Y, Z)).
% 7.19/1.32 Axiom 8 (absorption2): join(X, meet(X, Y)) = X.
% 7.19/1.32 Axiom 9 (associativity_of_join): join(join(X, Y), Z) = join(X, join(Y, Z)).
% 7.19/1.32 Axiom 10 (meet_join_complement): fresh(X, X, Y, Z) = Z.
% 7.19/1.32 Axiom 11 (meet_join_complement): fresh2(X, X, Y, Z) = complement(Y).
% 7.19/1.32 Axiom 12 (meet_join_complement): fresh2(join(X, Y), one, X, Y) = fresh(meet(X, Y), zero, X, Y).
% 7.19/1.32 Axiom 13 (equation_H82): meet(X, join(meet(Y, join(X, Z)), meet(Z, join(X, Y)))) = join(meet(X, Y), meet(X, Z)).
% 7.19/1.32
% 7.19/1.32 Lemma 14: meet(X, one) = X.
% 7.19/1.32 Proof:
% 7.19/1.32 meet(X, one)
% 7.19/1.32 = { by axiom 5 (complement_join) R->L }
% 7.19/1.32 meet(X, join(X, complement(X)))
% 7.19/1.32 = { by axiom 6 (absorption1) }
% 7.19/1.32 X
% 7.19/1.32
% 7.19/1.32 Lemma 15: meet(a, b) = a.
% 7.19/1.32 Proof:
% 7.19/1.32 meet(a, b)
% 7.19/1.32 = { by axiom 1 (commutativity_of_meet) R->L }
% 7.19/1.32 meet(b, a)
% 7.19/1.32 = { by axiom 2 (prove_distributivity_hypothesis) }
% 7.19/1.32 a
% 7.19/1.32
% 7.19/1.32 Lemma 16: join(X, meet(Y, X)) = X.
% 7.19/1.32 Proof:
% 7.19/1.32 join(X, meet(Y, X))
% 7.19/1.32 = { by axiom 1 (commutativity_of_meet) R->L }
% 7.19/1.32 join(X, meet(X, Y))
% 7.19/1.32 = { by axiom 8 (absorption2) }
% 7.19/1.32 X
% 7.19/1.32
% 7.19/1.32 Lemma 17: join(X, join(Y, complement(X))) = one.
% 7.19/1.32 Proof:
% 7.19/1.32 join(X, join(Y, complement(X)))
% 7.19/1.32 = { by axiom 3 (commutativity_of_join) R->L }
% 7.19/1.32 join(join(Y, complement(X)), X)
% 7.19/1.32 = { by axiom 9 (associativity_of_join) }
% 7.19/1.32 join(Y, join(complement(X), X))
% 7.19/1.32 = { by axiom 3 (commutativity_of_join) }
% 7.19/1.32 join(Y, join(X, complement(X)))
% 7.19/1.32 = { by axiom 5 (complement_join) }
% 7.19/1.32 join(Y, one)
% 7.19/1.32 = { by axiom 3 (commutativity_of_join) R->L }
% 7.19/1.32 join(one, Y)
% 7.19/1.32 = { by lemma 14 R->L }
% 7.19/1.32 join(one, meet(Y, one))
% 7.19/1.32 = { by lemma 16 }
% 7.19/1.32 one
% 7.19/1.32
% 7.19/1.32 Goal 1 (prove_distributivity): join(complement(b), complement(a)) = complement(a).
% 7.19/1.32 Proof:
% 7.19/1.32 join(complement(b), complement(a))
% 7.19/1.32 = { by axiom 10 (meet_join_complement) R->L }
% 7.19/1.32 fresh(zero, zero, a, join(complement(b), complement(a)))
% 7.19/1.32 = { by axiom 4 (complement_meet) R->L }
% 7.19/1.32 fresh(meet(meet(a, b), complement(meet(a, b))), zero, a, join(complement(b), complement(a)))
% 7.19/1.32 = { by axiom 7 (associativity_of_meet) }
% 7.19/1.32 fresh(meet(a, meet(b, complement(meet(a, b)))), zero, a, join(complement(b), complement(a)))
% 7.19/1.32 = { by lemma 15 }
% 7.19/1.32 fresh(meet(a, meet(b, complement(a))), zero, a, join(complement(b), complement(a)))
% 7.19/1.32 = { by axiom 8 (absorption2) R->L }
% 7.19/1.32 fresh(meet(a, join(meet(b, complement(a)), meet(meet(b, complement(a)), complement(meet(b, complement(a)))))), zero, a, join(complement(b), complement(a)))
% 7.19/1.32 = { by axiom 4 (complement_meet) }
% 7.19/1.32 fresh(meet(a, join(meet(b, complement(a)), zero)), zero, a, join(complement(b), complement(a)))
% 7.19/1.32 = { by axiom 4 (complement_meet) R->L }
% 7.19/1.32 fresh(meet(a, join(meet(b, complement(a)), meet(b, complement(b)))), zero, a, join(complement(b), complement(a)))
% 7.19/1.32 = { by axiom 13 (equation_H82) R->L }
% 7.19/1.32 fresh(meet(a, meet(b, join(meet(complement(a), join(b, complement(b))), meet(complement(b), join(b, complement(a)))))), zero, a, join(complement(b), complement(a)))
% 7.19/1.32 = { by axiom 5 (complement_join) }
% 7.19/1.32 fresh(meet(a, meet(b, join(meet(complement(a), one), meet(complement(b), join(b, complement(a)))))), zero, a, join(complement(b), complement(a)))
% 7.19/1.32 = { by lemma 14 }
% 7.19/1.32 fresh(meet(a, meet(b, join(complement(a), meet(complement(b), join(b, complement(a)))))), zero, a, join(complement(b), complement(a)))
% 7.19/1.32 = { by lemma 16 R->L }
% 7.19/1.32 fresh(meet(a, meet(b, join(complement(a), meet(complement(b), join(join(b, meet(a, b)), complement(a)))))), zero, a, join(complement(b), complement(a)))
% 7.19/1.32 = { by lemma 15 }
% 7.19/1.32 fresh(meet(a, meet(b, join(complement(a), meet(complement(b), join(join(b, a), complement(a)))))), zero, a, join(complement(b), complement(a)))
% 7.19/1.32 = { by axiom 3 (commutativity_of_join) }
% 7.19/1.32 fresh(meet(a, meet(b, join(complement(a), meet(complement(b), join(join(a, b), complement(a)))))), zero, a, join(complement(b), complement(a)))
% 7.19/1.32 = { by axiom 9 (associativity_of_join) }
% 7.19/1.32 fresh(meet(a, meet(b, join(complement(a), meet(complement(b), join(a, join(b, complement(a))))))), zero, a, join(complement(b), complement(a)))
% 7.19/1.32 = { by lemma 17 }
% 7.19/1.32 fresh(meet(a, meet(b, join(complement(a), meet(complement(b), one)))), zero, a, join(complement(b), complement(a)))
% 7.19/1.32 = { by lemma 14 }
% 7.19/1.32 fresh(meet(a, meet(b, join(complement(a), complement(b)))), zero, a, join(complement(b), complement(a)))
% 7.19/1.32 = { by axiom 3 (commutativity_of_join) }
% 7.19/1.32 fresh(meet(a, meet(b, join(complement(b), complement(a)))), zero, a, join(complement(b), complement(a)))
% 7.19/1.32 = { by axiom 7 (associativity_of_meet) R->L }
% 7.19/1.32 fresh(meet(meet(a, b), join(complement(b), complement(a))), zero, a, join(complement(b), complement(a)))
% 7.19/1.32 = { by lemma 15 }
% 7.19/1.32 fresh(meet(a, join(complement(b), complement(a))), zero, a, join(complement(b), complement(a)))
% 7.19/1.32 = { by axiom 12 (meet_join_complement) R->L }
% 7.19/1.32 fresh2(join(a, join(complement(b), complement(a))), one, a, join(complement(b), complement(a)))
% 7.19/1.32 = { by lemma 17 }
% 7.19/1.32 fresh2(one, one, a, join(complement(b), complement(a)))
% 7.19/1.32 = { by axiom 11 (meet_join_complement) }
% 7.19/1.32 complement(a)
% 7.19/1.32 % SZS output end Proof
% 7.19/1.32
% 7.19/1.32 RESULT: Unsatisfiable (the axioms are contradictory).
%------------------------------------------------------------------------------