TSTP Solution File: LCL239-10 by Twee---2.4.2
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Twee---2.4.2
% Problem : LCL239-10 : TPTP v8.1.2. Released v7.5.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 : n023.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:12 EDT 2023
% Result : Unsatisfiable 0.20s 0.52s
% Output : Proof 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : LCL239-10 : TPTP v8.1.2. Released v7.5.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.14/0.34 % Computer : n023.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Fri Aug 25 06:23:42 EDT 2023
% 0.14/0.34 % CPUTime :
% 0.20/0.52 Command-line arguments: --no-flatten-goal
% 0.20/0.52
% 0.20/0.52 % SZS status Unsatisfiable
% 0.20/0.52
% 0.20/0.53 % SZS output start Proof
% 0.20/0.53 Axiom 1 (implies_definition): implies(X, Y) = or(not(X), Y).
% 0.20/0.53 Axiom 2 (ifeq_axiom): ifeq(X, X, Y, Z) = Y.
% 0.20/0.53 Axiom 3 (axiom_1_3): axiom(implies(X, or(Y, X))) = true.
% 0.20/0.53 Axiom 4 (axiom_1_2): axiom(implies(or(X, X), X)) = true.
% 0.20/0.53 Axiom 5 (and_defn): and(X, Y) = not(or(not(X), not(Y))).
% 0.20/0.53 Axiom 6 (rule_1): ifeq(axiom(X), true, theorem(X), true) = true.
% 0.20/0.53 Axiom 7 (axiom_1_4): axiom(implies(or(X, Y), or(Y, X))) = true.
% 0.20/0.53 Axiom 8 (axiom_1_5): axiom(implies(or(X, or(Y, Z)), or(Y, or(X, Z)))) = true.
% 0.20/0.53 Axiom 9 (rule_2): ifeq(theorem(implies(X, Y)), true, ifeq(theorem(X), true, theorem(Y), true), true) = true.
% 0.20/0.53
% 0.20/0.53 Lemma 10: theorem(implies(X, not(not(X)))) = true.
% 0.20/0.53 Proof:
% 0.20/0.53 theorem(implies(X, not(not(X))))
% 0.20/0.53 = { by axiom 1 (implies_definition) }
% 0.20/0.53 theorem(or(not(X), not(not(X))))
% 0.20/0.53 = { by axiom 2 (ifeq_axiom) R->L }
% 0.20/0.53 ifeq(true, true, theorem(or(not(X), not(not(X)))), true)
% 0.20/0.53 = { by axiom 9 (rule_2) R->L }
% 0.20/0.53 ifeq(ifeq(theorem(implies(or(implies(not(X), not(X)), implies(not(X), not(X))), implies(not(X), not(X)))), true, ifeq(theorem(or(implies(not(X), not(X)), implies(not(X), not(X)))), true, theorem(implies(not(X), not(X))), true), true), true, theorem(or(not(X), not(not(X)))), true)
% 0.20/0.54 = { by axiom 2 (ifeq_axiom) R->L }
% 0.20/0.54 ifeq(ifeq(ifeq(true, true, theorem(implies(or(implies(not(X), not(X)), implies(not(X), not(X))), implies(not(X), not(X)))), true), true, ifeq(theorem(or(implies(not(X), not(X)), implies(not(X), not(X)))), true, theorem(implies(not(X), not(X))), true), true), true, theorem(or(not(X), not(not(X)))), true)
% 0.20/0.54 = { by axiom 4 (axiom_1_2) R->L }
% 0.20/0.54 ifeq(ifeq(ifeq(axiom(implies(or(implies(not(X), not(X)), implies(not(X), not(X))), implies(not(X), not(X)))), true, theorem(implies(or(implies(not(X), not(X)), implies(not(X), not(X))), implies(not(X), not(X)))), true), true, ifeq(theorem(or(implies(not(X), not(X)), implies(not(X), not(X)))), true, theorem(implies(not(X), not(X))), true), true), true, theorem(or(not(X), not(not(X)))), true)
% 0.20/0.54 = { by axiom 6 (rule_1) }
% 0.20/0.54 ifeq(ifeq(true, true, ifeq(theorem(or(implies(not(X), not(X)), implies(not(X), not(X)))), true, theorem(implies(not(X), not(X))), true), true), true, theorem(or(not(X), not(not(X)))), true)
% 0.20/0.54 = { by axiom 2 (ifeq_axiom) }
% 0.20/0.54 ifeq(ifeq(theorem(or(implies(not(X), not(X)), implies(not(X), not(X)))), true, theorem(implies(not(X), not(X))), true), true, theorem(or(not(X), not(not(X)))), true)
% 0.20/0.54 = { by axiom 2 (ifeq_axiom) R->L }
% 0.20/0.54 ifeq(ifeq(ifeq(true, true, theorem(or(implies(not(X), not(X)), implies(not(X), not(X)))), true), true, theorem(implies(not(X), not(X))), true), true, theorem(or(not(X), not(not(X)))), true)
% 0.20/0.54 = { by axiom 6 (rule_1) R->L }
% 0.20/0.54 ifeq(ifeq(ifeq(ifeq(axiom(implies(implies(not(X), or(implies(not(X), not(X)), not(X))), or(implies(not(X), not(X)), implies(not(X), not(X))))), true, theorem(implies(implies(not(X), or(implies(not(X), not(X)), not(X))), or(implies(not(X), not(X)), implies(not(X), not(X))))), true), true, theorem(or(implies(not(X), not(X)), implies(not(X), not(X)))), true), true, theorem(implies(not(X), not(X))), true), true, theorem(or(not(X), not(not(X)))), true)
% 0.20/0.54 = { by axiom 1 (implies_definition) }
% 0.20/0.54 ifeq(ifeq(ifeq(ifeq(axiom(implies(implies(not(X), or(implies(not(X), not(X)), not(X))), or(implies(not(X), not(X)), or(not(not(X)), not(X))))), true, theorem(implies(implies(not(X), or(implies(not(X), not(X)), not(X))), or(implies(not(X), not(X)), implies(not(X), not(X))))), true), true, theorem(or(implies(not(X), not(X)), implies(not(X), not(X)))), true), true, theorem(implies(not(X), not(X))), true), true, theorem(or(not(X), not(not(X)))), true)
% 0.20/0.54 = { by axiom 1 (implies_definition) }
% 0.20/0.54 ifeq(ifeq(ifeq(ifeq(axiom(implies(or(not(not(X)), or(implies(not(X), not(X)), not(X))), or(implies(not(X), not(X)), or(not(not(X)), not(X))))), true, theorem(implies(implies(not(X), or(implies(not(X), not(X)), not(X))), or(implies(not(X), not(X)), implies(not(X), not(X))))), true), true, theorem(or(implies(not(X), not(X)), implies(not(X), not(X)))), true), true, theorem(implies(not(X), not(X))), true), true, theorem(or(not(X), not(not(X)))), true)
% 0.20/0.54 = { by axiom 8 (axiom_1_5) }
% 0.20/0.54 ifeq(ifeq(ifeq(ifeq(true, true, theorem(implies(implies(not(X), or(implies(not(X), not(X)), not(X))), or(implies(not(X), not(X)), implies(not(X), not(X))))), true), true, theorem(or(implies(not(X), not(X)), implies(not(X), not(X)))), true), true, theorem(implies(not(X), not(X))), true), true, theorem(or(not(X), not(not(X)))), true)
% 0.20/0.54 = { by axiom 2 (ifeq_axiom) }
% 0.20/0.54 ifeq(ifeq(ifeq(theorem(implies(implies(not(X), or(implies(not(X), not(X)), not(X))), or(implies(not(X), not(X)), implies(not(X), not(X))))), true, theorem(or(implies(not(X), not(X)), implies(not(X), not(X)))), true), true, theorem(implies(not(X), not(X))), true), true, theorem(or(not(X), not(not(X)))), true)
% 0.20/0.54 = { by axiom 2 (ifeq_axiom) R->L }
% 0.20/0.54 ifeq(ifeq(ifeq(theorem(implies(implies(not(X), or(implies(not(X), not(X)), not(X))), or(implies(not(X), not(X)), implies(not(X), not(X))))), true, ifeq(true, true, theorem(or(implies(not(X), not(X)), implies(not(X), not(X)))), true), true), true, theorem(implies(not(X), not(X))), true), true, theorem(or(not(X), not(not(X)))), true)
% 0.20/0.54 = { by axiom 6 (rule_1) R->L }
% 0.20/0.54 ifeq(ifeq(ifeq(theorem(implies(implies(not(X), or(implies(not(X), not(X)), not(X))), or(implies(not(X), not(X)), implies(not(X), not(X))))), true, ifeq(ifeq(axiom(implies(not(X), or(implies(not(X), not(X)), not(X)))), true, theorem(implies(not(X), or(implies(not(X), not(X)), not(X)))), true), true, theorem(or(implies(not(X), not(X)), implies(not(X), not(X)))), true), true), true, theorem(implies(not(X), not(X))), true), true, theorem(or(not(X), not(not(X)))), true)
% 0.20/0.54 = { by axiom 3 (axiom_1_3) }
% 0.20/0.54 ifeq(ifeq(ifeq(theorem(implies(implies(not(X), or(implies(not(X), not(X)), not(X))), or(implies(not(X), not(X)), implies(not(X), not(X))))), true, ifeq(ifeq(true, true, theorem(implies(not(X), or(implies(not(X), not(X)), not(X)))), true), true, theorem(or(implies(not(X), not(X)), implies(not(X), not(X)))), true), true), true, theorem(implies(not(X), not(X))), true), true, theorem(or(not(X), not(not(X)))), true)
% 0.20/0.54 = { by axiom 2 (ifeq_axiom) }
% 0.20/0.54 ifeq(ifeq(ifeq(theorem(implies(implies(not(X), or(implies(not(X), not(X)), not(X))), or(implies(not(X), not(X)), implies(not(X), not(X))))), true, ifeq(theorem(implies(not(X), or(implies(not(X), not(X)), not(X)))), true, theorem(or(implies(not(X), not(X)), implies(not(X), not(X)))), true), true), true, theorem(implies(not(X), not(X))), true), true, theorem(or(not(X), not(not(X)))), true)
% 0.20/0.54 = { by axiom 9 (rule_2) }
% 0.20/0.54 ifeq(ifeq(true, true, theorem(implies(not(X), not(X))), true), true, theorem(or(not(X), not(not(X)))), true)
% 0.20/0.54 = { by axiom 2 (ifeq_axiom) }
% 0.20/0.54 ifeq(theorem(implies(not(X), not(X))), true, theorem(or(not(X), not(not(X)))), true)
% 0.20/0.54 = { by axiom 2 (ifeq_axiom) R->L }
% 0.20/0.54 ifeq(true, true, ifeq(theorem(implies(not(X), not(X))), true, theorem(or(not(X), not(not(X)))), true), true)
% 0.20/0.54 = { by axiom 6 (rule_1) R->L }
% 0.20/0.54 ifeq(ifeq(axiom(implies(or(not(not(X)), not(X)), or(not(X), not(not(X))))), true, theorem(implies(or(not(not(X)), not(X)), or(not(X), not(not(X))))), true), true, ifeq(theorem(implies(not(X), not(X))), true, theorem(or(not(X), not(not(X)))), true), true)
% 0.20/0.54 = { by axiom 7 (axiom_1_4) }
% 0.20/0.54 ifeq(ifeq(true, true, theorem(implies(or(not(not(X)), not(X)), or(not(X), not(not(X))))), true), true, ifeq(theorem(implies(not(X), not(X))), true, theorem(or(not(X), not(not(X)))), true), true)
% 0.20/0.54 = { by axiom 2 (ifeq_axiom) }
% 0.20/0.54 ifeq(theorem(implies(or(not(not(X)), not(X)), or(not(X), not(not(X))))), true, ifeq(theorem(implies(not(X), not(X))), true, theorem(or(not(X), not(not(X)))), true), true)
% 0.20/0.54 = { by axiom 1 (implies_definition) R->L }
% 0.20/0.54 ifeq(theorem(implies(implies(not(X), not(X)), or(not(X), not(not(X))))), true, ifeq(theorem(implies(not(X), not(X))), true, theorem(or(not(X), not(not(X)))), true), true)
% 0.20/0.54 = { by axiom 9 (rule_2) }
% 0.20/0.54 true
% 0.20/0.54
% 0.20/0.54 Goal 1 (prove_this): theorem(not(and(p, not(p)))) = true.
% 0.20/0.54 Proof:
% 0.20/0.54 theorem(not(and(p, not(p))))
% 0.20/0.54 = { by axiom 5 (and_defn) }
% 0.20/0.54 theorem(not(not(or(not(p), not(not(p))))))
% 0.20/0.54 = { by axiom 1 (implies_definition) R->L }
% 0.20/0.54 theorem(not(not(implies(p, not(not(p))))))
% 0.20/0.54 = { by axiom 2 (ifeq_axiom) R->L }
% 0.20/0.54 ifeq(true, true, theorem(not(not(implies(p, not(not(p)))))), true)
% 0.20/0.54 = { by lemma 10 R->L }
% 0.20/0.54 ifeq(theorem(implies(p, not(not(p)))), true, theorem(not(not(implies(p, not(not(p)))))), true)
% 0.20/0.54 = { by axiom 2 (ifeq_axiom) R->L }
% 0.20/0.54 ifeq(true, true, ifeq(theorem(implies(p, not(not(p)))), true, theorem(not(not(implies(p, not(not(p)))))), true), true)
% 0.20/0.54 = { by lemma 10 R->L }
% 0.20/0.54 ifeq(theorem(implies(implies(p, not(not(p))), not(not(implies(p, not(not(p))))))), true, ifeq(theorem(implies(p, not(not(p)))), true, theorem(not(not(implies(p, not(not(p)))))), true), true)
% 0.20/0.54 = { by axiom 9 (rule_2) }
% 0.20/0.54 true
% 0.20/0.54 % SZS output end Proof
% 0.20/0.54
% 0.20/0.54 RESULT: Unsatisfiable (the axioms are contradictory).
%------------------------------------------------------------------------------