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