%------------------------------------------------------------------------------
% File : Twee---2.7
% Problem : LCL186-3 : TPTP v9.3.1. Released v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_twee /export/starexec/sandbox2/benchmark/theBenchmark.p
% Computer : n014.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.64s 0.90s
% Output : Proof 0.64s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : LCL186-3 : TPTP v9.3.1. Released v2.3.0.
% 0.00/0.07 % Command : run_twee /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.47 % Computer : n014.cluster.edu
% 0.19/0.47 % Model : x86_64 x86_64
% 0.19/0.47 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.19/0.47 % Memory : 8046.5625MB
% 0.19/0.47 % OS : Linux 6.8.0-71-generic
% 0.19/0.47 % CPULimit : 300
% 0.19/0.47 % WCLimit : 300
% 0.19/0.47 % DateTime : Sun Sep 27 15:25:16 UTC 2026
% 0.19/0.47 % CPUTime :
% 0.19/0.47 Running run_twee /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.64/0.90 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.64/0.90
% 0.64/0.90 % SZS status Unsatisfiable
% 0.64/0.90
% 0.64/0.93 % SZS output start Proof
% 0.64/0.93 Axiom 1 (implies_definition): implies(X, Y) = or(not(X), Y).
% 0.64/0.93 Axiom 2 (ifeq_axiom): ifeq(X, X, Y, Z) = Y.
% 0.64/0.93 Axiom 3 (axiom_1_3): axiom(implies(X, or(Y, X))) = true.
% 0.64/0.93 Axiom 4 (rule_1): ifeq(axiom(X), true, theorem(X), true) = true.
% 0.64/0.93 Axiom 5 (axiom_1_4): axiom(implies(or(X, Y), or(Y, X))) = true.
% 0.64/0.93 Axiom 6 (rule_2): ifeq(theorem(implies(X, Y)), true, ifeq(theorem(X), true, theorem(Y), true), true) = true.
% 0.64/0.93 Axiom 7 (axiom_1_6): axiom(implies(implies(X, Y), implies(or(Z, X), or(Z, Y)))) = true.
% 0.64/0.93
% 0.64/0.93 Goal 1 (prove_this): theorem(implies(not(p), implies(p, q))) = true.
% 0.64/0.93 Proof:
% 0.64/0.93 theorem(implies(not(p), implies(p, q)))
% 0.64/0.93 = { by axiom 1 (implies_definition) }
% 0.64/0.93 theorem(implies(not(p), or(not(p), q)))
% 0.64/0.93 = { by axiom 2 (ifeq_axiom) R->L }
% 0.64/0.93 ifeq(true, true, theorem(implies(not(p), or(not(p), q))), true)
% 0.64/0.93 = { by axiom 6 (rule_2) R->L }
% 0.64/0.93 ifeq(ifeq(theorem(implies(implies(or(q, not(p)), or(not(p), q)), implies(implies(not(p), or(q, not(p))), implies(not(p), or(not(p), q))))), true, ifeq(theorem(implies(or(q, not(p)), or(not(p), q))), true, theorem(implies(implies(not(p), or(q, not(p))), implies(not(p), or(not(p), q)))), true), true), true, theorem(implies(not(p), or(not(p), q))), true)
% 0.64/0.93 = { by axiom 2 (ifeq_axiom) R->L }
% 0.64/0.93 ifeq(ifeq(theorem(implies(implies(or(q, not(p)), or(not(p), q)), implies(implies(not(p), or(q, not(p))), implies(not(p), or(not(p), q))))), true, ifeq(ifeq(true, true, theorem(implies(or(q, not(p)), or(not(p), q))), true), true, theorem(implies(implies(not(p), or(q, not(p))), implies(not(p), or(not(p), q)))), true), true), true, theorem(implies(not(p), or(not(p), q))), true)
% 0.64/0.93 = { by axiom 5 (axiom_1_4) R->L }
% 0.64/0.93 ifeq(ifeq(theorem(implies(implies(or(q, not(p)), or(not(p), q)), implies(implies(not(p), or(q, not(p))), implies(not(p), or(not(p), q))))), true, ifeq(ifeq(axiom(implies(or(q, not(p)), or(not(p), q))), true, theorem(implies(or(q, not(p)), or(not(p), q))), true), true, theorem(implies(implies(not(p), or(q, not(p))), implies(not(p), or(not(p), q)))), true), true), true, theorem(implies(not(p), or(not(p), q))), true)
% 0.64/0.93 = { by axiom 4 (rule_1) }
% 0.64/0.93 ifeq(ifeq(theorem(implies(implies(or(q, not(p)), or(not(p), q)), implies(implies(not(p), or(q, not(p))), implies(not(p), or(not(p), q))))), true, ifeq(true, true, theorem(implies(implies(not(p), or(q, not(p))), implies(not(p), or(not(p), q)))), true), true), true, theorem(implies(not(p), or(not(p), q))), true)
% 0.64/0.93 = { by axiom 2 (ifeq_axiom) }
% 0.64/0.93 ifeq(ifeq(theorem(implies(implies(or(q, not(p)), or(not(p), q)), implies(implies(not(p), or(q, not(p))), implies(not(p), or(not(p), q))))), true, theorem(implies(implies(not(p), or(q, not(p))), implies(not(p), or(not(p), q)))), true), true, theorem(implies(not(p), or(not(p), q))), true)
% 0.64/0.93 = { by axiom 2 (ifeq_axiom) R->L }
% 0.64/0.93 ifeq(ifeq(ifeq(true, true, theorem(implies(implies(or(q, not(p)), or(not(p), q)), implies(implies(not(p), or(q, not(p))), implies(not(p), or(not(p), q))))), true), true, theorem(implies(implies(not(p), or(q, not(p))), implies(not(p), or(not(p), q)))), true), true, theorem(implies(not(p), or(not(p), q))), true)
% 0.64/0.94 = { by axiom 7 (axiom_1_6) R->L }
% 0.64/0.94 ifeq(ifeq(ifeq(axiom(implies(implies(or(q, not(p)), or(not(p), q)), implies(or(not(not(p)), or(q, not(p))), or(not(not(p)), or(not(p), q))))), true, theorem(implies(implies(or(q, not(p)), or(not(p), q)), implies(implies(not(p), or(q, not(p))), implies(not(p), or(not(p), q))))), true), true, theorem(implies(implies(not(p), or(q, not(p))), implies(not(p), or(not(p), q)))), true), true, theorem(implies(not(p), or(not(p), q))), true)
% 0.64/0.94 = { by axiom 1 (implies_definition) R->L }
% 0.64/0.94 ifeq(ifeq(ifeq(axiom(implies(implies(or(q, not(p)), or(not(p), q)), implies(implies(not(p), or(q, not(p))), or(not(not(p)), or(not(p), q))))), true, theorem(implies(implies(or(q, not(p)), or(not(p), q)), implies(implies(not(p), or(q, not(p))), implies(not(p), or(not(p), q))))), true), true, theorem(implies(implies(not(p), or(q, not(p))), implies(not(p), or(not(p), q)))), true), true, theorem(implies(not(p), or(not(p), q))), true)
% 0.64/0.94 = { by axiom 1 (implies_definition) R->L }
% 0.64/0.94 ifeq(ifeq(ifeq(axiom(implies(implies(or(q, not(p)), or(not(p), q)), implies(implies(not(p), or(q, not(p))), implies(not(p), or(not(p), q))))), true, theorem(implies(implies(or(q, not(p)), or(not(p), q)), implies(implies(not(p), or(q, not(p))), implies(not(p), or(not(p), q))))), true), true, theorem(implies(implies(not(p), or(q, not(p))), implies(not(p), or(not(p), q)))), true), true, theorem(implies(not(p), or(not(p), q))), true)
% 0.64/0.94 = { by axiom 4 (rule_1) }
% 0.64/0.94 ifeq(ifeq(true, true, theorem(implies(implies(not(p), or(q, not(p))), implies(not(p), or(not(p), q)))), true), true, theorem(implies(not(p), or(not(p), q))), true)
% 0.64/0.94 = { by axiom 2 (ifeq_axiom) }
% 0.64/0.94 ifeq(theorem(implies(implies(not(p), or(q, not(p))), implies(not(p), or(not(p), q)))), true, theorem(implies(not(p), or(not(p), q))), true)
% 0.64/0.94 = { by axiom 2 (ifeq_axiom) R->L }
% 0.64/0.94 ifeq(theorem(implies(implies(not(p), or(q, not(p))), implies(not(p), or(not(p), q)))), true, ifeq(true, true, theorem(implies(not(p), or(not(p), q))), true), true)
% 0.64/0.94 = { by axiom 4 (rule_1) R->L }
% 0.64/0.94 ifeq(theorem(implies(implies(not(p), or(q, not(p))), implies(not(p), or(not(p), q)))), true, ifeq(ifeq(axiom(implies(not(p), or(q, not(p)))), true, theorem(implies(not(p), or(q, not(p)))), true), true, theorem(implies(not(p), or(not(p), q))), true), true)
% 0.64/0.94 = { by axiom 3 (axiom_1_3) }
% 0.64/0.94 ifeq(theorem(implies(implies(not(p), or(q, not(p))), implies(not(p), or(not(p), q)))), true, ifeq(ifeq(true, true, theorem(implies(not(p), or(q, not(p)))), true), true, theorem(implies(not(p), or(not(p), q))), true), true)
% 0.64/0.94 = { by axiom 2 (ifeq_axiom) }
% 0.64/0.94 ifeq(theorem(implies(implies(not(p), or(q, not(p))), implies(not(p), or(not(p), q)))), true, ifeq(theorem(implies(not(p), or(q, not(p)))), true, theorem(implies(not(p), or(not(p), q))), true), true)
% 0.64/0.94 = { by axiom 6 (rule_2) }
% 0.64/0.94 true
% 0.64/0.94 % SZS output end Proof
% 0.64/0.94
% 0.64/0.94 RESULT: Unsatisfiable (the axioms are contradictory).
%------------------------------------------------------------------------------