0.05/0.11	% Problem  : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.05/0.11	% Command  : parallel-twee %s --tstp --conditional-encoding if --smaller --drop-non-horn --give-up-on-saturation --explain-encoding --formal-proof
0.11/0.32	% Computer : n021.cluster.edu
0.11/0.32	% Model    : x86_64 x86_64
0.11/0.32	% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.11/0.32	% Memory   : 8042.1875MB
0.11/0.32	% OS       : Linux 3.10.0-693.el7.x86_64
0.11/0.32	% CPULimit : 960
0.11/0.32	% WCLimit  : 120
0.11/0.32	% DateTime : Tue Aug  9 01:58:05 EDT 2022
0.11/0.32	% CPUTime  : 
0.11/0.34	% SZS status Unsatisfiable
0.11/0.34	
0.11/0.34	% SZS output start Proof
0.11/0.34	Axiom 1 (m_definition): apply(X, X) = apply(m, X).
0.11/0.34	Axiom 2 (b_definition): apply(X, apply(Y, Z)) = apply(apply(apply(b, X), Y), Z).
0.11/0.34	
0.11/0.34	Goal 1 (prove_fixed_point): X = apply(combinator, X).
0.11/0.34	The goal is true when:
0.11/0.34	  X = apply(m, apply(apply(b, combinator), m))
0.11/0.34	
0.11/0.34	Proof:
0.11/0.34	  apply(m, apply(apply(b, combinator), m))
0.11/0.34	= { by axiom 1 (m_definition) R->L }
0.11/0.34	  apply(apply(apply(b, combinator), m), apply(apply(b, combinator), m))
0.11/0.34	= { by axiom 2 (b_definition) R->L }
0.11/0.34	  apply(combinator, apply(m, apply(apply(b, combinator), m)))
0.11/0.34	% SZS output end Proof
0.11/0.34	
0.11/0.34	RESULT: Unsatisfiable (the axioms are contradictory).
0.11/0.34	EOF