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