TSTP Solution File: SWV487+1 by Drodi---3.6.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.6.0
% Problem : SWV487+1 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% Computer : n009.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Tue Apr 30 20:47:13 EDT 2024
% Result : Theorem 2.62s 0.70s
% Output : CNFRefutation 2.62s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWV487+1 : TPTP v8.1.2. Released v4.0.0.
% 0.07/0.13 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.13/0.34 % Computer : n009.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 : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Tue Apr 30 00:39:41 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.13/0.35 % Drodi V3.6.0
% 2.62/0.70 % Refutation found
% 2.62/0.70 % SZS status Theorem for theBenchmark: Theorem is valid
% 2.62/0.70 % SZS output start CNFRefutation for theBenchmark
% 2.62/0.70 fof(f1,axiom,(
% 2.62/0.70 (! [I,J] :( int_leq(I,J)<=> ( int_less(I,J)| I = J ) ) )),
% 2.62/0.70 file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 2.62/0.70 fof(f2,axiom,(
% 2.62/0.70 (! [I,J,K] :( ( int_less(I,J)& int_less(J,K) )=> int_less(I,K) ) )),
% 2.62/0.70 file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 2.62/0.70 fof(f3,axiom,(
% 2.62/0.70 (! [I,J] :( int_less(I,J)=> I != J ) )),
% 2.62/0.70 file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 2.62/0.70 fof(f4,axiom,(
% 2.62/0.70 (! [I,J] :( int_less(I,J)| int_leq(J,I) ) )),
% 2.62/0.70 file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 2.62/0.70 fof(f6,axiom,(
% 2.62/0.70 (! [I,J] : plus(I,J) = plus(J,I) )),
% 2.62/0.70 file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 2.62/0.70 fof(f7,axiom,(
% 2.62/0.70 (! [I] : plus(I,int_zero) = I )),
% 2.62/0.70 file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 2.62/0.70 fof(f9,axiom,(
% 2.62/0.70 (! [I,J] :( int_less(I,J)<=> (? [K] :( plus(I,K) = J& int_less(int_zero,K) ) )) )),
% 2.62/0.70 file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 2.62/0.70 fof(f10,axiom,(
% 2.62/0.70 (! [I] :( int_less(int_zero,I)<=> int_leq(int_one,I) ) )),
% 2.62/0.70 file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 2.62/0.70 fof(f12,hypothesis,(
% 2.62/0.70 (! [I,J] :( ( int_leq(int_one,I)& int_leq(I,n)& int_leq(int_one,J)& int_leq(J,n) )=> ( (! [C] :( ( int_less(int_zero,C)& I = plus(J,C) )=> (! [K] :( ( int_leq(int_one,K)& int_leq(K,J) )=> a(plus(K,C),K) = real_zero ) )))& (! [C] :( ( int_leq(int_zero,C)& J = plus(I,C) )=> (! [K] :( ( int_leq(int_one,K)& int_leq(K,I) )=> a(K,plus(K,C)) = lu(K,plus(K,C)) ) )) )) ) )),
% 2.62/0.70 file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 2.62/0.70 fof(f13,conjecture,(
% 2.62/0.70 (! [I,J] :( ( int_leq(int_one,J)& int_less(J,I)& int_leq(I,n) )=> a(I,J) = real_zero ) )),
% 2.62/0.70 file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 2.62/0.70 fof(f14,negated_conjecture,(
% 2.62/0.70 ~((! [I,J] :( ( int_leq(int_one,J)& int_less(J,I)& int_leq(I,n) )=> a(I,J) = real_zero ) ))),
% 2.62/0.70 inference(negated_conjecture,[status(cth)],[f13])).
% 2.62/0.70 fof(f15,plain,(
% 2.62/0.70 ![I,J]: ((~int_leq(I,J)|(int_less(I,J)|I=J))&(int_leq(I,J)|(~int_less(I,J)&~I=J)))),
% 2.62/0.70 inference(NNF_transformation,[status(esa)],[f1])).
% 2.62/0.70 fof(f16,plain,(
% 2.62/0.70 (![I,J]: (~int_leq(I,J)|(int_less(I,J)|I=J)))&(![I,J]: (int_leq(I,J)|(~int_less(I,J)&~I=J)))),
% 2.62/0.70 inference(miniscoping,[status(esa)],[f15])).
% 2.62/0.70 fof(f17,plain,(
% 2.62/0.70 ![X0,X1]: (~int_leq(X0,X1)|int_less(X0,X1)|X0=X1)),
% 2.62/0.70 inference(cnf_transformation,[status(esa)],[f16])).
% 2.62/0.70 fof(f18,plain,(
% 2.62/0.70 ![X0,X1]: (int_leq(X0,X1)|~int_less(X0,X1))),
% 2.62/0.70 inference(cnf_transformation,[status(esa)],[f16])).
% 2.62/0.70 fof(f19,plain,(
% 2.62/0.70 ![X0,X1]: (int_leq(X0,X1)|~X0=X1)),
% 2.62/0.70 inference(cnf_transformation,[status(esa)],[f16])).
% 2.62/0.70 fof(f20,plain,(
% 2.62/0.70 ![I,J,K]: ((~int_less(I,J)|~int_less(J,K))|int_less(I,K))),
% 2.62/0.70 inference(pre_NNF_transformation,[status(esa)],[f2])).
% 2.62/0.70 fof(f21,plain,(
% 2.62/0.70 ![I,K]: ((![J]: (~int_less(I,J)|~int_less(J,K)))|int_less(I,K))),
% 2.62/0.70 inference(miniscoping,[status(esa)],[f20])).
% 2.62/0.70 fof(f22,plain,(
% 2.62/0.70 ![X0,X1,X2]: (~int_less(X0,X1)|~int_less(X1,X2)|int_less(X0,X2))),
% 2.62/0.70 inference(cnf_transformation,[status(esa)],[f21])).
% 2.62/0.70 fof(f23,plain,(
% 2.62/0.70 ![I,J]: (~int_less(I,J)|~I=J)),
% 2.62/0.70 inference(pre_NNF_transformation,[status(esa)],[f3])).
% 2.62/0.70 fof(f24,plain,(
% 2.62/0.70 ![X0,X1]: (~int_less(X0,X1)|~X0=X1)),
% 2.62/0.70 inference(cnf_transformation,[status(esa)],[f23])).
% 2.62/0.70 fof(f25,plain,(
% 2.62/0.70 ![X0,X1]: (int_less(X0,X1)|int_leq(X1,X0))),
% 2.62/0.70 inference(cnf_transformation,[status(esa)],[f4])).
% 2.62/0.70 fof(f27,plain,(
% 2.62/0.70 ![X0,X1]: (plus(X0,X1)=plus(X1,X0))),
% 2.62/0.70 inference(cnf_transformation,[status(esa)],[f6])).
% 2.62/0.70 fof(f28,plain,(
% 2.62/0.70 ![X0]: (plus(X0,int_zero)=X0)),
% 2.62/0.70 inference(cnf_transformation,[status(esa)],[f7])).
% 2.62/0.70 fof(f31,plain,(
% 2.62/0.70 ![I,J]: ((~int_less(I,J)|(?[K]: (plus(I,K)=J&int_less(int_zero,K))))&(int_less(I,J)|(![K]: (~plus(I,K)=J|~int_less(int_zero,K)))))),
% 2.62/0.70 inference(NNF_transformation,[status(esa)],[f9])).
% 2.62/0.70 fof(f32,plain,(
% 2.62/0.70 (![I,J]: (~int_less(I,J)|(?[K]: (plus(I,K)=J&int_less(int_zero,K)))))&(![I,J]: (int_less(I,J)|(![K]: (~plus(I,K)=J|~int_less(int_zero,K)))))),
% 2.62/0.70 inference(miniscoping,[status(esa)],[f31])).
% 2.62/0.70 fof(f33,plain,(
% 2.62/0.70 (![I,J]: (~int_less(I,J)|(plus(I,sk0_0(J,I))=J&int_less(int_zero,sk0_0(J,I)))))&(![I,J]: (int_less(I,J)|(![K]: (~plus(I,K)=J|~int_less(int_zero,K)))))),
% 2.62/0.70 inference(skolemization,[status(esa)],[f32])).
% 2.62/0.70 fof(f34,plain,(
% 2.62/0.70 ![X0,X1]: (~int_less(X0,X1)|plus(X0,sk0_0(X1,X0))=X1)),
% 2.62/0.70 inference(cnf_transformation,[status(esa)],[f33])).
% 2.62/0.70 fof(f35,plain,(
% 2.62/0.70 ![X0,X1]: (~int_less(X0,X1)|int_less(int_zero,sk0_0(X1,X0)))),
% 2.62/0.70 inference(cnf_transformation,[status(esa)],[f33])).
% 2.62/0.70 fof(f36,plain,(
% 2.62/0.70 ![X0,X1,X2]: (int_less(X0,X1)|~plus(X0,X2)=X1|~int_less(int_zero,X2))),
% 2.62/0.70 inference(cnf_transformation,[status(esa)],[f33])).
% 2.62/0.70 fof(f37,plain,(
% 2.62/0.70 ![I]: ((~int_less(int_zero,I)|int_leq(int_one,I))&(int_less(int_zero,I)|~int_leq(int_one,I)))),
% 2.62/0.70 inference(NNF_transformation,[status(esa)],[f10])).
% 2.62/0.70 fof(f38,plain,(
% 2.62/0.70 (![I]: (~int_less(int_zero,I)|int_leq(int_one,I)))&(![I]: (int_less(int_zero,I)|~int_leq(int_one,I)))),
% 2.62/0.70 inference(miniscoping,[status(esa)],[f37])).
% 2.62/0.70 fof(f39,plain,(
% 2.62/0.70 ![X0]: (~int_less(int_zero,X0)|int_leq(int_one,X0))),
% 2.62/0.70 inference(cnf_transformation,[status(esa)],[f38])).
% 2.62/0.70 fof(f40,plain,(
% 2.62/0.70 ![X0]: (int_less(int_zero,X0)|~int_leq(int_one,X0))),
% 2.62/0.70 inference(cnf_transformation,[status(esa)],[f38])).
% 2.62/0.70 fof(f42,plain,(
% 2.62/0.70 ![I,J]: ((((~int_leq(int_one,I)|~int_leq(I,n))|~int_leq(int_one,J))|~int_leq(J,n))|((![C]: ((~int_less(int_zero,C)|~I=plus(J,C))|(![K]: ((~int_leq(int_one,K)|~int_leq(K,J))|a(plus(K,C),K)=real_zero))))&(![C]: ((~int_leq(int_zero,C)|~J=plus(I,C))|(![K]: ((~int_leq(int_one,K)|~int_leq(K,I))|a(K,plus(K,C))=lu(K,plus(K,C))))))))),
% 2.62/0.70 inference(pre_NNF_transformation,[status(esa)],[f12])).
% 2.62/0.70 fof(f43,plain,(
% 2.62/0.70 ![X0,X1,X2,X3]: (~int_leq(int_one,X0)|~int_leq(X0,n)|~int_leq(int_one,X1)|~int_leq(X1,n)|~int_less(int_zero,X2)|~X0=plus(X1,X2)|~int_leq(int_one,X3)|~int_leq(X3,X1)|a(plus(X3,X2),X3)=real_zero)),
% 2.62/0.70 inference(cnf_transformation,[status(esa)],[f42])).
% 2.62/0.70 fof(f45,plain,(
% 2.62/0.70 (?[I,J]: (((int_leq(int_one,J)&int_less(J,I))&int_leq(I,n))&~a(I,J)=real_zero))),
% 2.62/0.70 inference(pre_NNF_transformation,[status(esa)],[f14])).
% 2.62/0.70 fof(f46,plain,(
% 2.62/0.70 (((int_leq(int_one,sk0_2)&int_less(sk0_2,sk0_1))&int_leq(sk0_1,n))&~a(sk0_1,sk0_2)=real_zero)),
% 2.62/0.70 inference(skolemization,[status(esa)],[f45])).
% 2.62/0.70 fof(f47,plain,(
% 2.62/0.70 int_leq(int_one,sk0_2)),
% 2.62/0.70 inference(cnf_transformation,[status(esa)],[f46])).
% 2.62/0.70 fof(f48,plain,(
% 2.62/0.70 int_less(sk0_2,sk0_1)),
% 2.62/0.70 inference(cnf_transformation,[status(esa)],[f46])).
% 2.62/0.70 fof(f49,plain,(
% 2.62/0.70 int_leq(sk0_1,n)),
% 2.62/0.70 inference(cnf_transformation,[status(esa)],[f46])).
% 2.62/0.70 fof(f50,plain,(
% 2.62/0.70 ~a(sk0_1,sk0_2)=real_zero),
% 2.62/0.70 inference(cnf_transformation,[status(esa)],[f46])).
% 2.62/0.70 fof(f51,plain,(
% 2.62/0.70 ![X0]: (int_leq(X0,X0))),
% 2.62/0.70 inference(destructive_equality_resolution,[status(esa)],[f19])).
% 2.62/0.70 fof(f52,plain,(
% 2.62/0.70 ![X0]: (~int_less(X0,X0))),
% 2.62/0.70 inference(destructive_equality_resolution,[status(esa)],[f24])).
% 2.62/0.70 fof(f53,plain,(
% 2.62/0.70 ![X0,X1]: (int_less(X0,plus(X0,X1))|~int_less(int_zero,X1))),
% 2.62/0.70 inference(destructive_equality_resolution,[status(esa)],[f36])).
% 2.62/0.70 fof(f54,plain,(
% 2.62/0.70 ![X0,X1,X2]: (~int_leq(int_one,plus(X0,X1))|~int_leq(plus(X0,X1),n)|~int_leq(int_one,X0)|~int_leq(X0,n)|~int_less(int_zero,X1)|~int_leq(int_one,X2)|~int_leq(X2,X0)|a(plus(X2,X1),X2)=real_zero)),
% 2.62/0.70 inference(destructive_equality_resolution,[status(esa)],[f43])).
% 2.62/0.70 fof(f56,plain,(
% 2.62/0.70 spl0_0 <=> int_less(sk0_1,n)),
% 2.62/0.70 introduced(split_symbol_definition)).
% 2.62/0.70 fof(f57,plain,(
% 2.62/0.70 int_less(sk0_1,n)|~spl0_0),
% 2.62/0.70 inference(component_clause,[status(thm)],[f56])).
% 2.62/0.70 fof(f59,plain,(
% 2.62/0.70 spl0_1 <=> sk0_1=n),
% 2.62/0.70 introduced(split_symbol_definition)).
% 2.62/0.70 fof(f60,plain,(
% 2.62/0.70 sk0_1=n|~spl0_1),
% 2.62/0.70 inference(component_clause,[status(thm)],[f59])).
% 2.62/0.70 fof(f62,plain,(
% 2.62/0.70 int_less(sk0_1,n)|sk0_1=n),
% 2.62/0.70 inference(resolution,[status(thm)],[f17,f49])).
% 2.62/0.70 fof(f63,plain,(
% 2.62/0.70 spl0_0|spl0_1),
% 2.62/0.70 inference(split_clause,[status(thm)],[f62,f56,f59])).
% 2.62/0.70 fof(f76,plain,(
% 2.62/0.70 spl0_5 <=> sk0_2=sk0_1),
% 2.62/0.70 introduced(split_symbol_definition)).
% 2.62/0.70 fof(f77,plain,(
% 2.62/0.70 sk0_2=sk0_1|~spl0_5),
% 2.62/0.70 inference(component_clause,[status(thm)],[f76])).
% 2.62/0.70 fof(f86,plain,(
% 2.62/0.70 ![X0]: (~int_less(sk0_1,X0)|int_less(sk0_2,X0))),
% 2.62/0.70 inference(resolution,[status(thm)],[f22,f48])).
% 2.62/0.70 fof(f114,plain,(
% 2.62/0.70 spl0_8 <=> int_less(int_zero,int_zero)),
% 2.62/0.70 introduced(split_symbol_definition)).
% 2.62/0.70 fof(f115,plain,(
% 2.62/0.70 int_less(int_zero,int_zero)|~spl0_8),
% 2.62/0.70 inference(component_clause,[status(thm)],[f114])).
% 2.62/0.70 fof(f127,plain,(
% 2.62/0.70 ![X0]: (X0=plus(int_zero,X0))),
% 2.62/0.70 inference(paramodulation,[status(thm)],[f28,f27])).
% 2.62/0.70 fof(f130,plain,(
% 2.62/0.70 ![X0,X1,X2]: (~int_leq(int_one,plus(X0,X1))|~int_leq(plus(X1,X0),n)|~int_leq(int_one,X0)|~int_leq(X0,n)|~int_less(int_zero,X1)|~int_leq(int_one,X2)|~int_leq(X2,X0)|a(plus(X2,X1),X2)=real_zero)),
% 2.62/0.70 inference(paramodulation,[status(thm)],[f27,f54])).
% 2.62/0.70 fof(f158,plain,(
% 2.62/0.70 int_less(int_zero,sk0_2)),
% 2.62/0.70 inference(resolution,[status(thm)],[f40,f47])).
% 2.62/0.70 fof(f174,plain,(
% 2.62/0.70 ![X0]: (~int_less(sk0_2,X0)|int_less(int_zero,X0))),
% 2.62/0.70 inference(resolution,[status(thm)],[f158,f22])).
% 2.62/0.70 fof(f221,plain,(
% 2.62/0.70 plus(int_zero,sk0_0(sk0_2,int_zero))=sk0_2),
% 2.62/0.70 inference(resolution,[status(thm)],[f34,f158])).
% 2.62/0.70 fof(f222,plain,(
% 2.62/0.70 sk0_0(sk0_2,int_zero)=sk0_2),
% 2.62/0.70 inference(forward_demodulation,[status(thm)],[f127,f221])).
% 2.62/0.70 fof(f225,plain,(
% 2.62/0.70 plus(sk0_2,sk0_0(sk0_1,sk0_2))=sk0_1),
% 2.62/0.70 inference(resolution,[status(thm)],[f34,f48])).
% 2.62/0.70 fof(f226,plain,(
% 2.62/0.70 plus(sk0_0(sk0_1,sk0_2),sk0_2)=sk0_1),
% 2.62/0.70 inference(forward_demodulation,[status(thm)],[f27,f225])).
% 2.62/0.70 fof(f232,plain,(
% 2.62/0.70 int_less(int_zero,sk0_0(sk0_2,int_zero))),
% 2.62/0.70 inference(resolution,[status(thm)],[f35,f158])).
% 2.62/0.70 fof(f234,plain,(
% 2.62/0.70 int_less(int_zero,sk0_0(sk0_1,sk0_2))),
% 2.62/0.70 inference(resolution,[status(thm)],[f35,f48])).
% 2.62/0.70 fof(f238,plain,(
% 2.62/0.70 ![X0,X1]: (int_less(int_zero,sk0_0(X0,X1))|int_leq(X0,X1))),
% 2.62/0.70 inference(resolution,[status(thm)],[f35,f25])).
% 2.62/0.70 fof(f246,plain,(
% 2.62/0.70 int_less(sk0_2,n)|~spl0_0),
% 2.62/0.70 inference(resolution,[status(thm)],[f57,f86])).
% 2.62/0.70 fof(f399,plain,(
% 2.62/0.70 int_leq(sk0_2,n)|~spl0_0),
% 2.62/0.70 inference(resolution,[status(thm)],[f246,f18])).
% 2.62/0.70 fof(f474,plain,(
% 2.62/0.70 spl0_33 <=> int_leq(int_one,sk0_2)),
% 2.62/0.70 introduced(split_symbol_definition)).
% 2.62/0.70 fof(f476,plain,(
% 2.62/0.70 ~int_leq(int_one,sk0_2)|spl0_33),
% 2.62/0.70 inference(component_clause,[status(thm)],[f474])).
% 2.62/0.70 fof(f511,plain,(
% 2.62/0.70 spl0_36 <=> int_leq(sk0_2,n)),
% 2.62/0.70 introduced(split_symbol_definition)).
% 2.62/0.70 fof(f531,plain,(
% 2.62/0.70 int_less(int_zero,sk0_2)),
% 2.62/0.70 inference(forward_demodulation,[status(thm)],[f222,f232])).
% 2.62/0.70 fof(f554,plain,(
% 2.62/0.70 int_leq(int_zero,sk0_0(sk0_1,sk0_2))),
% 2.62/0.70 inference(resolution,[status(thm)],[f234,f18])).
% 2.62/0.70 fof(f555,plain,(
% 2.62/0.70 spl0_40 <=> int_leq(sk0_2,sk0_2)),
% 2.62/0.70 introduced(split_symbol_definition)).
% 2.62/0.70 fof(f557,plain,(
% 2.62/0.70 ~int_leq(sk0_2,sk0_2)|spl0_40),
% 2.62/0.70 inference(component_clause,[status(thm)],[f555])).
% 2.62/0.70 fof(f586,plain,(
% 2.62/0.70 spl0_41 <=> int_less(sk0_2,sk0_2)),
% 2.62/0.70 introduced(split_symbol_definition)).
% 2.62/0.70 fof(f587,plain,(
% 2.62/0.70 int_less(sk0_2,sk0_2)|~spl0_41),
% 2.62/0.70 inference(component_clause,[status(thm)],[f586])).
% 2.62/0.70 fof(f594,plain,(
% 2.62/0.70 $false|~spl0_41),
% 2.62/0.70 inference(forward_subsumption_resolution,[status(thm)],[f587,f52])).
% 2.62/0.70 fof(f595,plain,(
% 2.62/0.70 ~spl0_41),
% 2.62/0.70 inference(contradiction_clause,[status(thm)],[f594])).
% 2.62/0.70 fof(f601,plain,(
% 2.62/0.70 ![X0]: (int_less(X0,plus(X0,sk0_2)))),
% 2.62/0.70 inference(resolution,[status(thm)],[f53,f531])).
% 2.62/0.70 fof(f1434,plain,(
% 2.62/0.70 $false|~spl0_8),
% 2.62/0.70 inference(forward_subsumption_resolution,[status(thm)],[f115,f52])).
% 2.62/0.70 fof(f1435,plain,(
% 2.62/0.70 ~spl0_8),
% 2.62/0.70 inference(contradiction_clause,[status(thm)],[f1434])).
% 2.62/0.70 fof(f1514,plain,(
% 2.62/0.70 int_less(sk0_2,n)|~spl0_1),
% 2.62/0.70 inference(forward_demodulation,[status(thm)],[f60,f48])).
% 2.62/0.70 fof(f1521,plain,(
% 2.62/0.70 int_leq(sk0_2,n)|~spl0_1),
% 2.62/0.70 inference(resolution,[status(thm)],[f1514,f18])).
% 2.62/0.70 fof(f1522,plain,(
% 2.62/0.70 spl0_36|~spl0_1),
% 2.62/0.70 inference(split_clause,[status(thm)],[f1521,f511,f59])).
% 2.62/0.70 fof(f1940,plain,(
% 2.62/0.70 spl0_36|~spl0_0),
% 2.62/0.70 inference(split_clause,[status(thm)],[f399,f511,f56])).
% 2.62/0.70 fof(f1966,plain,(
% 2.62/0.70 int_less(int_zero,sk0_1)),
% 2.62/0.70 inference(resolution,[status(thm)],[f48,f174])).
% 2.62/0.70 fof(f1978,plain,(
% 2.62/0.70 int_leq(int_one,sk0_1)),
% 2.62/0.70 inference(resolution,[status(thm)],[f1966,f39])).
% 2.62/0.70 fof(f1988,plain,(
% 2.62/0.70 spl0_98 <=> int_leq(sk0_1,n)),
% 2.62/0.70 introduced(split_symbol_definition)).
% 2.62/0.70 fof(f1990,plain,(
% 2.62/0.70 ~int_leq(sk0_1,n)|spl0_98),
% 2.62/0.70 inference(component_clause,[status(thm)],[f1988])).
% 2.62/0.70 fof(f1998,plain,(
% 2.62/0.70 $false|spl0_98),
% 2.62/0.70 inference(forward_subsumption_resolution,[status(thm)],[f1990,f49])).
% 2.62/0.70 fof(f1999,plain,(
% 2.62/0.70 spl0_98),
% 2.62/0.70 inference(contradiction_clause,[status(thm)],[f1998])).
% 2.62/0.70 fof(f2307,plain,(
% 2.62/0.70 plus(sk0_2,sk0_0(sk0_1,sk0_2))=sk0_1),
% 2.62/0.70 inference(resolution,[status(thm)],[f48,f34])).
% 2.62/0.70 fof(f2308,plain,(
% 2.62/0.70 plus(sk0_0(sk0_1,sk0_2),sk0_2)=sk0_1),
% 2.62/0.70 inference(forward_demodulation,[status(thm)],[f27,f2307])).
% 2.62/0.70 fof(f2311,plain,(
% 2.62/0.70 ![X0]: (~int_less(sk0_1,X0)|int_less(sk0_2,X0))),
% 2.62/0.70 inference(resolution,[status(thm)],[f48,f22])).
% 2.62/0.70 fof(f2313,plain,(
% 2.62/0.70 int_leq(int_one,sk0_2)),
% 2.62/0.70 inference(resolution,[status(thm)],[f531,f39])).
% 2.62/0.70 fof(f2468,plain,(
% 2.62/0.70 spl0_114 <=> int_less(int_zero,sk0_0(sk0_1,sk0_2))),
% 2.62/0.70 introduced(split_symbol_definition)).
% 2.62/0.70 fof(f2471,plain,(
% 2.62/0.70 spl0_115 <=> int_zero=sk0_0(sk0_1,sk0_2)),
% 2.62/0.70 introduced(split_symbol_definition)).
% 2.62/0.70 fof(f2472,plain,(
% 2.62/0.70 int_zero=sk0_0(sk0_1,sk0_2)|~spl0_115),
% 2.62/0.70 inference(component_clause,[status(thm)],[f2471])).
% 2.62/0.70 fof(f2474,plain,(
% 2.62/0.70 int_less(int_zero,sk0_0(sk0_1,sk0_2))|int_zero=sk0_0(sk0_1,sk0_2)),
% 2.62/0.70 inference(resolution,[status(thm)],[f554,f17])).
% 2.62/0.70 fof(f2475,plain,(
% 2.62/0.70 spl0_114|spl0_115),
% 2.62/0.70 inference(split_clause,[status(thm)],[f2474,f2468,f2471])).
% 2.62/0.70 fof(f2894,plain,(
% 2.62/0.70 spl0_138 <=> int_leq(int_one,plus(sk0_2,sk0_0(sk0_1,sk0_2)))),
% 2.62/0.70 introduced(split_symbol_definition)).
% 2.62/0.70 fof(f2896,plain,(
% 2.62/0.70 ~int_leq(int_one,plus(sk0_2,sk0_0(sk0_1,sk0_2)))|spl0_138),
% 2.62/0.70 inference(component_clause,[status(thm)],[f2894])).
% 2.62/0.70 fof(f2910,plain,(
% 2.62/0.70 spl0_142 <=> ~int_leq(int_one,X0)|~int_leq(X0,sk0_2)|a(plus(X0,sk0_0(sk0_1,sk0_2)),X0)=real_zero),
% 2.62/0.70 introduced(split_symbol_definition)).
% 2.62/0.70 fof(f2911,plain,(
% 2.62/0.70 ![X0]: (~int_leq(int_one,X0)|~int_leq(X0,sk0_2)|a(plus(X0,sk0_0(sk0_1,sk0_2)),X0)=real_zero|~spl0_142)),
% 2.62/0.70 inference(component_clause,[status(thm)],[f2910])).
% 2.62/0.70 fof(f2913,plain,(
% 2.62/0.70 ![X0]: (~int_leq(int_one,plus(sk0_2,sk0_0(sk0_1,sk0_2)))|~int_leq(sk0_1,n)|~int_leq(int_one,sk0_2)|~int_leq(sk0_2,n)|~int_less(int_zero,sk0_0(sk0_1,sk0_2))|~int_leq(int_one,X0)|~int_leq(X0,sk0_2)|a(plus(X0,sk0_0(sk0_1,sk0_2)),X0)=real_zero)),
% 2.62/0.70 inference(paramodulation,[status(thm)],[f226,f130])).
% 2.62/0.70 fof(f2914,plain,(
% 2.62/0.70 ~spl0_138|~spl0_98|~spl0_33|~spl0_36|~spl0_114|spl0_142),
% 2.62/0.70 inference(split_clause,[status(thm)],[f2913,f2894,f1988,f474,f511,f2468,f2910])).
% 2.62/0.70 fof(f2928,plain,(
% 2.62/0.70 ~int_leq(int_one,plus(sk0_0(sk0_1,sk0_2),sk0_2))|spl0_138),
% 2.62/0.70 inference(forward_demodulation,[status(thm)],[f27,f2896])).
% 2.62/0.70 fof(f2929,plain,(
% 2.62/0.70 ~int_leq(int_one,sk0_1)|spl0_138),
% 2.62/0.70 inference(forward_demodulation,[status(thm)],[f226,f2928])).
% 2.62/0.70 fof(f2930,plain,(
% 2.62/0.70 $false|spl0_138),
% 2.62/0.70 inference(forward_subsumption_resolution,[status(thm)],[f2929,f1978])).
% 2.62/0.70 fof(f2931,plain,(
% 2.62/0.70 spl0_138),
% 2.62/0.70 inference(contradiction_clause,[status(thm)],[f2930])).
% 2.62/0.70 fof(f2939,plain,(
% 2.62/0.70 $false|spl0_33),
% 2.62/0.70 inference(forward_subsumption_resolution,[status(thm)],[f476,f2313])).
% 2.62/0.70 fof(f2940,plain,(
% 2.62/0.70 spl0_33),
% 2.62/0.70 inference(contradiction_clause,[status(thm)],[f2939])).
% 2.62/0.70 fof(f3370,plain,(
% 2.62/0.70 int_leq(int_one,plus(int_zero,sk0_2))),
% 2.62/0.70 inference(resolution,[status(thm)],[f601,f39])).
% 2.62/0.70 fof(f3616,plain,(
% 2.62/0.70 spl0_164 <=> int_leq(sk0_1,sk0_2)),
% 2.62/0.70 introduced(split_symbol_definition)).
% 2.62/0.70 fof(f3617,plain,(
% 2.62/0.70 int_leq(sk0_1,sk0_2)|~spl0_164),
% 2.62/0.70 inference(component_clause,[status(thm)],[f3616])).
% 2.62/0.70 fof(f3672,plain,(
% 2.62/0.70 int_leq(int_one,sk0_2)),
% 2.62/0.70 inference(forward_demodulation,[status(thm)],[f127,f3370])).
% 2.62/0.70 fof(f4172,plain,(
% 2.62/0.70 int_less(int_zero,int_zero)|int_leq(sk0_1,sk0_2)|~spl0_115),
% 2.62/0.70 inference(paramodulation,[status(thm)],[f2472,f238])).
% 2.62/0.70 fof(f4173,plain,(
% 2.62/0.70 spl0_8|spl0_164|~spl0_115),
% 2.62/0.70 inference(split_clause,[status(thm)],[f4172,f114,f3616,f2471])).
% 2.62/0.70 fof(f4178,plain,(
% 2.62/0.70 spl0_186 <=> int_less(sk0_1,sk0_2)),
% 2.62/0.70 introduced(split_symbol_definition)).
% 2.62/0.70 fof(f4179,plain,(
% 2.62/0.70 int_less(sk0_1,sk0_2)|~spl0_186),
% 2.62/0.70 inference(component_clause,[status(thm)],[f4178])).
% 2.62/0.70 fof(f4181,plain,(
% 2.62/0.70 int_less(sk0_1,sk0_2)|sk0_1=sk0_2|~spl0_164),
% 2.62/0.70 inference(resolution,[status(thm)],[f3617,f17])).
% 2.62/0.70 fof(f4182,plain,(
% 2.62/0.70 spl0_186|spl0_5|~spl0_164),
% 2.62/0.70 inference(split_clause,[status(thm)],[f4181,f4178,f76,f3616])).
% 2.62/0.70 fof(f4183,plain,(
% 2.62/0.70 int_less(sk0_2,sk0_2)|~spl0_186),
% 2.62/0.70 inference(resolution,[status(thm)],[f4179,f2311])).
% 2.62/0.70 fof(f4184,plain,(
% 2.62/0.70 spl0_41|~spl0_186),
% 2.62/0.70 inference(split_clause,[status(thm)],[f4183,f586,f4178])).
% 2.62/0.70 fof(f4207,plain,(
% 2.62/0.70 int_less(sk0_1,sk0_1)|~spl0_5),
% 2.62/0.70 inference(backward_demodulation,[status(thm)],[f77,f48])).
% 2.62/0.70 fof(f4208,plain,(
% 2.62/0.70 $false|~spl0_5),
% 2.62/0.70 inference(forward_subsumption_resolution,[status(thm)],[f4207,f52])).
% 2.62/0.70 fof(f4209,plain,(
% 2.62/0.70 ~spl0_5),
% 2.62/0.70 inference(contradiction_clause,[status(thm)],[f4208])).
% 2.62/0.70 fof(f5447,plain,(
% 2.62/0.70 spl0_221 <=> a(plus(sk0_2,sk0_0(sk0_1,sk0_2)),sk0_2)=real_zero),
% 2.62/0.70 introduced(split_symbol_definition)).
% 2.62/0.70 fof(f5448,plain,(
% 2.62/0.70 a(plus(sk0_2,sk0_0(sk0_1,sk0_2)),sk0_2)=real_zero|~spl0_221),
% 2.62/0.70 inference(component_clause,[status(thm)],[f5447])).
% 2.62/0.70 fof(f5450,plain,(
% 2.62/0.70 ~int_leq(sk0_2,sk0_2)|a(plus(sk0_2,sk0_0(sk0_1,sk0_2)),sk0_2)=real_zero|~spl0_142),
% 2.62/0.70 inference(resolution,[status(thm)],[f2911,f3672])).
% 2.62/0.70 fof(f5451,plain,(
% 2.62/0.70 ~spl0_40|spl0_221|~spl0_142),
% 2.62/0.70 inference(split_clause,[status(thm)],[f5450,f555,f5447,f2910])).
% 2.62/0.70 fof(f5537,plain,(
% 2.62/0.70 $false|spl0_40),
% 2.62/0.70 inference(forward_subsumption_resolution,[status(thm)],[f557,f51])).
% 2.62/0.70 fof(f5538,plain,(
% 2.62/0.70 spl0_40),
% 2.62/0.70 inference(contradiction_clause,[status(thm)],[f5537])).
% 2.62/0.70 fof(f5539,plain,(
% 2.62/0.70 a(plus(sk0_0(sk0_1,sk0_2),sk0_2),sk0_2)=real_zero|~spl0_221),
% 2.62/0.70 inference(forward_demodulation,[status(thm)],[f27,f5448])).
% 2.62/0.70 fof(f5540,plain,(
% 2.62/0.70 a(sk0_1,sk0_2)=real_zero|~spl0_221),
% 2.62/0.70 inference(forward_demodulation,[status(thm)],[f2308,f5539])).
% 2.62/0.70 fof(f5541,plain,(
% 2.62/0.70 $false|~spl0_221),
% 2.62/0.70 inference(forward_subsumption_resolution,[status(thm)],[f5540,f50])).
% 2.62/0.70 fof(f5542,plain,(
% 2.62/0.70 ~spl0_221),
% 2.62/0.70 inference(contradiction_clause,[status(thm)],[f5541])).
% 2.62/0.70 fof(f5543,plain,(
% 2.62/0.70 $false),
% 2.62/0.70 inference(sat_refutation,[status(thm)],[f63,f595,f1435,f1522,f1940,f1999,f2475,f2914,f2931,f2940,f4173,f4182,f4184,f4209,f5451,f5538,f5542])).
% 2.62/0.70 % SZS output end CNFRefutation for theBenchmark.p
% 2.62/0.71 % Elapsed time: 0.366974 seconds
% 2.62/0.71 % CPU time: 2.831019 seconds
% 2.62/0.71 % Total memory used: 88.886 MB
% 2.62/0.71 % Net memory used: 83.175 MB
%------------------------------------------------------------------------------