0.07/0.12	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.07/0.13	% Command    : twee %s --tstp --casc --quiet --explain-encoding --conditional-encoding if --smaller --drop-non-horn
0.13/0.34	% Computer   : n015.cluster.edu
0.13/0.34	% Model      : x86_64 x86_64
0.13/0.34	% CPU        : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.13/0.34	% Memory     : 8042.1875MB
0.13/0.34	% OS         : Linux 3.10.0-693.el7.x86_64
0.13/0.34	% CPULimit   : 180
0.13/0.34	% DateTime   : Thu Aug 29 12:28:37 EDT 2019
0.13/0.34	% CPUTime    : 
20.24/20.46	% SZS status Unsatisfiable
20.24/20.46	
20.24/20.46	% SZS output start Proof
20.24/20.46	Take the following subset of the input axioms:
20.24/20.47	  fof(ax2_3147, axiom, ifeq4(mtvisible(c_tptp_member3356_mt), true, marriagelicensedocument(c_tptpmarriagelicensedocument), true)=true).
20.24/20.47	  fof(goal, negated_conjecture, a!=b).
20.24/20.47	  fof(ifeq_axiom, axiom, ![B, A, C]: B=ifeq4(A, A, B, C)).
20.24/20.47	  fof(ifeq_axiom_001, axiom, ![B, A, C]: B=ifeq3(A, A, B, C)).
20.24/20.47	  fof(query151, negated_conjecture, true=mtvisible(c_tptp_member3356_mt)).
20.24/20.47	  fof(query151_1, negated_conjecture, ![X]: b=ifeq3(marriagelicensedocument(X), true, a, b)).
20.24/20.47	
20.24/20.47	Now clausify the problem and encode Horn clauses using encoding 3 of
20.24/20.47	http://www.cse.chalmers.se/~nicsma/papers/horn.pdf.
20.24/20.47	We repeatedly replace C & s=t => u=v by the two clauses:
20.24/20.47	  fresh(y, y, x1...xn) = u
20.24/20.47	  C => fresh(s, t, x1...xn) = v
20.24/20.47	where fresh is a fresh function symbol and x1..xn are the free
20.24/20.47	variables of u and v.
20.24/20.47	A predicate p(X) is encoded as p(X)=true (this is sound, because the
20.24/20.47	input problem has no model of domain size 1).
20.24/20.47	
20.24/20.47	The encoding turns the above axioms into the following unit equations and goals:
20.24/20.47	
20.24/20.47	Axiom 1 (query151): true = mtvisible(c_tptp_member3356_mt).
20.24/20.47	Axiom 2 (ax2_3147): ifeq4(mtvisible(c_tptp_member3356_mt), true, marriagelicensedocument(c_tptpmarriagelicensedocument), true) = true.
20.24/20.47	Axiom 3 (query151_1): b = ifeq3(marriagelicensedocument(X), true, a, b).
20.24/20.47	Axiom 4 (ifeq_axiom_001): X = ifeq3(Y, Y, X, Z).
20.24/20.47	Axiom 5 (ifeq_axiom): X = ifeq4(Y, Y, X, Z).
20.24/20.47	
20.24/20.47	Goal 1 (goal): a = b.
20.24/20.47	Proof:
20.24/20.47	  a
20.24/20.47	= { by axiom 4 (ifeq_axiom_001) }
20.24/20.47	  ifeq3(true, true, a, b)
20.24/20.47	= { by axiom 2 (ax2_3147) }
20.24/20.47	  ifeq3(ifeq4(mtvisible(c_tptp_member3356_mt), true, marriagelicensedocument(c_tptpmarriagelicensedocument), true), true, a, b)
20.24/20.47	= { by axiom 1 (query151) }
20.24/20.47	  ifeq3(ifeq4(true, true, marriagelicensedocument(c_tptpmarriagelicensedocument), true), true, a, b)
20.24/20.47	= { by axiom 5 (ifeq_axiom) }
20.24/20.47	  ifeq3(marriagelicensedocument(c_tptpmarriagelicensedocument), true, a, b)
20.24/20.47	= { by axiom 3 (query151_1) }
20.24/20.47	  b
20.24/20.47	% SZS output end Proof
20.24/20.47	
20.24/20.47	RESULT: Unsatisfiable (the axioms are contradictory).
20.32/20.53	EOF