%------------------------------------------------------------------------------
% File : Twee---2.7
% Problem : LCL301-3 : TPTP v9.3.1. Released v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_twee /export/starexec/sandbox/benchmark/theBenchmark.p
% Computer : n006.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Tue Sep 29 11:49:34 AM UTC 2026
% Result : Unsatisfiable 0.60s 0.53s
% Output : Proof 0.60s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL301-3 : TPTP v9.3.1. Released v2.3.0.
% 0.00/0.04 % Command : run_twee /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.07/0.35 % Computer : n006.cluster.edu
% 0.07/0.35 % Model : x86_64 x86_64
% 0.07/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.35 % Memory : 8046.5625MB
% 0.07/0.35 % OS : Linux 6.8.0-71-generic
% 0.07/0.35 % CPULimit : 300
% 0.07/0.35 % WCLimit : 300
% 0.07/0.35 % DateTime : Sun Sep 27 15:33:25 UTC 2026
% 0.07/0.35 % CPUTime :
% 0.07/0.35 Running run_twee /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.60/0.53 Command-line arguments: --lhs-weight 1 --flip-ordering --normalise-queue-percent 10 --cp-renormalise-threshold 10 --complete-subsets --ground-joining-incomplete-limit 15 --flatten-every 2
% 0.60/0.53
% 0.60/0.53 % SZS status Unsatisfiable
% 0.60/0.53
% 0.60/0.54 % SZS output start Proof
% 0.60/0.54 Axiom 1 (implies_definition): implies(X, Y) = or(not(X), Y).
% 0.60/0.54 Axiom 2 (and_defn): and(X, Y) = not(or(not(X), not(Y))).
% 0.60/0.54 Axiom 3 (ifeq_axiom): ifeq(X, X, Y, Z) = Y.
% 0.60/0.54 Axiom 4 (axiom_1_3): axiom(implies(X, or(Y, X))) = true.
% 0.60/0.54 Axiom 5 (axiom_1_2): axiom(implies(or(X, X), X)) = true.
% 0.60/0.54 Axiom 6 (equivalent_defn): equivalent(X, Y) = and(implies(X, Y), implies(Y, X)).
% 0.60/0.54 Axiom 7 (rule_1): ifeq(axiom(X), true, theorem(X), true) = true.
% 0.60/0.54 Axiom 8 (axiom_1_4): axiom(implies(or(X, Y), or(Y, X))) = true.
% 0.60/0.54 Axiom 9 (axiom_1_5): axiom(implies(or(X, or(Y, Z)), or(Y, or(X, Z)))) = true.
% 0.60/0.54 Axiom 10 (rule_2): ifeq(theorem(implies(X, Y)), true, ifeq(theorem(X), true, theorem(Y), true), true) = true.
% 0.60/0.54
% 0.60/0.54 Lemma 11: not(implies(X, not(Y))) = and(X, Y).
% 0.60/0.54 Proof:
% 0.60/0.54 not(implies(X, not(Y)))
% 0.60/0.54 = { by axiom 1 (implies_definition) }
% 0.60/0.54 not(or(not(X), not(Y)))
% 0.60/0.54 = { by axiom 2 (and_defn) R->L }
% 0.60/0.54 and(X, Y)
% 0.60/0.54
% 0.60/0.54 Goal 1 (prove_this): theorem(equivalent(not(implies(not(p), not(q))), and(not(p), q))) = true.
% 0.60/0.54 Proof:
% 0.60/0.54 theorem(equivalent(not(implies(not(p), not(q))), and(not(p), q)))
% 0.60/0.54 = { by lemma 11 }
% 0.60/0.54 theorem(equivalent(and(not(p), q), and(not(p), q)))
% 0.60/0.54 = { by axiom 3 (ifeq_axiom) R->L }
% 0.60/0.54 ifeq(true, true, theorem(equivalent(and(not(p), q), and(not(p), q))), true)
% 0.60/0.54 = { by axiom 10 (rule_2) R->L }
% 0.60/0.54 ifeq(ifeq(theorem(implies(or(implies(and(not(p), q), and(not(p), q)), implies(and(not(p), q), and(not(p), q))), implies(and(not(p), q), and(not(p), q)))), true, ifeq(theorem(or(implies(and(not(p), q), and(not(p), q)), implies(and(not(p), q), and(not(p), q)))), true, theorem(implies(and(not(p), q), and(not(p), q))), true), true), true, theorem(equivalent(and(not(p), q), and(not(p), q))), true)
% 0.60/0.54 = { by axiom 3 (ifeq_axiom) R->L }
% 0.60/0.54 ifeq(ifeq(ifeq(true, true, theorem(implies(or(implies(and(not(p), q), and(not(p), q)), implies(and(not(p), q), and(not(p), q))), implies(and(not(p), q), and(not(p), q)))), true), true, ifeq(theorem(or(implies(and(not(p), q), and(not(p), q)), implies(and(not(p), q), and(not(p), q)))), true, theorem(implies(and(not(p), q), and(not(p), q))), true), true), true, theorem(equivalent(and(not(p), q), and(not(p), q))), true)
% 0.60/0.54 = { by axiom 5 (axiom_1_2) R->L }
% 0.60/0.54 ifeq(ifeq(ifeq(axiom(implies(or(implies(and(not(p), q), and(not(p), q)), implies(and(not(p), q), and(not(p), q))), implies(and(not(p), q), and(not(p), q)))), true, theorem(implies(or(implies(and(not(p), q), and(not(p), q)), implies(and(not(p), q), and(not(p), q))), implies(and(not(p), q), and(not(p), q)))), true), true, ifeq(theorem(or(implies(and(not(p), q), and(not(p), q)), implies(and(not(p), q), and(not(p), q)))), true, theorem(implies(and(not(p), q), and(not(p), q))), true), true), true, theorem(equivalent(and(not(p), q), and(not(p), q))), true)
% 0.60/0.54 = { by axiom 7 (rule_1) }
% 0.60/0.54 ifeq(ifeq(true, true, ifeq(theorem(or(implies(and(not(p), q), and(not(p), q)), implies(and(not(p), q), and(not(p), q)))), true, theorem(implies(and(not(p), q), and(not(p), q))), true), true), true, theorem(equivalent(and(not(p), q), and(not(p), q))), true)
% 0.60/0.54 = { by axiom 3 (ifeq_axiom) }
% 0.60/0.54 ifeq(ifeq(theorem(or(implies(and(not(p), q), and(not(p), q)), implies(and(not(p), q), and(not(p), q)))), true, theorem(implies(and(not(p), q), and(not(p), q))), true), true, theorem(equivalent(and(not(p), q), and(not(p), q))), true)
% 0.60/0.54 = { by axiom 3 (ifeq_axiom) R->L }
% 0.60/0.54 ifeq(ifeq(ifeq(true, true, theorem(or(implies(and(not(p), q), and(not(p), q)), implies(and(not(p), q), and(not(p), q)))), true), true, theorem(implies(and(not(p), q), and(not(p), q))), true), true, theorem(equivalent(and(not(p), q), and(not(p), q))), true)
% 0.60/0.54 = { by axiom 7 (rule_1) R->L }
% 0.60/0.54 ifeq(ifeq(ifeq(ifeq(axiom(implies(implies(and(not(p), q), or(implies(and(not(p), q), and(not(p), q)), and(not(p), q))), or(implies(and(not(p), q), and(not(p), q)), implies(and(not(p), q), and(not(p), q))))), true, theorem(implies(implies(and(not(p), q), or(implies(and(not(p), q), and(not(p), q)), and(not(p), q))), or(implies(and(not(p), q), and(not(p), q)), implies(and(not(p), q), and(not(p), q))))), true), true, theorem(or(implies(and(not(p), q), and(not(p), q)), implies(and(not(p), q), and(not(p), q)))), true), true, theorem(implies(and(not(p), q), and(not(p), q))), true), true, theorem(equivalent(and(not(p), q), and(not(p), q))), true)
% 0.60/0.55 = { by axiom 1 (implies_definition) }
% 0.60/0.55 ifeq(ifeq(ifeq(ifeq(axiom(implies(implies(and(not(p), q), or(implies(and(not(p), q), and(not(p), q)), and(not(p), q))), or(implies(and(not(p), q), and(not(p), q)), or(not(and(not(p), q)), and(not(p), q))))), true, theorem(implies(implies(and(not(p), q), or(implies(and(not(p), q), and(not(p), q)), and(not(p), q))), or(implies(and(not(p), q), and(not(p), q)), implies(and(not(p), q), and(not(p), q))))), true), true, theorem(or(implies(and(not(p), q), and(not(p), q)), implies(and(not(p), q), and(not(p), q)))), true), true, theorem(implies(and(not(p), q), and(not(p), q))), true), true, theorem(equivalent(and(not(p), q), and(not(p), q))), true)
% 0.60/0.55 = { by axiom 1 (implies_definition) }
% 0.60/0.55 ifeq(ifeq(ifeq(ifeq(axiom(implies(or(not(and(not(p), q)), or(implies(and(not(p), q), and(not(p), q)), and(not(p), q))), or(implies(and(not(p), q), and(not(p), q)), or(not(and(not(p), q)), and(not(p), q))))), true, theorem(implies(implies(and(not(p), q), or(implies(and(not(p), q), and(not(p), q)), and(not(p), q))), or(implies(and(not(p), q), and(not(p), q)), implies(and(not(p), q), and(not(p), q))))), true), true, theorem(or(implies(and(not(p), q), and(not(p), q)), implies(and(not(p), q), and(not(p), q)))), true), true, theorem(implies(and(not(p), q), and(not(p), q))), true), true, theorem(equivalent(and(not(p), q), and(not(p), q))), true)
% 0.60/0.55 = { by axiom 9 (axiom_1_5) }
% 0.60/0.55 ifeq(ifeq(ifeq(ifeq(true, true, theorem(implies(implies(and(not(p), q), or(implies(and(not(p), q), and(not(p), q)), and(not(p), q))), or(implies(and(not(p), q), and(not(p), q)), implies(and(not(p), q), and(not(p), q))))), true), true, theorem(or(implies(and(not(p), q), and(not(p), q)), implies(and(not(p), q), and(not(p), q)))), true), true, theorem(implies(and(not(p), q), and(not(p), q))), true), true, theorem(equivalent(and(not(p), q), and(not(p), q))), true)
% 0.60/0.55 = { by axiom 3 (ifeq_axiom) }
% 0.60/0.55 ifeq(ifeq(ifeq(theorem(implies(implies(and(not(p), q), or(implies(and(not(p), q), and(not(p), q)), and(not(p), q))), or(implies(and(not(p), q), and(not(p), q)), implies(and(not(p), q), and(not(p), q))))), true, theorem(or(implies(and(not(p), q), and(not(p), q)), implies(and(not(p), q), and(not(p), q)))), true), true, theorem(implies(and(not(p), q), and(not(p), q))), true), true, theorem(equivalent(and(not(p), q), and(not(p), q))), true)
% 0.60/0.55 = { by axiom 3 (ifeq_axiom) R->L }
% 0.60/0.55 ifeq(ifeq(ifeq(theorem(implies(implies(and(not(p), q), or(implies(and(not(p), q), and(not(p), q)), and(not(p), q))), or(implies(and(not(p), q), and(not(p), q)), implies(and(not(p), q), and(not(p), q))))), true, ifeq(true, true, theorem(or(implies(and(not(p), q), and(not(p), q)), implies(and(not(p), q), and(not(p), q)))), true), true), true, theorem(implies(and(not(p), q), and(not(p), q))), true), true, theorem(equivalent(and(not(p), q), and(not(p), q))), true)
% 0.60/0.55 = { by axiom 7 (rule_1) R->L }
% 0.60/0.55 ifeq(ifeq(ifeq(theorem(implies(implies(and(not(p), q), or(implies(and(not(p), q), and(not(p), q)), and(not(p), q))), or(implies(and(not(p), q), and(not(p), q)), implies(and(not(p), q), and(not(p), q))))), true, ifeq(ifeq(axiom(implies(and(not(p), q), or(implies(and(not(p), q), and(not(p), q)), and(not(p), q)))), true, theorem(implies(and(not(p), q), or(implies(and(not(p), q), and(not(p), q)), and(not(p), q)))), true), true, theorem(or(implies(and(not(p), q), and(not(p), q)), implies(and(not(p), q), and(not(p), q)))), true), true), true, theorem(implies(and(not(p), q), and(not(p), q))), true), true, theorem(equivalent(and(not(p), q), and(not(p), q))), true)
% 0.60/0.55 = { by axiom 4 (axiom_1_3) }
% 0.60/0.55 ifeq(ifeq(ifeq(theorem(implies(implies(and(not(p), q), or(implies(and(not(p), q), and(not(p), q)), and(not(p), q))), or(implies(and(not(p), q), and(not(p), q)), implies(and(not(p), q), and(not(p), q))))), true, ifeq(ifeq(true, true, theorem(implies(and(not(p), q), or(implies(and(not(p), q), and(not(p), q)), and(not(p), q)))), true), true, theorem(or(implies(and(not(p), q), and(not(p), q)), implies(and(not(p), q), and(not(p), q)))), true), true), true, theorem(implies(and(not(p), q), and(not(p), q))), true), true, theorem(equivalent(and(not(p), q), and(not(p), q))), true)
% 0.60/0.55 = { by axiom 3 (ifeq_axiom) }
% 0.60/0.55 ifeq(ifeq(ifeq(theorem(implies(implies(and(not(p), q), or(implies(and(not(p), q), and(not(p), q)), and(not(p), q))), or(implies(and(not(p), q), and(not(p), q)), implies(and(not(p), q), and(not(p), q))))), true, ifeq(theorem(implies(and(not(p), q), or(implies(and(not(p), q), and(not(p), q)), and(not(p), q)))), true, theorem(or(implies(and(not(p), q), and(not(p), q)), implies(and(not(p), q), and(not(p), q)))), true), true), true, theorem(implies(and(not(p), q), and(not(p), q))), true), true, theorem(equivalent(and(not(p), q), and(not(p), q))), true)
% 0.60/0.55 = { by axiom 10 (rule_2) }
% 0.60/0.55 ifeq(ifeq(true, true, theorem(implies(and(not(p), q), and(not(p), q))), true), true, theorem(equivalent(and(not(p), q), and(not(p), q))), true)
% 0.60/0.55 = { by axiom 3 (ifeq_axiom) }
% 0.60/0.55 ifeq(theorem(implies(and(not(p), q), and(not(p), q))), true, theorem(equivalent(and(not(p), q), and(not(p), q))), true)
% 0.60/0.55 = { by axiom 3 (ifeq_axiom) R->L }
% 0.60/0.55 ifeq(true, true, ifeq(theorem(implies(and(not(p), q), and(not(p), q))), true, theorem(equivalent(and(not(p), q), and(not(p), q))), true), true)
% 0.60/0.55 = { by axiom 10 (rule_2) R->L }
% 0.60/0.55 ifeq(ifeq(theorem(implies(or(equivalent(and(not(p), q), and(not(p), q)), not(implies(and(not(p), q), and(not(p), q)))), or(not(implies(and(not(p), q), and(not(p), q))), equivalent(and(not(p), q), and(not(p), q))))), true, ifeq(theorem(or(equivalent(and(not(p), q), and(not(p), q)), not(implies(and(not(p), q), and(not(p), q))))), true, theorem(or(not(implies(and(not(p), q), and(not(p), q))), equivalent(and(not(p), q), and(not(p), q)))), true), true), true, ifeq(theorem(implies(and(not(p), q), and(not(p), q))), true, theorem(equivalent(and(not(p), q), and(not(p), q))), true), true)
% 0.60/0.55 = { by axiom 3 (ifeq_axiom) R->L }
% 0.60/0.55 ifeq(ifeq(ifeq(true, true, theorem(implies(or(equivalent(and(not(p), q), and(not(p), q)), not(implies(and(not(p), q), and(not(p), q)))), or(not(implies(and(not(p), q), and(not(p), q))), equivalent(and(not(p), q), and(not(p), q))))), true), true, ifeq(theorem(or(equivalent(and(not(p), q), and(not(p), q)), not(implies(and(not(p), q), and(not(p), q))))), true, theorem(or(not(implies(and(not(p), q), and(not(p), q))), equivalent(and(not(p), q), and(not(p), q)))), true), true), true, ifeq(theorem(implies(and(not(p), q), and(not(p), q))), true, theorem(equivalent(and(not(p), q), and(not(p), q))), true), true)
% 0.60/0.55 = { by axiom 8 (axiom_1_4) R->L }
% 0.60/0.55 ifeq(ifeq(ifeq(axiom(implies(or(equivalent(and(not(p), q), and(not(p), q)), not(implies(and(not(p), q), and(not(p), q)))), or(not(implies(and(not(p), q), and(not(p), q))), equivalent(and(not(p), q), and(not(p), q))))), true, theorem(implies(or(equivalent(and(not(p), q), and(not(p), q)), not(implies(and(not(p), q), and(not(p), q)))), or(not(implies(and(not(p), q), and(not(p), q))), equivalent(and(not(p), q), and(not(p), q))))), true), true, ifeq(theorem(or(equivalent(and(not(p), q), and(not(p), q)), not(implies(and(not(p), q), and(not(p), q))))), true, theorem(or(not(implies(and(not(p), q), and(not(p), q))), equivalent(and(not(p), q), and(not(p), q)))), true), true), true, ifeq(theorem(implies(and(not(p), q), and(not(p), q))), true, theorem(equivalent(and(not(p), q), and(not(p), q))), true), true)
% 0.60/0.55 = { by axiom 7 (rule_1) }
% 0.60/0.55 ifeq(ifeq(true, true, ifeq(theorem(or(equivalent(and(not(p), q), and(not(p), q)), not(implies(and(not(p), q), and(not(p), q))))), true, theorem(or(not(implies(and(not(p), q), and(not(p), q))), equivalent(and(not(p), q), and(not(p), q)))), true), true), true, ifeq(theorem(implies(and(not(p), q), and(not(p), q))), true, theorem(equivalent(and(not(p), q), and(not(p), q))), true), true)
% 0.60/0.55 = { by axiom 3 (ifeq_axiom) }
% 0.60/0.55 ifeq(ifeq(theorem(or(equivalent(and(not(p), q), and(not(p), q)), not(implies(and(not(p), q), and(not(p), q))))), true, theorem(or(not(implies(and(not(p), q), and(not(p), q))), equivalent(and(not(p), q), and(not(p), q)))), true), true, ifeq(theorem(implies(and(not(p), q), and(not(p), q))), true, theorem(equivalent(and(not(p), q), and(not(p), q))), true), true)
% 0.60/0.55 = { by axiom 6 (equivalent_defn) }
% 0.60/0.55 ifeq(ifeq(theorem(or(and(implies(and(not(p), q), and(not(p), q)), implies(and(not(p), q), and(not(p), q))), not(implies(and(not(p), q), and(not(p), q))))), true, theorem(or(not(implies(and(not(p), q), and(not(p), q))), equivalent(and(not(p), q), and(not(p), q)))), true), true, ifeq(theorem(implies(and(not(p), q), and(not(p), q))), true, theorem(equivalent(and(not(p), q), and(not(p), q))), true), true)
% 0.60/0.55 = { by lemma 11 R->L }
% 0.60/0.55 ifeq(ifeq(theorem(or(not(implies(implies(and(not(p), q), and(not(p), q)), not(implies(and(not(p), q), and(not(p), q))))), not(implies(and(not(p), q), and(not(p), q))))), true, theorem(or(not(implies(and(not(p), q), and(not(p), q))), equivalent(and(not(p), q), and(not(p), q)))), true), true, ifeq(theorem(implies(and(not(p), q), and(not(p), q))), true, theorem(equivalent(and(not(p), q), and(not(p), q))), true), true)
% 0.60/0.55 = { by axiom 1 (implies_definition) R->L }
% 0.60/0.55 ifeq(ifeq(theorem(implies(implies(implies(and(not(p), q), and(not(p), q)), not(implies(and(not(p), q), and(not(p), q)))), not(implies(and(not(p), q), and(not(p), q))))), true, theorem(or(not(implies(and(not(p), q), and(not(p), q))), equivalent(and(not(p), q), and(not(p), q)))), true), true, ifeq(theorem(implies(and(not(p), q), and(not(p), q))), true, theorem(equivalent(and(not(p), q), and(not(p), q))), true), true)
% 0.60/0.55 = { by axiom 1 (implies_definition) }
% 0.60/0.55 ifeq(ifeq(theorem(implies(or(not(implies(and(not(p), q), and(not(p), q))), not(implies(and(not(p), q), and(not(p), q)))), not(implies(and(not(p), q), and(not(p), q))))), true, theorem(or(not(implies(and(not(p), q), and(not(p), q))), equivalent(and(not(p), q), and(not(p), q)))), true), true, ifeq(theorem(implies(and(not(p), q), and(not(p), q))), true, theorem(equivalent(and(not(p), q), and(not(p), q))), true), true)
% 0.60/0.55 = { by axiom 3 (ifeq_axiom) R->L }
% 0.60/0.55 ifeq(ifeq(ifeq(true, true, theorem(implies(or(not(implies(and(not(p), q), and(not(p), q))), not(implies(and(not(p), q), and(not(p), q)))), not(implies(and(not(p), q), and(not(p), q))))), true), true, theorem(or(not(implies(and(not(p), q), and(not(p), q))), equivalent(and(not(p), q), and(not(p), q)))), true), true, ifeq(theorem(implies(and(not(p), q), and(not(p), q))), true, theorem(equivalent(and(not(p), q), and(not(p), q))), true), true)
% 0.60/0.55 = { by axiom 5 (axiom_1_2) R->L }
% 0.60/0.55 ifeq(ifeq(ifeq(axiom(implies(or(not(implies(and(not(p), q), and(not(p), q))), not(implies(and(not(p), q), and(not(p), q)))), not(implies(and(not(p), q), and(not(p), q))))), true, theorem(implies(or(not(implies(and(not(p), q), and(not(p), q))), not(implies(and(not(p), q), and(not(p), q)))), not(implies(and(not(p), q), and(not(p), q))))), true), true, theorem(or(not(implies(and(not(p), q), and(not(p), q))), equivalent(and(not(p), q), and(not(p), q)))), true), true, ifeq(theorem(implies(and(not(p), q), and(not(p), q))), true, theorem(equivalent(and(not(p), q), and(not(p), q))), true), true)
% 0.60/0.55 = { by axiom 7 (rule_1) }
% 0.60/0.55 ifeq(ifeq(true, true, theorem(or(not(implies(and(not(p), q), and(not(p), q))), equivalent(and(not(p), q), and(not(p), q)))), true), true, ifeq(theorem(implies(and(not(p), q), and(not(p), q))), true, theorem(equivalent(and(not(p), q), and(not(p), q))), true), true)
% 0.60/0.55 = { by axiom 3 (ifeq_axiom) }
% 0.60/0.55 ifeq(theorem(or(not(implies(and(not(p), q), and(not(p), q))), equivalent(and(not(p), q), and(not(p), q)))), true, ifeq(theorem(implies(and(not(p), q), and(not(p), q))), true, theorem(equivalent(and(not(p), q), and(not(p), q))), true), true)
% 0.60/0.55 = { by axiom 1 (implies_definition) R->L }
% 0.60/0.55 ifeq(theorem(implies(implies(and(not(p), q), and(not(p), q)), equivalent(and(not(p), q), and(not(p), q)))), true, ifeq(theorem(implies(and(not(p), q), and(not(p), q))), true, theorem(equivalent(and(not(p), q), and(not(p), q))), true), true)
% 0.60/0.55 = { by axiom 10 (rule_2) }
% 0.60/0.55 true
% 0.60/0.55 % SZS output end Proof
% 0.60/0.55
% 0.60/0.55 RESULT: Unsatisfiable (the axioms are contradictory).
%------------------------------------------------------------------------------