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