%------------------------------------------------------------------------------
% File : Drodi-SAT---4.1.1
% Problem : FLD067-2 : TPTP v9.3.1. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -satmode(on) -timeout(300) /export/starexec/sandbox2/benchmark/theBenchmark.p
% Computer : n011.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 12:22:29 PM UTC 2026
% Result : Unsatisfiable 13.99s 2.23s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : FLD067-2 : TPTP v9.3.1. Bugfixed v2.1.0.
% 0.00/0.06 % Command : drodi -satmode(on) -timeout(300) /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.16/0.40 % Computer : n011.cluster.edu
% 0.16/0.40 % Model : x86_64 x86_64
% 0.16/0.40 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.40 % Memory : 8046.5625MB
% 0.16/0.40 % OS : Linux 6.8.0-71-generic
% 0.16/0.40 % CPULimit : 300
% 0.16/0.40 % WCLimit : 300
% 0.16/0.40 % DateTime : Mon Sep 21 15:44:26 UTC 2026
% 0.19/0.40 % CPUTime :
% 0.19/0.41 % Drodi V4.1.1
% 13.99/2.23 % Refutation found
% 13.99/2.23 % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 13.99/2.23 % SZS output start CNFRefutation for theBenchmark
% 13.99/2.23 fof(f3,axiom,(
% 13.99/2.23 (![X]: (( equalish(add(X,additive_inverse(X)),additive_identity)| ~ defined(X) ) ))),
% 13.99/2.23 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 13.99/2.23 fof(f12,axiom,(
% 13.99/2.23 (![X]: (( defined(additive_inverse(X))| ~ defined(X) ) ))),
% 13.99/2.23 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 13.99/2.23 fof(f17,axiom,(
% 13.99/2.23 (![X,Z,Y]: (( less_or_equal(X,Z)| ~ less_or_equal(X,Y)| ~ less_or_equal(Y,Z) ) ))),
% 13.99/2.23 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 13.99/2.23 fof(f18,axiom,(
% 13.99/2.23 (![X,Y]: (( less_or_equal(X,Y)| less_or_equal(Y,X)| ~ defined(X)| ~ defined(Y) ) ))),
% 13.99/2.23 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 13.99/2.23 fof(f19,axiom,(
% 13.99/2.23 (![X,Z,Y]: (( less_or_equal(add(X,Z),add(Y,Z))| ~ defined(Z)| ~ less_or_equal(X,Y) ) ))),
% 13.99/2.23 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 13.99/2.23 fof(f22,axiom,(
% 13.99/2.23 (![X,Y]: (( equalish(X,Y)| ~ equalish(Y,X) ) ))),
% 13.99/2.23 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 13.99/2.23 fof(f26,axiom,(
% 13.99/2.23 (![Y,Z,X]: (( less_or_equal(Y,Z)| ~ less_or_equal(X,Z)| ~ equalish(X,Y) ) ))),
% 13.99/2.23 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 13.99/2.23 fof(f28,hypothesis,(
% 13.99/2.23 defined(a) ),
% 13.99/2.23 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 13.99/2.23 fof(f30,hypothesis,(
% 13.99/2.23 defined(u) ),
% 13.99/2.23 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 13.99/2.23 fof(f31,negated_conjecture,(
% 13.99/2.23 less_or_equal(a,b) ),
% 13.99/2.23 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 13.99/2.23 fof(f32,negated_conjecture,(
% 13.99/2.23 equalish(add(b,additive_inverse(a)),u) ),
% 13.99/2.23 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 13.99/2.23 fof(f33,negated_conjecture,(
% 13.99/2.23 ~ less_or_equal(additive_identity,u) ),
% 13.99/2.23 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 13.99/2.23 fof(f37,plain,(
% 13.99/2.23 ![X0]: (equalish(add(X0,additive_inverse(X0)),additive_identity)|~defined(X0))),
% 13.99/2.23 inference(cnf_transformation,[status(thm)],[f3])).
% 13.99/2.23 fof(f51,plain,(
% 13.99/2.23 ![X0]: (defined(additive_inverse(X0))|~defined(X0))),
% 13.99/2.23 inference(cnf_transformation,[status(thm)],[f12])).
% 13.99/2.23 fof(f57,plain,(
% 13.99/2.23 ![Z,Y]: ((![X]: (less_or_equal(X,Z)|~less_or_equal(X,Y)))|~less_or_equal(Y,Z))),
% 13.99/2.23 inference(miniscoping,[status(thm)],[f17])).
% 13.99/2.23 fof(f58,plain,(
% 13.99/2.23 ![X0,X1,X2]: (less_or_equal(X0,X1)|~less_or_equal(X0,X2)|~less_or_equal(X2,X1))),
% 13.99/2.23 inference(cnf_transformation,[status(thm)],[f57])).
% 13.99/2.23 fof(f59,plain,(
% 13.99/2.23 ![Y]: ((![X]: ((less_or_equal(X,Y)|less_or_equal(Y,X))|~defined(X)))|~defined(Y))),
% 13.99/2.23 inference(miniscoping,[status(thm)],[f18])).
% 13.99/2.23 fof(f60,plain,(
% 13.99/2.23 ![X0,X1]: (less_or_equal(X0,X1)|less_or_equal(X1,X0)|~defined(X0)|~defined(X1))),
% 13.99/2.23 inference(cnf_transformation,[status(thm)],[f59])).
% 13.99/2.23 fof(f61,plain,(
% 13.99/2.23 ![X,Y]: ((![Z]: (less_or_equal(add(X,Z),add(Y,Z))|~defined(Z)))|~less_or_equal(X,Y))),
% 13.99/2.23 inference(miniscoping,[status(thm)],[f19])).
% 13.99/2.23 fof(f62,plain,(
% 13.99/2.23 ![X0,X1,X2]: (less_or_equal(add(X0,X1),add(X2,X1))|~defined(X1)|~less_or_equal(X0,X2))),
% 13.99/2.23 inference(cnf_transformation,[status(thm)],[f61])).
% 13.99/2.23 fof(f66,plain,(
% 13.99/2.23 ![X0,X1]: (equalish(X0,X1)|~equalish(X1,X0))),
% 13.99/2.23 inference(cnf_transformation,[status(thm)],[f22])).
% 13.99/2.23 fof(f73,plain,(
% 13.99/2.23 ![Y,X]: ((![Z]: (less_or_equal(Y,Z)|~less_or_equal(X,Z)))|~equalish(X,Y))),
% 13.99/2.23 inference(miniscoping,[status(thm)],[f26])).
% 13.99/2.23 fof(f74,plain,(
% 13.99/2.23 ![X0,X1,X2]: (less_or_equal(X0,X1)|~less_or_equal(X2,X1)|~equalish(X2,X0))),
% 13.99/2.23 inference(cnf_transformation,[status(thm)],[f73])).
% 13.99/2.23 fof(f76,plain,(
% 13.99/2.23 defined(a)),
% 13.99/2.23 inference(cnf_transformation,[status(thm)],[f28])).
% 13.99/2.23 fof(f78,plain,(
% 13.99/2.23 defined(u)),
% 13.99/2.23 inference(cnf_transformation,[status(thm)],[f30])).
% 13.99/2.23 fof(f79,plain,(
% 13.99/2.23 less_or_equal(a,b)),
% 13.99/2.23 inference(cnf_transformation,[status(thm)],[f31])).
% 13.99/2.23 fof(f80,plain,(
% 13.99/2.23 equalish(add(b,additive_inverse(a)),u)),
% 13.99/2.23 inference(cnf_transformation,[status(thm)],[f32])).
% 13.99/2.23 fof(f81,plain,(
% 13.99/2.23 ~less_or_equal(additive_identity,u)),
% 13.99/2.23 inference(cnf_transformation,[status(thm)],[f33])).
% 13.99/2.23 fof(f111,plain,(
% 13.99/2.23 equalish(add(a,additive_inverse(a)),additive_identity)),
% 13.99/2.23 inference(resolution,[status(thm)],[f37,f76])).
% 13.99/2.23 fof(f134,plain,(
% 13.99/2.23 ![X0]: (less_or_equal(X0,u)|less_or_equal(u,X0)|~defined(X0))),
% 13.99/2.27 inference(resolution,[status(thm)],[f60,f78])).
% 13.99/2.27 fof(f176,plain,(
% 13.99/2.27 less_or_equal(u,u)|less_or_equal(u,u)),
% 13.99/2.27 inference(resolution,[status(thm)],[f134,f78])).
% 13.99/2.27 fof(f181,definition,(
% 13.99/2.27 sQ9_spl <=> (less_or_equal(u,u))),
% 13.99/2.27 introduced(definition,[new_symbols(definition,[sQ9_spl])],[split_symbol_definition])).
% 13.99/2.27 fof(f182,plain,(
% 13.99/2.27 less_or_equal(u,u)|~sQ9_spl),
% 13.99/2.27 inference(component_clause,[status(thm)],[f181])).
% 13.99/2.27 fof(f184,plain,(
% 13.99/2.27 sQ9_spl),
% 13.99/2.27 inference(split_clause,[status(thm)],[f176,f181])).
% 13.99/2.27 fof(f199,definition,(
% 13.99/2.27 sQ14_spl <=> (less_or_equal(additive_identity,u))),
% 13.99/2.27 introduced(definition,[new_symbols(definition,[sQ14_spl])],[split_symbol_definition])).
% 13.99/2.27 fof(f200,plain,(
% 13.99/2.27 less_or_equal(additive_identity,u)|~sQ14_spl),
% 13.99/2.27 inference(component_clause,[status(thm)],[f199])).
% 13.99/2.27 fof(f206,plain,(
% 13.99/2.27 $false|~sQ14_spl),
% 13.99/2.27 inference(forward_subsumption_resolution,[status(thm)],[f200,f81])).
% 13.99/2.27 fof(f207,plain,(
% 13.99/2.27 ~sQ14_spl),
% 13.99/2.27 inference(contradiction_clause,[status(thm)],[f206])).
% 13.99/2.27 fof(f338,plain,(
% 13.99/2.27 defined(additive_inverse(a))),
% 13.99/2.27 inference(resolution,[status(thm)],[f51,f76])).
% 13.99/2.27 fof(f434,plain,(
% 13.99/2.27 ![X0]: (less_or_equal(add(a,X0),add(b,X0))|~defined(X0))),
% 13.99/2.27 inference(resolution,[status(thm)],[f62,f79])).
% 13.99/2.27 fof(f709,plain,(
% 13.99/2.27 equalish(u,add(b,additive_inverse(a)))),
% 13.99/2.27 inference(resolution,[status(thm)],[f66,f80])).
% 13.99/2.27 fof(f940,plain,(
% 13.99/2.27 less_or_equal(add(a,additive_inverse(a)),add(b,additive_inverse(a)))),
% 13.99/2.27 inference(resolution,[status(thm)],[f338,f434])).
% 13.99/2.27 fof(f1985,plain,(
% 13.99/2.27 ![X0]: (less_or_equal(add(b,additive_inverse(a)),X0)|~less_or_equal(u,X0))),
% 13.99/2.27 inference(resolution,[status(thm)],[f74,f709])).
% 13.99/2.27 fof(f2269,plain,(
% 13.99/2.27 less_or_equal(add(b,additive_inverse(a)),u)|~sQ9_spl),
% 13.99/2.27 inference(resolution,[status(thm)],[f1985,f182])).
% 13.99/2.27 fof(f2311,plain,(
% 13.99/2.27 ![X0]: (less_or_equal(X0,u)|~less_or_equal(X0,add(b,additive_inverse(a)))|~sQ9_spl)),
% 13.99/2.27 inference(resolution,[status(thm)],[f2269,f58])).
% 13.99/2.27 fof(f3126,definition,(
% 13.99/2.27 sQ346_spl <=> (equalish(additive_identity,add(a,additive_inverse(a))))),
% 13.99/2.27 introduced(definition,[new_symbols(definition,[sQ346_spl])],[split_symbol_definition])).
% 13.99/2.27 fof(f3127,plain,(
% 13.99/2.27 equalish(additive_identity,add(a,additive_inverse(a)))|~sQ346_spl),
% 13.99/2.27 inference(component_clause,[status(thm)],[f3126])).
% 13.99/2.27 fof(f3128,plain,(
% 13.99/2.27 ~equalish(additive_identity,add(a,additive_inverse(a)))|sQ346_spl),
% 13.99/2.27 inference(component_clause,[status(thm)],[f3126])).
% 13.99/2.27 fof(f3137,plain,(
% 13.99/2.27 equalish(add(a,additive_inverse(a)),additive_identity)|~sQ346_spl),
% 13.99/2.27 inference(resolution,[status(thm)],[f3127,f66])).
% 13.99/2.27 fof(f3138,plain,(
% 13.99/2.27 ![X0]: (less_or_equal(additive_identity,X0)|~less_or_equal(add(a,additive_inverse(a)),X0)|~sQ346_spl)),
% 13.99/2.27 inference(resolution,[status(thm)],[f3137,f74])).
% 13.99/2.27 fof(f3143,plain,(
% 13.99/2.27 less_or_equal(add(a,additive_inverse(a)),u)|~sQ9_spl),
% 13.99/2.27 inference(resolution,[status(thm)],[f2311,f940])).
% 13.99/2.27 fof(f5964,plain,(
% 13.99/2.27 less_or_equal(additive_identity,u)|~sQ346_spl|~sQ9_spl),
% 13.99/2.27 inference(resolution,[status(thm)],[f3138,f3143])).
% 13.99/2.27 fof(f5967,plain,(
% 13.99/2.27 sQ14_spl|~sQ346_spl|~sQ9_spl),
% 13.99/2.27 inference(split_clause,[status(thm)],[f5964,f199,f3126,f181])).
% 13.99/2.27 fof(f12362,plain,(
% 13.99/2.27 equalish(additive_identity,add(a,additive_inverse(a)))),
% 13.99/2.27 inference(resolution,[status(thm)],[f111,f66])).
% 13.99/2.27 fof(f12363,plain,(
% 13.99/2.27 $false|sQ346_spl),
% 13.99/2.27 inference(forward_subsumption_resolution,[status(thm)],[f12362,f3128])).
% 13.99/2.27 fof(f12364,plain,(
% 13.99/2.27 sQ346_spl),
% 13.99/2.27 inference(contradiction_clause,[status(thm)],[f12363])).
% 13.99/2.27 fof(f12365,plain,(
% 13.99/2.27 $false),
% 13.99/2.27 inference(sat_refutation,[status(thm)],[f184,f207,f5967,f12364])).
% 13.99/2.27 % SZS output end CNFRefutation for theBenchmark.p
% 13.99/2.29 % Elapsed time: 1.874357 seconds
% 13.99/2.29 % CPU time: 14.444856 seconds
% 13.99/2.29 % Total memory used: 170.395 MB
% 13.99/2.29 % Net memory used: 159.525 MB
%------------------------------------------------------------------------------