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