%------------------------------------------------------------------------------
% File : Twee---2.7
% Problem : LCL207-1 : TPTP v9.3.1. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_twee /export/starexec/sandbox/benchmark/theBenchmark.p
% Computer : n009.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:20 AM UTC 2026
% Result : Unsatisfiable 1.65s 0.70s
% Output : Proof 1.65s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL207-1 : TPTP v9.3.1. Released v1.1.0.
% 0.00/0.06 % Command : run_twee /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.17/0.44 % Computer : n009.cluster.edu
% 0.17/0.44 % Model : x86_64 x86_64
% 0.17/0.44 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.44 % Memory : 8046.5625MB
% 0.17/0.44 % OS : Linux 6.8.0-71-generic
% 0.17/0.44 % CPULimit : 300
% 0.17/0.44 % WCLimit : 300
% 0.17/0.44 % DateTime : Sun Sep 27 15:26:59 UTC 2026
% 0.17/0.45 % CPUTime :
% 0.17/0.45 Running run_twee /export/starexec/sandbox/benchmark/theBenchmark.p
% 1.65/0.70 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
% 1.65/0.70
% 1.65/0.70 % SZS status Unsatisfiable
% 1.65/0.70
% 1.65/0.71 % SZS output start Proof
% 1.65/0.71 Axiom 1 (ifeq_axiom): ifeq(X, X, Y, Z) = Y.
% 1.65/0.71 Axiom 2 (axiom_1_3): axiom(or(not(X), or(Y, X))) = true.
% 1.65/0.71 Axiom 3 (rule_1): ifeq(axiom(X), true, theorem(X), true) = true.
% 1.65/0.71 Axiom 4 (axiom_1_4): axiom(or(not(or(X, Y)), or(Y, X))) = true.
% 1.65/0.71 Axiom 5 (axiom_1_5): axiom(or(not(or(X, or(Y, Z))), or(Y, or(X, Z)))) = true.
% 1.65/0.71 Axiom 6 (rule_2): ifeq(theorem(X), true, ifeq(axiom(or(not(X), Y)), true, theorem(Y), true), true) = true.
% 1.65/0.72 Axiom 7 (rule_3): ifeq(theorem(or(not(X), Y)), true, ifeq(axiom(or(not(Z), X)), true, theorem(or(not(Z), Y)), true), true) = true.
% 1.65/0.72
% 1.65/0.72 Goal 1 (prove_this): theorem(or(not(not(or(not(p), q))), or(not(q), p))) = true.
% 1.65/0.72 Proof:
% 1.65/0.72 theorem(or(not(not(or(not(p), q))), or(not(q), p)))
% 1.65/0.72 = { by axiom 1 (ifeq_axiom) R->L }
% 1.65/0.72 ifeq(true, true, theorem(or(not(not(or(not(p), q))), or(not(q), p))), true)
% 1.65/0.72 = { by axiom 7 (rule_3) R->L }
% 1.65/0.72 ifeq(ifeq(theorem(or(not(or(not(p), q)), or(not(not(or(not(p), q))), p))), true, ifeq(axiom(or(not(q), or(not(p), q))), true, theorem(or(not(q), or(not(not(or(not(p), q))), p))), true), true), true, theorem(or(not(not(or(not(p), q))), or(not(q), p))), true)
% 1.65/0.72 = { by axiom 2 (axiom_1_3) }
% 1.65/0.72 ifeq(ifeq(theorem(or(not(or(not(p), q)), or(not(not(or(not(p), q))), p))), true, ifeq(true, true, theorem(or(not(q), or(not(not(or(not(p), q))), p))), true), true), true, theorem(or(not(not(or(not(p), q))), or(not(q), p))), true)
% 1.65/0.72 = { by axiom 1 (ifeq_axiom) }
% 1.65/0.72 ifeq(ifeq(theorem(or(not(or(not(p), q)), or(not(not(or(not(p), q))), p))), true, theorem(or(not(q), or(not(not(or(not(p), q))), p))), true), true, theorem(or(not(not(or(not(p), q))), or(not(q), p))), true)
% 1.65/0.72 = { by axiom 1 (ifeq_axiom) R->L }
% 1.65/0.72 ifeq(ifeq(ifeq(true, true, theorem(or(not(or(not(p), q)), or(not(not(or(not(p), q))), p))), true), true, theorem(or(not(q), or(not(not(or(not(p), q))), p))), true), true, theorem(or(not(not(or(not(p), q))), or(not(q), p))), true)
% 1.65/0.72 = { by axiom 7 (rule_3) R->L }
% 1.65/0.72 ifeq(ifeq(ifeq(ifeq(theorem(or(not(or(p, not(or(not(p), q)))), or(not(or(not(p), q)), p))), true, ifeq(axiom(or(not(not(or(not(p), q))), or(p, not(or(not(p), q))))), true, theorem(or(not(not(or(not(p), q))), or(not(or(not(p), q)), p))), true), true), true, theorem(or(not(or(not(p), q)), or(not(not(or(not(p), q))), p))), true), true, theorem(or(not(q), or(not(not(or(not(p), q))), p))), true), true, theorem(or(not(not(or(not(p), q))), or(not(q), p))), true)
% 1.65/0.72 = { by axiom 2 (axiom_1_3) }
% 1.65/0.72 ifeq(ifeq(ifeq(ifeq(theorem(or(not(or(p, not(or(not(p), q)))), or(not(or(not(p), q)), p))), true, ifeq(true, true, theorem(or(not(not(or(not(p), q))), or(not(or(not(p), q)), p))), true), true), true, theorem(or(not(or(not(p), q)), or(not(not(or(not(p), q))), p))), true), true, theorem(or(not(q), or(not(not(or(not(p), q))), p))), true), true, theorem(or(not(not(or(not(p), q))), or(not(q), p))), true)
% 1.65/0.72 = { by axiom 1 (ifeq_axiom) }
% 1.65/0.72 ifeq(ifeq(ifeq(ifeq(theorem(or(not(or(p, not(or(not(p), q)))), or(not(or(not(p), q)), p))), true, theorem(or(not(not(or(not(p), q))), or(not(or(not(p), q)), p))), true), true, theorem(or(not(or(not(p), q)), or(not(not(or(not(p), q))), p))), true), true, theorem(or(not(q), or(not(not(or(not(p), q))), p))), true), true, theorem(or(not(not(or(not(p), q))), or(not(q), p))), true)
% 1.65/0.72 = { by axiom 1 (ifeq_axiom) R->L }
% 1.65/0.72 ifeq(ifeq(ifeq(ifeq(ifeq(true, true, theorem(or(not(or(p, not(or(not(p), q)))), or(not(or(not(p), q)), p))), true), true, theorem(or(not(not(or(not(p), q))), or(not(or(not(p), q)), p))), true), true, theorem(or(not(or(not(p), q)), or(not(not(or(not(p), q))), p))), true), true, theorem(or(not(q), or(not(not(or(not(p), q))), p))), true), true, theorem(or(not(not(or(not(p), q))), or(not(q), p))), true)
% 1.65/0.72 = { by axiom 4 (axiom_1_4) R->L }
% 1.65/0.72 ifeq(ifeq(ifeq(ifeq(ifeq(axiom(or(not(or(p, not(or(not(p), q)))), or(not(or(not(p), q)), p))), true, theorem(or(not(or(p, not(or(not(p), q)))), or(not(or(not(p), q)), p))), true), true, theorem(or(not(not(or(not(p), q))), or(not(or(not(p), q)), p))), true), true, theorem(or(not(or(not(p), q)), or(not(not(or(not(p), q))), p))), true), true, theorem(or(not(q), or(not(not(or(not(p), q))), p))), true), true, theorem(or(not(not(or(not(p), q))), or(not(q), p))), true)
% 1.65/0.72 = { by axiom 3 (rule_1) }
% 1.65/0.72 ifeq(ifeq(ifeq(ifeq(true, true, theorem(or(not(not(or(not(p), q))), or(not(or(not(p), q)), p))), true), true, theorem(or(not(or(not(p), q)), or(not(not(or(not(p), q))), p))), true), true, theorem(or(not(q), or(not(not(or(not(p), q))), p))), true), true, theorem(or(not(not(or(not(p), q))), or(not(q), p))), true)
% 1.65/0.73 = { by axiom 1 (ifeq_axiom) }
% 1.65/0.73 ifeq(ifeq(ifeq(theorem(or(not(not(or(not(p), q))), or(not(or(not(p), q)), p))), true, theorem(or(not(or(not(p), q)), or(not(not(or(not(p), q))), p))), true), true, theorem(or(not(q), or(not(not(or(not(p), q))), p))), true), true, theorem(or(not(not(or(not(p), q))), or(not(q), p))), true)
% 1.65/0.73 = { by axiom 1 (ifeq_axiom) R->L }
% 1.65/0.73 ifeq(ifeq(ifeq(theorem(or(not(not(or(not(p), q))), or(not(or(not(p), q)), p))), true, ifeq(true, true, theorem(or(not(or(not(p), q)), or(not(not(or(not(p), q))), p))), true), true), true, theorem(or(not(q), or(not(not(or(not(p), q))), p))), true), true, theorem(or(not(not(or(not(p), q))), or(not(q), p))), true)
% 1.65/0.73 = { by axiom 5 (axiom_1_5) R->L }
% 1.65/0.73 ifeq(ifeq(ifeq(theorem(or(not(not(or(not(p), q))), or(not(or(not(p), q)), p))), true, ifeq(axiom(or(not(or(not(not(or(not(p), q))), or(not(or(not(p), q)), p))), or(not(or(not(p), q)), or(not(not(or(not(p), q))), p)))), true, theorem(or(not(or(not(p), q)), or(not(not(or(not(p), q))), p))), true), true), true, theorem(or(not(q), or(not(not(or(not(p), q))), p))), true), true, theorem(or(not(not(or(not(p), q))), or(not(q), p))), true)
% 1.65/0.73 = { by axiom 6 (rule_2) }
% 1.65/0.73 ifeq(ifeq(true, true, theorem(or(not(q), or(not(not(or(not(p), q))), p))), true), true, theorem(or(not(not(or(not(p), q))), or(not(q), p))), true)
% 1.65/0.73 = { by axiom 1 (ifeq_axiom) }
% 1.65/0.73 ifeq(theorem(or(not(q), or(not(not(or(not(p), q))), p))), true, theorem(or(not(not(or(not(p), q))), or(not(q), p))), true)
% 1.65/0.73 = { by axiom 1 (ifeq_axiom) R->L }
% 1.65/0.73 ifeq(theorem(or(not(q), or(not(not(or(not(p), q))), p))), true, ifeq(true, true, theorem(or(not(not(or(not(p), q))), or(not(q), p))), true), true)
% 1.65/0.73 = { by axiom 5 (axiom_1_5) R->L }
% 1.65/0.73 ifeq(theorem(or(not(q), or(not(not(or(not(p), q))), p))), true, ifeq(axiom(or(not(or(not(q), or(not(not(or(not(p), q))), p))), or(not(not(or(not(p), q))), or(not(q), p)))), true, theorem(or(not(not(or(not(p), q))), or(not(q), p))), true), true)
% 1.65/0.73 = { by axiom 6 (rule_2) }
% 1.65/0.73 true
% 1.65/0.73 % SZS output end Proof
% 1.65/0.73
% 1.65/0.73 RESULT: Unsatisfiable (the axioms are contradictory).
%------------------------------------------------------------------------------