0.00/0.04 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.00/0.04 % Command : twee %s --tstp --casc --quiet --conditional-encoding if --smaller --drop-non-horn 0.03/0.24 % Computer : n024.star.cs.uiowa.edu 0.03/0.24 % Model : x86_64 x86_64 0.03/0.24 % CPU : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz 0.03/0.24 % Memory : 32218.625MB 0.03/0.24 % OS : Linux 3.10.0-693.2.2.el7.x86_64 0.03/0.24 % CPULimit : 300 0.03/0.24 % DateTime : Sat Jul 14 04:32:55 CDT 2018 0.03/0.24 % CPUTime : 94.85/95.12 % SZS status Theorem 94.85/95.12 94.85/95.12 % SZS output start Proof 94.85/95.12 Take the following subset of the input axioms: 94.85/95.13 fof(ax2_1215, axiom, 94.85/95.13 genls(c_tptpcol_16_30972, c_tptpcol_15_30970)). 94.85/95.13 fof(query143, conjecture, 94.85/95.13 mtvisible(c_tptp_member2862_mt) 94.85/95.13 => genls(c_tptpcol_16_30972, c_tptpcol_15_30970)). 94.85/95.13 94.85/95.13 Now clausify the problem and encode Horn clauses using encoding 3 of 94.85/95.13 http://www.cse.chalmers.se/~nicsma/papers/horn.pdf. 94.85/95.13 We repeatedly replace C & s=t => u=v by the two clauses: 94.85/95.13 $$fresh(y, y, x1...xn) = u 94.85/95.13 C => $$fresh(s, t, x1...xn) = v 94.85/95.13 where $$fresh is a fresh function symbol and x1..xn are the free 94.85/95.13 variables of u and v. 94.85/95.13 A predicate p(X) is encoded as p(X)=$$true (this is sound, because the 94.85/95.13 input problem has no model of domain size 1). 94.85/95.13 94.85/95.13 The encoding turns the above axioms into the following unit equations and goals: 94.85/95.13 94.85/95.13 Axiom 7558 (ax2_1215): genls(c_tptpcol_16_30972, c_tptpcol_15_30970) = $$true2. 94.85/95.13 94.85/95.13 Goal 1 (query143_1): genls(c_tptpcol_16_30972, c_tptpcol_15_30970) = $$true2. 94.85/95.13 Proof: 94.85/95.13 genls(c_tptpcol_16_30972, c_tptpcol_15_30970) 94.85/95.13 = { by axiom 7558 (ax2_1215) } 94.85/95.13 $$true2 94.85/95.13 % SZS output end Proof 94.85/95.13 94.85/95.13 RESULT: Theorem (the conjecture is true). 95.13/95.33 EOF