TSTP Solution File: LCL207-1 by Twee---2.4.2
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Twee---2.4.2
% Problem : LCL207-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 : 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:18:00 EDT 2023
% Result : Unsatisfiable 8.92s 1.67s
% Output : Proof 8.92s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10 % Problem : LCL207-1 : TPTP v8.1.2. Released v1.1.0.
% 0.00/0.11 % Command : parallel-twee %s --tstp --conditional-encoding if --smaller --drop-non-horn --give-up-on-saturation --explain-encoding --formal-proof
% 0.11/0.31 % Computer : n032.cluster.edu
% 0.11/0.31 % Model : x86_64 x86_64
% 0.11/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.31 % Memory : 8042.1875MB
% 0.11/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.31 % CPULimit : 300
% 0.11/0.31 % WCLimit : 300
% 0.11/0.31 % DateTime : Fri Aug 25 05:11:57 EDT 2023
% 0.11/0.31 % CPUTime :
% 8.92/1.67 Command-line arguments: --no-flatten-goal
% 8.92/1.67
% 8.92/1.67 % SZS status Unsatisfiable
% 8.92/1.67
% 8.92/1.67 % SZS output start Proof
% 8.92/1.67 Take the following subset of the input axioms:
% 8.92/1.67 fof(axiom_1_3, axiom, ![A, B]: axiom(or(not(A), or(B, A)))).
% 8.92/1.67 fof(axiom_1_4, axiom, ![A2, B2]: axiom(or(not(or(A2, B2)), or(B2, A2)))).
% 8.92/1.67 fof(axiom_1_5, axiom, ![C, A2, B2]: axiom(or(not(or(A2, or(B2, C))), or(B2, or(A2, C))))).
% 8.92/1.67 fof(prove_this, negated_conjecture, ~theorem(or(not(not(or(not(p), q))), or(not(q), p)))).
% 8.92/1.67 fof(rule_1, axiom, ![X]: (theorem(X) | ~axiom(X))).
% 8.92/1.67 fof(rule_2, axiom, ![Y, X2]: (theorem(X2) | (~axiom(or(not(Y), X2)) | ~theorem(Y)))).
% 8.92/1.67 fof(rule_3, axiom, ![Z, X2, Y2]: (theorem(or(not(X2), Z)) | (~axiom(or(not(X2), Y2)) | ~theorem(or(not(Y2), Z))))).
% 8.92/1.67
% 8.92/1.67 Now clausify the problem and encode Horn clauses using encoding 3 of
% 8.92/1.67 http://www.cse.chalmers.se/~nicsma/papers/horn.pdf.
% 8.92/1.67 We repeatedly replace C & s=t => u=v by the two clauses:
% 8.92/1.67 fresh(y, y, x1...xn) = u
% 8.92/1.67 C => fresh(s, t, x1...xn) = v
% 8.92/1.67 where fresh is a fresh function symbol and x1..xn are the free
% 8.92/1.67 variables of u and v.
% 8.92/1.67 A predicate p(X) is encoded as p(X)=true (this is sound, because the
% 8.92/1.67 input problem has no model of domain size 1).
% 8.92/1.67
% 8.92/1.67 The encoding turns the above axioms into the following unit equations and goals:
% 8.92/1.67
% 8.92/1.67 Axiom 1 (rule_1): fresh4(X, X, Y) = true.
% 8.92/1.67 Axiom 2 (rule_2): fresh3(X, X, Y) = true.
% 8.92/1.67 Axiom 3 (rule_3): fresh(X, X, Y, Z) = true.
% 8.92/1.67 Axiom 4 (rule_2): fresh5(X, X, Y, Z) = theorem(Y).
% 8.92/1.67 Axiom 5 (rule_1): fresh4(axiom(X), true, X) = theorem(X).
% 8.92/1.67 Axiom 6 (rule_3): fresh2(X, X, Y, Z, W) = theorem(or(not(Y), Z)).
% 8.92/1.67 Axiom 7 (axiom_1_3): axiom(or(not(X), or(Y, X))) = true.
% 8.92/1.67 Axiom 8 (rule_2): fresh5(theorem(X), true, Y, X) = fresh3(axiom(or(not(X), Y)), true, Y).
% 8.92/1.67 Axiom 9 (axiom_1_4): axiom(or(not(or(X, Y)), or(Y, X))) = true.
% 8.92/1.67 Axiom 10 (rule_3): fresh2(theorem(or(not(X), Y)), true, Z, Y, X) = fresh(axiom(or(not(Z), X)), true, Z, Y).
% 8.92/1.67 Axiom 11 (axiom_1_5): axiom(or(not(or(X, or(Y, Z))), or(Y, or(X, Z)))) = true.
% 8.92/1.67
% 8.92/1.67 Lemma 12: fresh5(theorem(or(X, or(Y, Z))), true, or(Y, or(X, Z)), or(X, or(Y, Z))) = true.
% 8.92/1.67 Proof:
% 8.92/1.67 fresh5(theorem(or(X, or(Y, Z))), true, or(Y, or(X, Z)), or(X, or(Y, Z)))
% 8.92/1.67 = { by axiom 8 (rule_2) }
% 8.92/1.67 fresh3(axiom(or(not(or(X, or(Y, Z))), or(Y, or(X, Z)))), true, or(Y, or(X, Z)))
% 8.92/1.67 = { by axiom 11 (axiom_1_5) }
% 8.92/1.67 fresh3(true, true, or(Y, or(X, Z)))
% 8.92/1.67 = { by axiom 2 (rule_2) }
% 8.92/1.67 true
% 8.92/1.67
% 8.92/1.67 Goal 1 (prove_this): theorem(or(not(not(or(not(p), q))), or(not(q), p))) = true.
% 8.92/1.67 Proof:
% 8.92/1.67 theorem(or(not(not(or(not(p), q))), or(not(q), p)))
% 8.92/1.67 = { by axiom 4 (rule_2) R->L }
% 8.92/1.67 fresh5(true, true, or(not(not(or(not(p), q))), or(not(q), p)), or(not(q), or(not(not(or(not(p), q))), p)))
% 8.92/1.67 = { by axiom 3 (rule_3) R->L }
% 8.92/1.67 fresh5(fresh(true, true, q, or(not(not(or(not(p), q))), p)), true, or(not(not(or(not(p), q))), or(not(q), p)), or(not(q), or(not(not(or(not(p), q))), p)))
% 8.92/1.67 = { by axiom 7 (axiom_1_3) R->L }
% 8.92/1.67 fresh5(fresh(axiom(or(not(q), or(not(p), q))), true, q, or(not(not(or(not(p), q))), p)), true, or(not(not(or(not(p), q))), or(not(q), p)), or(not(q), or(not(not(or(not(p), q))), p)))
% 8.92/1.67 = { by axiom 10 (rule_3) R->L }
% 8.92/1.67 fresh5(fresh2(theorem(or(not(or(not(p), q)), or(not(not(or(not(p), q))), p))), true, q, or(not(not(or(not(p), q))), p), or(not(p), q)), true, or(not(not(or(not(p), q))), or(not(q), p)), or(not(q), or(not(not(or(not(p), q))), p)))
% 8.92/1.67 = { by axiom 4 (rule_2) R->L }
% 8.92/1.67 fresh5(fresh2(fresh5(true, true, or(not(or(not(p), q)), or(not(not(or(not(p), q))), p)), or(not(not(or(not(p), q))), or(not(or(not(p), q)), p))), true, q, or(not(not(or(not(p), q))), p), or(not(p), q)), true, or(not(not(or(not(p), q))), or(not(q), p)), or(not(q), or(not(not(or(not(p), q))), p)))
% 8.92/1.67 = { by axiom 3 (rule_3) R->L }
% 8.92/1.67 fresh5(fresh2(fresh5(fresh(true, true, not(or(not(p), q)), or(not(or(not(p), q)), p)), true, or(not(or(not(p), q)), or(not(not(or(not(p), q))), p)), or(not(not(or(not(p), q))), or(not(or(not(p), q)), p))), true, q, or(not(not(or(not(p), q))), p), or(not(p), q)), true, or(not(not(or(not(p), q))), or(not(q), p)), or(not(q), or(not(not(or(not(p), q))), p)))
% 8.92/1.67 = { by axiom 7 (axiom_1_3) R->L }
% 8.92/1.67 fresh5(fresh2(fresh5(fresh(axiom(or(not(not(or(not(p), q))), or(p, not(or(not(p), q))))), true, not(or(not(p), q)), or(not(or(not(p), q)), p)), true, or(not(or(not(p), q)), or(not(not(or(not(p), q))), p)), or(not(not(or(not(p), q))), or(not(or(not(p), q)), p))), true, q, or(not(not(or(not(p), q))), p), or(not(p), q)), true, or(not(not(or(not(p), q))), or(not(q), p)), or(not(q), or(not(not(or(not(p), q))), p)))
% 8.92/1.67 = { by axiom 10 (rule_3) R->L }
% 8.92/1.68 fresh5(fresh2(fresh5(fresh2(theorem(or(not(or(p, not(or(not(p), q)))), or(not(or(not(p), q)), p))), true, not(or(not(p), q)), or(not(or(not(p), q)), p), or(p, not(or(not(p), q)))), true, or(not(or(not(p), q)), or(not(not(or(not(p), q))), p)), or(not(not(or(not(p), q))), or(not(or(not(p), q)), p))), true, q, or(not(not(or(not(p), q))), p), or(not(p), q)), true, or(not(not(or(not(p), q))), or(not(q), p)), or(not(q), or(not(not(or(not(p), q))), p)))
% 8.92/1.68 = { by axiom 5 (rule_1) R->L }
% 8.92/1.68 fresh5(fresh2(fresh5(fresh2(fresh4(axiom(or(not(or(p, not(or(not(p), q)))), or(not(or(not(p), q)), p))), true, or(not(or(p, not(or(not(p), q)))), or(not(or(not(p), q)), p))), true, not(or(not(p), q)), or(not(or(not(p), q)), p), or(p, not(or(not(p), q)))), true, or(not(or(not(p), q)), or(not(not(or(not(p), q))), p)), or(not(not(or(not(p), q))), or(not(or(not(p), q)), p))), true, q, or(not(not(or(not(p), q))), p), or(not(p), q)), true, or(not(not(or(not(p), q))), or(not(q), p)), or(not(q), or(not(not(or(not(p), q))), p)))
% 8.92/1.68 = { by axiom 9 (axiom_1_4) }
% 8.92/1.68 fresh5(fresh2(fresh5(fresh2(fresh4(true, true, or(not(or(p, not(or(not(p), q)))), or(not(or(not(p), q)), p))), true, not(or(not(p), q)), or(not(or(not(p), q)), p), or(p, not(or(not(p), q)))), true, or(not(or(not(p), q)), or(not(not(or(not(p), q))), p)), or(not(not(or(not(p), q))), or(not(or(not(p), q)), p))), true, q, or(not(not(or(not(p), q))), p), or(not(p), q)), true, or(not(not(or(not(p), q))), or(not(q), p)), or(not(q), or(not(not(or(not(p), q))), p)))
% 8.92/1.68 = { by axiom 1 (rule_1) }
% 8.92/1.68 fresh5(fresh2(fresh5(fresh2(true, true, not(or(not(p), q)), or(not(or(not(p), q)), p), or(p, not(or(not(p), q)))), true, or(not(or(not(p), q)), or(not(not(or(not(p), q))), p)), or(not(not(or(not(p), q))), or(not(or(not(p), q)), p))), true, q, or(not(not(or(not(p), q))), p), or(not(p), q)), true, or(not(not(or(not(p), q))), or(not(q), p)), or(not(q), or(not(not(or(not(p), q))), p)))
% 8.92/1.68 = { by axiom 6 (rule_3) }
% 8.92/1.68 fresh5(fresh2(fresh5(theorem(or(not(not(or(not(p), q))), or(not(or(not(p), q)), p))), true, or(not(or(not(p), q)), or(not(not(or(not(p), q))), p)), or(not(not(or(not(p), q))), or(not(or(not(p), q)), p))), true, q, or(not(not(or(not(p), q))), p), or(not(p), q)), true, or(not(not(or(not(p), q))), or(not(q), p)), or(not(q), or(not(not(or(not(p), q))), p)))
% 8.92/1.68 = { by lemma 12 }
% 8.92/1.68 fresh5(fresh2(true, true, q, or(not(not(or(not(p), q))), p), or(not(p), q)), true, or(not(not(or(not(p), q))), or(not(q), p)), or(not(q), or(not(not(or(not(p), q))), p)))
% 8.92/1.68 = { by axiom 6 (rule_3) }
% 8.92/1.68 fresh5(theorem(or(not(q), or(not(not(or(not(p), q))), p))), true, or(not(not(or(not(p), q))), or(not(q), p)), or(not(q), or(not(not(or(not(p), q))), p)))
% 8.92/1.68 = { by lemma 12 }
% 8.92/1.68 true
% 8.92/1.68 % SZS output end Proof
% 8.92/1.68
% 8.92/1.68 RESULT: Unsatisfiable (the axioms are contradictory).
%------------------------------------------------------------------------------