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