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