0.00/0.06	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.00/0.07	% Command    : twee %s --tstp --casc --quiet --conditional-encoding if --smaller --drop-non-horn
0.02/0.37	% Computer   : n148.star.cs.uiowa.edu
0.02/0.37	% Model      : x86_64 x86_64
0.02/0.37	% CPU        : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz
0.02/0.37	% Memory     : 32218.625MB
0.02/0.37	% OS         : Linux 3.10.0-693.2.2.el7.x86_64
0.02/0.37	% CPULimit   : 300
0.02/0.37	% DateTime   : Fri Jul 13 14:53:00 CDT 2018
0.02/0.37	% CPUTime    : 
94.89/95.37	% SZS status Theorem
94.89/95.37	
94.89/95.37	% SZS output start Proof
94.89/95.37	Take the following subset of the input axioms:
94.89/95.37	  fof(ax2_908, axiom, individual(c_tptptptpcol_16_25985)).
94.89/95.37	  fof(query128, conjecture,
94.89/95.37	      individual(c_tptptptpcol_16_25985)
94.89/95.37	        <= mtvisible(c_tptp_member2089_mt)).
94.89/95.37	
94.89/95.37	Now clausify the problem and encode Horn clauses using encoding 3 of
94.89/95.37	http://www.cse.chalmers.se/~nicsma/papers/horn.pdf.
94.89/95.37	We repeatedly replace C & s=t => u=v by the two clauses:
94.89/95.37	  $$fresh(y, y, x1...xn) = u
94.89/95.37	  C => $$fresh(s, t, x1...xn) = v
94.89/95.37	where $$fresh is a fresh function symbol and x1..xn are the free
94.89/95.37	variables of u and v.
94.89/95.37	A predicate p(X) is encoded as p(X)=$$true (this is sound, because the
94.89/95.37	input problem has no model of domain size 1).
94.89/95.37	
94.89/95.37	The encoding turns the above axioms into the following unit equations and goals:
94.89/95.37	
94.89/95.37	Axiom 8738 (ax2_908): individual(c_tptptptpcol_16_25985) = $$true2.
94.89/95.37	
94.89/95.37	Goal 1 (query128_1): individual(c_tptptptpcol_16_25985) = $$true2.
94.89/95.37	Proof:
94.89/95.37	  individual(c_tptptptpcol_16_25985)
94.89/95.37	= { by axiom 8738 (ax2_908) }
94.89/95.37	  $$true2
94.89/95.37	% SZS output end Proof
94.89/95.37	
94.89/95.37	RESULT: Theorem (the conjecture is true).
95.09/95.60	EOF