%------------------------------------------------------------------------------
% File : Drodi-SAT---4.1.1
% Problem : SWV009-1 : TPTP v9.3.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -satmode(on) -timeout(300) /export/starexec/sandbox/benchmark/theBenchmark.p
% Computer : n017.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:49:55 PM UTC 2026
% Result : Unsatisfiable 0.13s 0.38s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWV009-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.04 % Command : drodi -satmode(on) -timeout(300) /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.09/0.35 % Computer : n017.cluster.edu
% 0.09/0.35 % Model : x86_64 x86_64
% 0.09/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.35 % Memory : 8046.5625MB
% 0.09/0.35 % OS : Linux 6.8.0-71-generic
% 0.09/0.35 % CPULimit : 300
% 0.09/0.35 % WCLimit : 300
% 0.09/0.35 % DateTime : Mon Sep 21 08:21:42 UTC 2026
% 0.09/0.35 % CPUTime :
% 0.13/0.36 % Drodi V4.1.1
% 0.13/0.38 % Refutation found
% 0.13/0.38 % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 0.13/0.38 % SZS output start CNFRefutation for theBenchmark
% 0.13/0.38 fof(f1,negated_conjecture,(
% 0.13/0.38 (![X,Y]: (( less_or_equal(X,Y)| less(Y,X) ) ))),
% 0.13/0.38 file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.13/0.38 fof(f3,negated_conjecture,(
% 0.13/0.38 less_or_equal(m,p) ),
% 0.13/0.38 file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.13/0.38 fof(f4,negated_conjecture,(
% 0.13/0.38 less_or_equal(p,q) ),
% 0.13/0.38 file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.13/0.38 fof(f5,negated_conjecture,(
% 0.13/0.38 less_or_equal(q,n) ),
% 0.13/0.38 file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.13/0.38 fof(f6,negated_conjecture,(
% 0.13/0.38 (![X,Y]: (( ~ less_or_equal(m,X)| ~ less(X,i)| ~ less(j,Y)| ~ less_or_equal(Y,n)| less_or_equal(a(X),a(Y)) ) ))),
% 0.13/0.38 file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.13/0.38 fof(f7,negated_conjecture,(
% 0.13/0.38 (![X,Y]: (( ~ less_or_equal(m,X)| ~ less_or_equal(X,Y)| ~ less_or_equal(Y,j)| less_or_equal(a(X),a(Y)) ) ))),
% 0.13/0.38 file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.13/0.38 fof(f8,negated_conjecture,(
% 0.13/0.38 (![X,Y]: (( ~ less_or_equal(i,X)| ~ less_or_equal(X,Y)| ~ less_or_equal(Y,n)| less_or_equal(a(X),a(Y)) ) ))),
% 0.13/0.38 file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.13/0.38 fof(f9,negated_conjecture,(
% 0.13/0.38 ~ less_or_equal(a(p),a(q)) ),
% 0.13/0.38 file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.13/0.38 fof(f10,plain,(
% 0.13/0.38 ![X0,X1]: (less_or_equal(X0,X1)|less(X1,X0))),
% 0.13/0.38 inference(cnf_transformation,[status(thm)],[f1])).
% 0.13/0.38 fof(f12,plain,(
% 0.13/0.38 less_or_equal(m,p)),
% 0.13/0.38 inference(cnf_transformation,[status(thm)],[f3])).
% 0.13/0.38 fof(f13,plain,(
% 0.13/0.38 less_or_equal(p,q)),
% 0.13/0.38 inference(cnf_transformation,[status(thm)],[f4])).
% 0.13/0.38 fof(f14,plain,(
% 0.13/0.38 less_or_equal(q,n)),
% 0.13/0.38 inference(cnf_transformation,[status(thm)],[f5])).
% 0.13/0.38 fof(f15,plain,(
% 0.13/0.38 ![X0,X1]: (~less_or_equal(m,X0)|~less(X0,i)|~less(j,X1)|~less_or_equal(X1,n)|less_or_equal(a(X0),a(X1)))),
% 0.13/0.38 inference(cnf_transformation,[status(thm)],[f6])).
% 0.13/0.38 fof(f16,plain,(
% 0.13/0.38 ![X0,X1]: (~less_or_equal(m,X0)|~less_or_equal(X0,X1)|~less_or_equal(X1,j)|less_or_equal(a(X0),a(X1)))),
% 0.13/0.38 inference(cnf_transformation,[status(thm)],[f7])).
% 0.13/0.38 fof(f17,plain,(
% 0.13/0.38 ![X0,X1]: (~less_or_equal(i,X0)|~less_or_equal(X0,X1)|~less_or_equal(X1,n)|less_or_equal(a(X0),a(X1)))),
% 0.13/0.38 inference(cnf_transformation,[status(thm)],[f8])).
% 0.13/0.38 fof(f18,plain,(
% 0.13/0.38 ~less_or_equal(a(p),a(q))),
% 0.13/0.38 inference(cnf_transformation,[status(thm)],[f9])).
% 0.13/0.38 fof(f20,plain,(
% 0.13/0.38 ~less_or_equal(m,p)|~less_or_equal(p,q)|~less_or_equal(q,j)),
% 0.13/0.38 inference(resolution,[status(thm)],[f16,f18])).
% 0.13/0.38 fof(f21,definition,(
% 0.13/0.38 sQ0_spl <=> (less_or_equal(m,p))),
% 0.13/0.38 introduced(definition,[new_symbols(definition,[sQ0_spl])],[split_symbol_definition])).
% 0.13/0.38 fof(f23,plain,(
% 0.13/0.38 ~less_or_equal(m,p)|sQ0_spl),
% 0.13/0.38 inference(component_clause,[status(thm)],[f21])).
% 0.13/0.38 fof(f24,definition,(
% 0.13/0.38 sQ1_spl <=> (less_or_equal(p,q))),
% 0.13/0.38 introduced(definition,[new_symbols(definition,[sQ1_spl])],[split_symbol_definition])).
% 0.13/0.38 fof(f26,plain,(
% 0.13/0.38 ~less_or_equal(p,q)|sQ1_spl),
% 0.13/0.38 inference(component_clause,[status(thm)],[f24])).
% 0.13/0.38 fof(f27,definition,(
% 0.13/0.38 sQ2_spl <=> (less_or_equal(q,j))),
% 0.13/0.38 introduced(definition,[new_symbols(definition,[sQ2_spl])],[split_symbol_definition])).
% 0.13/0.38 fof(f29,plain,(
% 0.13/0.38 ~less_or_equal(q,j)|sQ2_spl),
% 0.13/0.38 inference(component_clause,[status(thm)],[f27])).
% 0.13/0.38 fof(f30,plain,(
% 0.13/0.38 ~sQ0_spl|~sQ1_spl|~sQ2_spl),
% 0.13/0.38 inference(split_clause,[status(thm)],[f20,f21,f24,f27])).
% 0.13/0.38 fof(f31,plain,(
% 0.13/0.38 less(j,q)|sQ2_spl),
% 0.13/0.38 inference(resolution,[status(thm)],[f29,f10])).
% 0.13/0.38 fof(f32,plain,(
% 0.13/0.38 ~less_or_equal(m,p)|~less(p,i)|~less(j,q)|~less_or_equal(q,n)),
% 0.13/0.38 inference(resolution,[status(thm)],[f15,f18])).
% 0.13/0.38 fof(f33,definition,(
% 0.13/0.38 sQ3_spl <=> (less(p,i))),
% 0.13/0.38 introduced(definition,[new_symbols(definition,[sQ3_spl])],[split_symbol_definition])).
% 0.13/0.38 fof(f35,plain,(
% 0.13/0.38 ~less(p,i)|sQ3_spl),
% 0.13/0.38 inference(component_clause,[status(thm)],[f33])).
% 0.13/0.38 fof(f36,definition,(
% 0.13/0.38 sQ4_spl <=> (less(j,q))),
% 0.13/0.38 introduced(definition,[new_symbols(definition,[sQ4_spl])],[split_symbol_definition])).
% 0.13/0.38 fof(f38,plain,(
% 0.13/0.38 ~less(j,q)|sQ4_spl),
% 0.13/0.38 inference(component_clause,[status(thm)],[f36])).
% 0.13/0.38 fof(f39,definition,(
% 0.13/0.38 sQ5_spl <=> (less_or_equal(q,n))),
% 0.13/0.38 introduced(definition,[new_symbols(definition,[sQ5_spl])],[split_symbol_definition])).
% 0.13/0.38 fof(f41,plain,(
% 0.13/0.38 ~less_or_equal(q,n)|sQ5_spl),
% 0.13/0.38 inference(component_clause,[status(thm)],[f39])).
% 0.13/0.38 fof(f42,plain,(
% 0.13/0.38 ~sQ0_spl|~sQ3_spl|~sQ4_spl|~sQ5_spl),
% 0.13/0.38 inference(split_clause,[status(thm)],[f32,f21,f33,f36,f39])).
% 0.13/0.38 fof(f43,plain,(
% 0.13/0.38 $false|sQ0_spl),
% 0.13/0.38 inference(forward_subsumption_resolution,[status(thm)],[f23,f12])).
% 0.13/0.38 fof(f44,plain,(
% 0.13/0.38 sQ0_spl),
% 0.13/0.38 inference(contradiction_clause,[status(thm)],[f43])).
% 0.13/0.38 fof(f45,plain,(
% 0.13/0.38 $false|sQ1_spl),
% 0.13/0.38 inference(forward_subsumption_resolution,[status(thm)],[f26,f13])).
% 0.13/0.38 fof(f46,plain,(
% 0.13/0.38 sQ1_spl),
% 0.13/0.38 inference(contradiction_clause,[status(thm)],[f45])).
% 0.13/0.38 fof(f47,plain,(
% 0.13/0.38 $false|sQ5_spl),
% 0.13/0.38 inference(forward_subsumption_resolution,[status(thm)],[f41,f14])).
% 0.13/0.38 fof(f48,plain,(
% 0.13/0.38 sQ5_spl),
% 0.13/0.38 inference(contradiction_clause,[status(thm)],[f47])).
% 0.13/0.38 fof(f49,plain,(
% 0.13/0.38 ~less_or_equal(i,p)|~less_or_equal(p,q)|~less_or_equal(q,n)),
% 0.13/0.38 inference(resolution,[status(thm)],[f17,f18])).
% 0.13/0.38 fof(f50,definition,(
% 0.13/0.38 sQ6_spl <=> (less_or_equal(i,p))),
% 0.13/0.38 introduced(definition,[new_symbols(definition,[sQ6_spl])],[split_symbol_definition])).
% 0.13/0.38 fof(f52,plain,(
% 0.13/0.38 ~less_or_equal(i,p)|sQ6_spl),
% 0.13/0.38 inference(component_clause,[status(thm)],[f50])).
% 0.13/0.38 fof(f53,plain,(
% 0.13/0.38 ~sQ6_spl|~sQ1_spl|~sQ5_spl),
% 0.13/0.38 inference(split_clause,[status(thm)],[f49,f50,f24,f39])).
% 0.13/0.38 fof(f55,plain,(
% 0.13/0.38 less(p,i)|sQ6_spl),
% 0.13/0.38 inference(resolution,[status(thm)],[f52,f10])).
% 0.13/0.38 fof(f56,plain,(
% 0.13/0.38 $false|sQ3_spl|sQ6_spl),
% 0.13/0.38 inference(forward_subsumption_resolution,[status(thm)],[f55,f35])).
% 0.13/0.38 fof(f57,plain,(
% 0.13/0.38 sQ3_spl|sQ6_spl),
% 0.13/0.38 inference(contradiction_clause,[status(thm)],[f56])).
% 0.13/0.38 fof(f58,plain,(
% 0.13/0.38 $false|sQ2_spl|sQ4_spl),
% 0.13/0.38 inference(forward_subsumption_resolution,[status(thm)],[f38,f31])).
% 0.13/0.38 fof(f59,plain,(
% 0.13/0.38 sQ2_spl|sQ4_spl),
% 0.13/0.38 inference(contradiction_clause,[status(thm)],[f58])).
% 0.13/0.38 fof(f60,plain,(
% 0.13/0.38 $false),
% 0.13/0.38 inference(sat_refutation,[status(thm)],[f30,f42,f44,f46,f48,f53,f57,f59])).
% 0.13/0.38 % SZS output end CNFRefutation for theBenchmark.p
% 0.13/0.40 % Elapsed time: 0.045453 seconds
% 0.13/0.40 % CPU time: 0.126999 seconds
% 0.13/0.40 % Total memory used: 16.666 MB
% 0.13/0.40 % Net memory used: 16.187 MB
%------------------------------------------------------------------------------