%------------------------------------------------------------------------------
% File : Drodi-SAT---4.1.1
% Problem : SWV488+3 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -satmode(on) -timeout(300) /export/starexec/sandbox/benchmark/theBenchmark.p
% Computer : n014.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Thu Sep 24 02:51:00 PM UTC 2026
% Result : Theorem 0.23s 0.55s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : SWV488+3 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.07 % Command : drodi -satmode(on) -timeout(300) /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.49 % Computer : n014.cluster.edu
% 0.20/0.49 % Model : x86_64 x86_64
% 0.20/0.49 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.20/0.49 % Memory : 8046.5625MB
% 0.20/0.49 % OS : Linux 6.8.0-71-generic
% 0.20/0.49 % CPULimit : 300
% 0.20/0.49 % WCLimit : 300
% 0.20/0.49 % DateTime : Mon Sep 21 08:54:19 UTC 2026
% 0.20/0.50 % CPUTime :
% 0.20/0.52 % Drodi V4.1.1
% 0.23/0.55 % Refutation found
% 0.23/0.55 % SZS status Theorem for theBenchmark: Theorem is valid
% 0.23/0.55 % SZS output start CNFRefutation for theBenchmark
% 0.23/0.55 fof(f1,axiom,(
% 0.23/0.55 (! [I,J] :( int_leq(I,J)<=> ( int_less(I,J)| I = J ) ) )),
% 0.23/0.55 file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.23/0.55 fof(f11,axiom,(
% 0.23/0.55 real_zero != real_one ),
% 0.23/0.55 file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.23/0.55 fof(f12,hypothesis,(
% 0.23/0.55 (! [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 ) )))& (! [K] :( ( int_leq(int_one,K)& int_leq(K,J) )=> a(K,K) = real_one ))& (! [C] :( ( int_less(int_zero,C)& J = plus(I,C) )=> (! [K] :( ( int_leq(int_one,K)& int_leq(K,I) )=> a(K,plus(K,C)) = real_zero ) )) )) ) )),
% 0.23/0.55 file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.23/0.55 fof(f13,conjecture,(
% 0.23/0.55 (! [I,J] :( ( int_leq(int_one,J)& int_leq(J,I)& int_leq(I,n) )=> ( I = J=> a(I,J) != real_zero ) ) )),
% 0.23/0.55 file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.23/0.55 fof(f14,negated_conjecture,(
% 0.23/0.55 ~((! [I,J] :( ( int_leq(int_one,J)& int_leq(J,I)& int_leq(I,n) )=> ( I = J=> a(I,J) != real_zero ) ) ))),
% 0.23/0.55 inference(negated_conjecture,[status(cth)],[f13])).
% 0.23/0.55 fof(f15,plain,(
% 0.23/0.55 ![I,J]: ((~int_leq(I,J)|(int_less(I,J)|I=J))&(int_leq(I,J)|(~int_less(I,J)&~I=J)))),
% 0.23/0.55 inference(NNF_transformation,[status(thm)],[f1])).
% 0.23/0.55 fof(f16,plain,(
% 0.23/0.55 (![I,J]: (~int_leq(I,J)|(int_less(I,J)|I=J)))&(![I,J]: (int_leq(I,J)|(~int_less(I,J)&~I=J)))),
% 0.23/0.55 inference(miniscoping,[status(thm)],[f15])).
% 0.23/0.55 fof(f19,plain,(
% 0.23/0.55 ![X0,X1]: (int_leq(X0,X1)|~X0=X1)),
% 0.23/0.55 inference(cnf_transformation,[status(thm)],[f16])).
% 0.23/0.55 fof(f41,plain,(
% 0.23/0.55 ~real_zero=real_one),
% 0.23/0.55 inference(cnf_transformation,[status(thm)],[f11])).
% 0.23/0.55 fof(f42,plain,(
% 0.23/0.55 ![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))))&(![K]: ((~int_leq(int_one,K)|~int_leq(K,J))|a(K,K)=real_one)))&(![C]: ((~int_less(int_zero,C)|~J=plus(I,C))|(![K]: ((~int_leq(int_one,K)|~int_leq(K,I))|a(K,plus(K,C))=real_zero))))))),
% 0.23/0.55 inference(pre_NNF_transformation,[status(thm)],[f12])).
% 0.23/0.55 fof(f44,plain,(
% 0.23/0.55 ![X0,X1,X2]: (~int_leq(int_one,X0)|~int_leq(X0,n)|~int_leq(int_one,X1)|~int_leq(X1,n)|~int_leq(int_one,X2)|~int_leq(X2,X1)|a(X2,X2)=real_one)),
% 0.23/0.55 inference(cnf_transformation,[status(thm)],[f42])).
% 0.23/0.55 fof(f46,plain,(
% 0.23/0.55 (?[I,J]: (((int_leq(int_one,J)&int_leq(J,I))&int_leq(I,n))&(I=J&a(I,J)=real_zero)))),
% 0.23/0.55 inference(pre_NNF_transformation,[status(thm)],[f14])).
% 0.23/0.55 fof(f47,plain,(
% 0.23/0.55 (((int_leq(int_one,sK2_skl)&int_leq(sK2_skl,sK1_skl))&int_leq(sK1_skl,n))&(sK1_skl=sK2_skl&a(sK1_skl,sK2_skl)=real_zero))),
% 0.23/0.55 inference(skolemize,[status(esa),new_symbols(skolem,[sK1_skl,sK2_skl]),skolemize(I,sK1_skl),skolemize(J,sK2_skl)],[f46])).
% 0.23/0.55 fof(f48,plain,(
% 0.23/0.55 int_leq(int_one,sK2_skl)),
% 0.23/0.55 inference(cnf_transformation,[status(thm)],[f47])).
% 0.23/0.55 fof(f50,plain,(
% 0.23/0.55 int_leq(sK1_skl,n)),
% 0.23/0.55 inference(cnf_transformation,[status(thm)],[f47])).
% 0.23/0.55 fof(f51,plain,(
% 0.23/0.55 sK1_skl=sK2_skl),
% 0.23/0.55 inference(cnf_transformation,[status(thm)],[f47])).
% 0.23/0.55 fof(f52,plain,(
% 0.23/0.55 a(sK1_skl,sK2_skl)=real_zero),
% 0.23/0.55 inference(cnf_transformation,[status(thm)],[f47])).
% 0.23/0.55 fof(f53,plain,(
% 0.23/0.55 ![X0]: (int_leq(X0,X0))),
% 0.23/0.55 inference(destructive_equality_resolution,[status(thm)],[f19])).
% 0.23/0.55 fof(f58,plain,(
% 0.23/0.55 int_leq(int_one,sK1_skl)),
% 0.23/0.55 inference(forward_demodulation,[status(thm)],[f51,f48])).
% 0.23/0.55 fof(f60,plain,(
% 0.23/0.55 a(sK1_skl,sK1_skl)=real_zero),
% 0.23/0.55 inference(forward_demodulation,[status(thm)],[f51,f52])).
% 0.23/0.55 fof(f148,plain,(
% 0.23/0.55 ![X0]: (~int_leq(int_one,X0)|~int_leq(X0,n)|~int_leq(sK1_skl,n)|~int_leq(sK1_skl,sK1_skl)|a(sK1_skl,sK1_skl)=real_one)),
% 0.23/0.55 inference(resolution,[status(thm)],[f44,f58])).
% 0.23/0.55 fof(f154,plain,(
% 0.23/0.55 ![X0]: (~int_leq(int_one,X0)|~int_leq(X0,n)|~int_leq(sK1_skl,n)|~int_leq(sK1_skl,sK1_skl)|real_zero=real_one)),
% 0.23/0.55 inference(forward_demodulation,[status(thm)],[f60,f148])).
% 0.23/0.55 fof(f155,plain,(
% 0.23/0.55 ![X0]: (~int_leq(int_one,X0)|~int_leq(X0,n)|~int_leq(sK1_skl,n)|real_zero=real_one)),
% 0.23/0.55 inference(forward_subsumption_resolution,[status(thm)],[f154,f53])).
% 0.23/0.55 fof(f172,plain,(
% 0.23/0.55 ![X0]: (~int_leq(int_one,X0)|~int_leq(X0,n)|real_zero=real_one)),
% 0.23/0.55 inference(forward_subsumption_resolution,[status(thm)],[f155,f50])).
% 0.23/0.55 fof(f173,plain,(
% 0.23/0.55 ~int_leq(sK1_skl,n)|real_zero=real_one),
% 0.23/0.55 inference(resolution,[status(thm)],[f172,f58])).
% 0.23/0.55 fof(f175,plain,(
% 0.23/0.55 real_zero=real_one),
% 0.23/0.55 inference(forward_subsumption_resolution,[status(thm)],[f173,f50])).
% 0.23/0.55 fof(f181,plain,(
% 0.23/0.55 $false),
% 0.23/0.55 inference(forward_subsumption_resolution,[status(thm)],[f175,f41])).
% 0.23/0.55 % SZS output end CNFRefutation for theBenchmark.p
% 0.26/0.64 % Elapsed time: 0.129360 seconds
% 0.26/0.64 % CPU time: 0.183919 seconds
% 0.26/0.64 % Total memory used: 22.932 MB
% 0.26/0.64 % Net memory used: 22.851 MB
%------------------------------------------------------------------------------