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