%------------------------------------------------------------------------------
% File     : Twee---2.4.2
% Problem  : LCL186-10 : TPTP v8.1.2. Released v7.5.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : parallel-twee %s --tstp --conditional-encoding if --smaller --drop-non-horn --give-up-on-saturation --explain-encoding --formal-proof

% Computer : n007.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Thu Aug 31 08:17:51 EDT 2023

% Result   : Unsatisfiable 0.24s 0.44s
% Output   : Proof 0.24s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.15  % Problem  : LCL186-10 : TPTP v8.1.2. Released v7.5.0.
% 0.15/0.16  % Command  : parallel-twee %s --tstp --conditional-encoding if --smaller --drop-non-horn --give-up-on-saturation --explain-encoding --formal-proof
% 0.16/0.37  % Computer : n007.cluster.edu
% 0.16/0.37  % Model    : x86_64 x86_64
% 0.16/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.37  % Memory   : 8042.1875MB
% 0.16/0.37  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.16/0.37  % CPULimit : 300
% 0.16/0.37  % WCLimit  : 300
% 0.16/0.37  % DateTime : Fri Aug 25 04:12:25 EDT 2023
% 0.16/0.38  % CPUTime  : 
% 0.24/0.44  Command-line arguments: --set-join --lhs-weight 1 --no-flatten-goal --complete-subsets --goal-heuristic
% 0.24/0.44  
% 0.24/0.44  % SZS status Unsatisfiable
% 0.24/0.44  
% 0.24/0.44  % SZS output start Proof
% 0.24/0.44  Axiom 1 (ifeq_axiom): ifeq(X, X, Y, Z) = Y.
% 0.24/0.44  Axiom 2 (rule_1): ifeq(axiom(X), true, theorem(X), true) = true.
% 0.24/0.44  Axiom 3 (axiom_1_3): axiom(or(not(X), or(Y, X))) = true.
% 0.24/0.44  Axiom 4 (axiom_1_4): axiom(or(not(or(X, Y)), or(Y, X))) = true.
% 0.24/0.44  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.24/0.44  
% 0.24/0.44  Goal 1 (prove_this): theorem(or(not(not(p)), or(not(p), q))) = true.
% 0.24/0.44  Proof:
% 0.24/0.44    theorem(or(not(not(p)), or(not(p), q)))
% 0.24/0.44  = { by axiom 1 (ifeq_axiom) R->L }
% 0.24/0.44    ifeq(true, true, theorem(or(not(not(p)), or(not(p), q))), true)
% 0.24/0.44  = { by axiom 2 (rule_1) R->L }
% 0.24/0.44    ifeq(ifeq(axiom(or(not(or(q, not(p))), or(not(p), q))), true, theorem(or(not(or(q, not(p))), or(not(p), q))), true), true, theorem(or(not(not(p)), or(not(p), q))), true)
% 0.24/0.44  = { by axiom 4 (axiom_1_4) }
% 0.24/0.44    ifeq(ifeq(true, true, theorem(or(not(or(q, not(p))), or(not(p), q))), true), true, theorem(or(not(not(p)), or(not(p), q))), true)
% 0.24/0.44  = { by axiom 1 (ifeq_axiom) }
% 0.24/0.44    ifeq(theorem(or(not(or(q, not(p))), or(not(p), q))), true, theorem(or(not(not(p)), or(not(p), q))), true)
% 0.24/0.44  = { by axiom 1 (ifeq_axiom) R->L }
% 0.24/0.44    ifeq(theorem(or(not(or(q, not(p))), or(not(p), q))), true, ifeq(true, true, theorem(or(not(not(p)), or(not(p), q))), true), true)
% 0.24/0.44  = { by axiom 3 (axiom_1_3) R->L }
% 0.24/0.44    ifeq(theorem(or(not(or(q, not(p))), or(not(p), q))), true, ifeq(axiom(or(not(not(p)), or(q, not(p)))), true, theorem(or(not(not(p)), or(not(p), q))), true), true)
% 0.24/0.44  = { by axiom 5 (rule_3) }
% 0.24/0.44    true
% 0.24/0.44  % SZS output end Proof
% 0.24/0.44  
% 0.24/0.44  RESULT: Unsatisfiable (the axioms are contradictory).
%------------------------------------------------------------------------------