%------------------------------------------------------------------------------
% File : Twee---2.7
% Problem : LCL211-1 : TPTP v9.3.1. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_twee /export/starexec/sandbox2/benchmark/theBenchmark.p
% Computer : n010.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:21 AM UTC 2026
% Result : Unsatisfiable 214.01s 27.45s
% Output : Proof 214.01s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL211-1 : TPTP v9.3.1. Released v1.1.0.
% 0.00/0.04 % Command : run_twee /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.12/0.37 % Computer : n010.cluster.edu
% 0.12/0.37 % Model : x86_64 x86_64
% 0.12/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.37 % Memory : 8046.5625MB
% 0.12/0.37 % OS : Linux 6.8.0-71-generic
% 0.12/0.37 % CPULimit : 300
% 0.12/0.37 % WCLimit : 300
% 0.12/0.37 % DateTime : Sun Sep 27 15:27:01 UTC 2026
% 0.12/0.37 % CPUTime :
% 0.12/0.37 Running run_twee /export/starexec/sandbox2/benchmark/theBenchmark.p
% 214.01/27.45 Command-line arguments: --lhs-weight 1 --flip-ordering --normalise-queue-percent 10 --cp-renormalise-threshold 10 --complete-subsets --ground-joining-incomplete-limit 15 --flatten-regeneralise
% 214.01/27.45
% 214.01/27.45 % SZS status Unsatisfiable
% 214.01/27.45
% 214.01/27.46 % SZS output start Proof
% 214.01/27.46 Axiom 1 (ifeq_axiom): ifeq(X, X, Y, Z) = Y.
% 214.01/27.46 Axiom 2 (axiom_1_3): axiom(or(not(X), or(Y, X))) = true.
% 214.01/27.46 Axiom 3 (axiom_1_2): axiom(or(not(or(X, X)), X)) = true.
% 214.01/27.46 Axiom 4 (rule_1): ifeq(axiom(X), true, theorem(X), true) = true.
% 214.01/27.46 Axiom 5 (axiom_1_4): axiom(or(not(or(X, Y)), or(Y, X))) = true.
% 214.01/27.46 Axiom 6 (axiom_1_6): axiom(or(not(or(not(X), Y)), or(not(or(Z, X)), or(Z, Y)))) = true.
% 214.01/27.46 Axiom 7 (rule_2): ifeq(theorem(X), true, ifeq(axiom(or(not(X), Y)), true, theorem(Y), true), true) = true.
% 214.01/27.47 Axiom 8 (rule_3): ifeq(theorem(or(not(X), Y)), true, ifeq(axiom(or(not(Z), X)), true, theorem(or(not(Z), Y)), true), true) = true.
% 214.01/27.47
% 214.01/27.47 Goal 1 (prove_this): theorem(or(not(not(q)), or(not(or(p, q)), p))) = true.
% 214.01/27.47 Proof:
% 214.01/27.47 theorem(or(not(not(q)), or(not(or(p, q)), p)))
% 214.01/27.47 = { by axiom 1 (ifeq_axiom) R->L }
% 214.01/27.47 ifeq(true, true, theorem(or(not(not(q)), or(not(or(p, q)), p))), true)
% 214.01/27.47 = { by axiom 8 (rule_3) R->L }
% 214.01/27.47 ifeq(ifeq(theorem(or(not(or(not(q), p)), or(not(or(p, q)), p))), true, ifeq(axiom(or(not(or(p, not(q))), or(not(q), p))), true, theorem(or(not(or(p, not(q))), or(not(or(p, q)), p))), true), true), true, theorem(or(not(not(q)), or(not(or(p, q)), p))), true)
% 214.01/27.47 = { by axiom 5 (axiom_1_4) }
% 214.01/27.47 ifeq(ifeq(theorem(or(not(or(not(q), p)), or(not(or(p, q)), p))), true, ifeq(true, true, theorem(or(not(or(p, not(q))), or(not(or(p, q)), p))), true), true), true, theorem(or(not(not(q)), or(not(or(p, q)), p))), true)
% 214.01/27.47 = { by axiom 1 (ifeq_axiom) }
% 214.01/27.47 ifeq(ifeq(theorem(or(not(or(not(q), p)), or(not(or(p, q)), p))), true, theorem(or(not(or(p, not(q))), or(not(or(p, q)), p))), true), true, theorem(or(not(not(q)), or(not(or(p, q)), p))), true)
% 214.01/27.47 = { by axiom 1 (ifeq_axiom) R->L }
% 214.01/27.47 ifeq(ifeq(ifeq(true, true, theorem(or(not(or(not(q), p)), or(not(or(p, q)), p))), true), true, theorem(or(not(or(p, not(q))), or(not(or(p, q)), p))), true), true, theorem(or(not(not(q)), or(not(or(p, q)), p))), true)
% 214.01/27.47 = { by axiom 6 (axiom_1_6) R->L }
% 214.01/27.47 ifeq(ifeq(ifeq(axiom(or(not(or(not(q), p)), or(not(or(p, q)), or(p, p)))), true, theorem(or(not(or(not(q), p)), or(not(or(p, q)), p))), true), true, theorem(or(not(or(p, not(q))), or(not(or(p, q)), p))), true), true, theorem(or(not(not(q)), or(not(or(p, q)), p))), true)
% 214.01/27.47 = { by axiom 1 (ifeq_axiom) R->L }
% 214.01/27.47 ifeq(ifeq(ifeq(true, true, ifeq(axiom(or(not(or(not(q), p)), or(not(or(p, q)), or(p, p)))), true, theorem(or(not(or(not(q), p)), or(not(or(p, q)), p))), true), true), true, theorem(or(not(or(p, not(q))), or(not(or(p, q)), p))), true), true, theorem(or(not(not(q)), or(not(or(p, q)), p))), true)
% 214.01/27.47 = { by axiom 7 (rule_2) R->L }
% 214.01/27.47 ifeq(ifeq(ifeq(ifeq(theorem(or(not(or(p, p)), p)), true, ifeq(axiom(or(not(or(not(or(p, p)), p)), or(not(or(not(or(p, q)), or(p, p))), or(not(or(p, q)), p)))), true, theorem(or(not(or(not(or(p, q)), or(p, p))), or(not(or(p, q)), p))), true), true), true, ifeq(axiom(or(not(or(not(q), p)), or(not(or(p, q)), or(p, p)))), true, theorem(or(not(or(not(q), p)), or(not(or(p, q)), p))), true), true), true, theorem(or(not(or(p, not(q))), or(not(or(p, q)), p))), true), true, theorem(or(not(not(q)), or(not(or(p, q)), p))), true)
% 214.01/27.47 = { by axiom 6 (axiom_1_6) }
% 214.01/27.47 ifeq(ifeq(ifeq(ifeq(theorem(or(not(or(p, p)), p)), true, ifeq(true, true, theorem(or(not(or(not(or(p, q)), or(p, p))), or(not(or(p, q)), p))), true), true), true, ifeq(axiom(or(not(or(not(q), p)), or(not(or(p, q)), or(p, p)))), true, theorem(or(not(or(not(q), p)), or(not(or(p, q)), p))), true), true), true, theorem(or(not(or(p, not(q))), or(not(or(p, q)), p))), true), true, theorem(or(not(not(q)), or(not(or(p, q)), p))), true)
% 214.01/27.47 = { by axiom 1 (ifeq_axiom) }
% 214.01/27.47 ifeq(ifeq(ifeq(ifeq(theorem(or(not(or(p, p)), p)), true, theorem(or(not(or(not(or(p, q)), or(p, p))), or(not(or(p, q)), p))), true), true, ifeq(axiom(or(not(or(not(q), p)), or(not(or(p, q)), or(p, p)))), true, theorem(or(not(or(not(q), p)), or(not(or(p, q)), p))), true), true), true, theorem(or(not(or(p, not(q))), or(not(or(p, q)), p))), true), true, theorem(or(not(not(q)), or(not(or(p, q)), p))), true)
% 214.01/27.47 = { by axiom 1 (ifeq_axiom) R->L }
% 214.01/27.48 ifeq(ifeq(ifeq(ifeq(ifeq(true, true, theorem(or(not(or(p, p)), p)), true), true, theorem(or(not(or(not(or(p, q)), or(p, p))), or(not(or(p, q)), p))), true), true, ifeq(axiom(or(not(or(not(q), p)), or(not(or(p, q)), or(p, p)))), true, theorem(or(not(or(not(q), p)), or(not(or(p, q)), p))), true), true), true, theorem(or(not(or(p, not(q))), or(not(or(p, q)), p))), true), true, theorem(or(not(not(q)), or(not(or(p, q)), p))), true)
% 214.01/27.48 = { by axiom 3 (axiom_1_2) R->L }
% 214.01/27.48 ifeq(ifeq(ifeq(ifeq(ifeq(axiom(or(not(or(p, p)), p)), true, theorem(or(not(or(p, p)), p)), true), true, theorem(or(not(or(not(or(p, q)), or(p, p))), or(not(or(p, q)), p))), true), true, ifeq(axiom(or(not(or(not(q), p)), or(not(or(p, q)), or(p, p)))), true, theorem(or(not(or(not(q), p)), or(not(or(p, q)), p))), true), true), true, theorem(or(not(or(p, not(q))), or(not(or(p, q)), p))), true), true, theorem(or(not(not(q)), or(not(or(p, q)), p))), true)
% 214.01/27.48 = { by axiom 4 (rule_1) }
% 214.01/27.48 ifeq(ifeq(ifeq(ifeq(true, true, theorem(or(not(or(not(or(p, q)), or(p, p))), or(not(or(p, q)), p))), true), true, ifeq(axiom(or(not(or(not(q), p)), or(not(or(p, q)), or(p, p)))), true, theorem(or(not(or(not(q), p)), or(not(or(p, q)), p))), true), true), true, theorem(or(not(or(p, not(q))), or(not(or(p, q)), p))), true), true, theorem(or(not(not(q)), or(not(or(p, q)), p))), true)
% 214.01/27.48 = { by axiom 1 (ifeq_axiom) }
% 214.01/27.48 ifeq(ifeq(ifeq(theorem(or(not(or(not(or(p, q)), or(p, p))), or(not(or(p, q)), p))), true, ifeq(axiom(or(not(or(not(q), p)), or(not(or(p, q)), or(p, p)))), true, theorem(or(not(or(not(q), p)), or(not(or(p, q)), p))), true), true), true, theorem(or(not(or(p, not(q))), or(not(or(p, q)), p))), true), true, theorem(or(not(not(q)), or(not(or(p, q)), p))), true)
% 214.01/27.48 = { by axiom 8 (rule_3) }
% 214.01/27.48 ifeq(ifeq(true, true, theorem(or(not(or(p, not(q))), or(not(or(p, q)), p))), true), true, theorem(or(not(not(q)), or(not(or(p, q)), p))), true)
% 214.01/27.48 = { by axiom 1 (ifeq_axiom) }
% 214.01/27.48 ifeq(theorem(or(not(or(p, not(q))), or(not(or(p, q)), p))), true, theorem(or(not(not(q)), or(not(or(p, q)), p))), true)
% 214.01/27.48 = { by axiom 1 (ifeq_axiom) R->L }
% 214.01/27.48 ifeq(theorem(or(not(or(p, not(q))), or(not(or(p, q)), p))), true, ifeq(true, true, theorem(or(not(not(q)), or(not(or(p, q)), p))), true), true)
% 214.01/27.48 = { by axiom 2 (axiom_1_3) R->L }
% 214.01/27.48 ifeq(theorem(or(not(or(p, not(q))), or(not(or(p, q)), p))), true, ifeq(axiom(or(not(not(q)), or(p, not(q)))), true, theorem(or(not(not(q)), or(not(or(p, q)), p))), true), true)
% 214.01/27.48 = { by axiom 8 (rule_3) }
% 214.01/27.48 true
% 214.01/27.48 % SZS output end Proof
% 214.01/27.48
% 214.01/27.48 RESULT: Unsatisfiable (the axioms are contradictory).
%------------------------------------------------------------------------------