TSTP Solution File: COL015-1 by Twee---2.4.2

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Twee---2.4.2
% Problem  : COL015-1 : TPTP v8.1.2. Released v1.0.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 : n001.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 : Wed Aug 30 18:31:39 EDT 2023

% Result   : Unsatisfiable 0.20s 0.39s
% Output   : Proof 0.20s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13  % Problem  : COL015-1 : TPTP v8.1.2. Released v1.0.0.
% 0.00/0.14  % Command  : parallel-twee %s --tstp --conditional-encoding if --smaller --drop-non-horn --give-up-on-saturation --explain-encoding --formal-proof
% 0.17/0.35  % Computer : n001.cluster.edu
% 0.17/0.35  % Model    : x86_64 x86_64
% 0.17/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.35  % Memory   : 8042.1875MB
% 0.17/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.17/0.35  % CPULimit : 300
% 0.17/0.35  % WCLimit  : 300
% 0.17/0.35  % DateTime : Sun Aug 27 04:31:02 EDT 2023
% 0.17/0.35  % CPUTime  : 
% 0.20/0.39  Command-line arguments: --flip-ordering --lhs-weight 1 --depth-weight 60 --distributivity-heuristic
% 0.20/0.39  
% 0.20/0.39  % SZS status Unsatisfiable
% 0.20/0.39  
% 0.20/0.39  % SZS output start Proof
% 0.20/0.39  Axiom 1 (m_definition): apply(m, X) = apply(X, X).
% 0.20/0.39  Axiom 2 (q_definition): apply(apply(apply(q, X), Y), Z) = apply(Y, apply(X, Z)).
% 0.20/0.39  
% 0.20/0.39  Goal 1 (prove_fixed_point): X = apply(combinator, X).
% 0.20/0.39  The goal is true when:
% 0.20/0.39    X = apply(m, apply(apply(q, m), combinator))
% 0.20/0.39  
% 0.20/0.39  Proof:
% 0.20/0.39    apply(m, apply(apply(q, m), combinator))
% 0.20/0.39  = { by axiom 1 (m_definition) }
% 0.20/0.39    apply(apply(apply(q, m), combinator), apply(apply(q, m), combinator))
% 0.20/0.39  = { by axiom 2 (q_definition) }
% 0.20/0.39    apply(combinator, apply(m, apply(apply(q, m), combinator)))
% 0.20/0.39  % SZS output end Proof
% 0.20/0.39  
% 0.20/0.39  RESULT: Unsatisfiable (the axioms are contradictory).
%------------------------------------------------------------------------------