↑ Up

Drodi-SAT---4.1.1.UNS-Ass.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Drodi-SAT---4.1.1
% Problem  : FLD067-1 : 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 : n004.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 0.13s 0.42s
% Output   : Assurance 0s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : FLD067-1 : TPTP v9.3.1. Bugfixed v2.1.0.
% 0.00/0.04  % Command  : drodi -satmode(on) -timeout(300) /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.09/0.36  % Computer : n004.cluster.edu
% 0.09/0.36  % Model    : x86_64 x86_64
% 0.09/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36  % Memory   : 8046.5625MB
% 0.09/0.36  % OS       : Linux 6.8.0-71-generic
% 0.09/0.36  % CPULimit : 300
% 0.09/0.36  % WCLimit  : 300
% 0.09/0.36  % DateTime : Mon Sep 21 15:44:05 UTC 2026
% 0.09/0.36  % CPUTime  : 
% 0.13/0.37  % Drodi V4.1.1
% 0.13/0.42  % Refutation found
% 0.13/0.42  % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 0.13/0.42  % SZS output start CNFRefutation for theBenchmark
% 0.13/0.42  fof(f3,axiom,(
% 0.13/0.42    (![X]: (( equalish(add(X,additive_inverse(X)),additive_identity)| ~ defined(X) ) ))),
% 0.13/0.42    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.13/0.42  fof(f11,axiom,(
% 0.13/0.42    defined(additive_identity) ),
% 0.13/0.42    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.13/0.42  fof(f12,axiom,(
% 0.13/0.42    (![X]: (( defined(additive_inverse(X))| ~ defined(X) ) ))),
% 0.13/0.42    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.13/0.42  fof(f18,axiom,(
% 0.13/0.42    (![X,Y]: (( less_or_equal(X,Y)| less_or_equal(Y,X)| ~ defined(X)| ~ defined(Y) ) ))),
% 0.13/0.42    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.13/0.42  fof(f19,axiom,(
% 0.13/0.42    (![X,Z,Y]: (( less_or_equal(add(X,Z),add(Y,Z))| ~ defined(Z)| ~ less_or_equal(X,Y) ) ))),
% 0.13/0.42    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.13/0.42  fof(f21,axiom,(
% 0.13/0.42    (![X]: (( equalish(X,X)| ~ defined(X) ) ))),
% 0.13/0.42    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.13/0.42  fof(f26,axiom,(
% 0.13/0.42    (![Y,Z,X]: (( less_or_equal(Y,Z)| ~ less_or_equal(X,Z)| ~ equalish(X,Y) ) ))),
% 0.13/0.42    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.13/0.42  fof(f28,hypothesis,(
% 0.13/0.42    defined(a) ),
% 0.13/0.42    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.13/0.42  fof(f29,hypothesis,(
% 0.13/0.42    defined(b) ),
% 0.13/0.42    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.13/0.42  fof(f30,negated_conjecture,(
% 0.13/0.42    less_or_equal(a,b) ),
% 0.13/0.42    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.13/0.42  fof(f31,negated_conjecture,(
% 0.13/0.42    ~ less_or_equal(additive_identity,add(b,additive_inverse(a))) ),
% 0.13/0.42    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.13/0.42  fof(f35,plain,(
% 0.13/0.42    ![X0]: (equalish(add(X0,additive_inverse(X0)),additive_identity)|~defined(X0))),
% 0.13/0.42    inference(cnf_transformation,[status(thm)],[f3])).
% 0.13/0.42  fof(f48,plain,(
% 0.13/0.42    defined(additive_identity)),
% 0.13/0.42    inference(cnf_transformation,[status(thm)],[f11])).
% 0.13/0.42  fof(f49,plain,(
% 0.13/0.42    ![X0]: (defined(additive_inverse(X0))|~defined(X0))),
% 0.13/0.42    inference(cnf_transformation,[status(thm)],[f12])).
% 0.13/0.42  fof(f57,plain,(
% 0.13/0.42    ![Y]: ((![X]: ((less_or_equal(X,Y)|less_or_equal(Y,X))|~defined(X)))|~defined(Y))),
% 0.13/0.42    inference(miniscoping,[status(thm)],[f18])).
% 0.13/0.42  fof(f58,plain,(
% 0.13/0.42    ![X0,X1]: (less_or_equal(X0,X1)|less_or_equal(X1,X0)|~defined(X0)|~defined(X1))),
% 0.13/0.42    inference(cnf_transformation,[status(thm)],[f57])).
% 0.13/0.42  fof(f59,plain,(
% 0.13/0.42    ![X,Y]: ((![Z]: (less_or_equal(add(X,Z),add(Y,Z))|~defined(Z)))|~less_or_equal(X,Y))),
% 0.13/0.42    inference(miniscoping,[status(thm)],[f19])).
% 0.13/0.42  fof(f60,plain,(
% 0.13/0.42    ![X0,X1,X2]: (less_or_equal(add(X0,X1),add(X2,X1))|~defined(X1)|~less_or_equal(X0,X2))),
% 0.13/0.42    inference(cnf_transformation,[status(thm)],[f59])).
% 0.13/0.42  fof(f63,plain,(
% 0.13/0.42    ![X0]: (equalish(X0,X0)|~defined(X0))),
% 0.13/0.42    inference(cnf_transformation,[status(thm)],[f21])).
% 0.13/0.42  fof(f71,plain,(
% 0.13/0.42    ![Y,X]: ((![Z]: (less_or_equal(Y,Z)|~less_or_equal(X,Z)))|~equalish(X,Y))),
% 0.13/0.42    inference(miniscoping,[status(thm)],[f26])).
% 0.13/0.42  fof(f72,plain,(
% 0.13/0.42    ![X0,X1,X2]: (less_or_equal(X0,X1)|~less_or_equal(X2,X1)|~equalish(X2,X0))),
% 0.13/0.42    inference(cnf_transformation,[status(thm)],[f71])).
% 0.13/0.42  fof(f74,plain,(
% 0.13/0.42    defined(a)),
% 0.13/0.42    inference(cnf_transformation,[status(thm)],[f28])).
% 0.13/0.42  fof(f75,plain,(
% 0.13/0.42    defined(b)),
% 0.13/0.42    inference(cnf_transformation,[status(thm)],[f29])).
% 0.13/0.42  fof(f76,plain,(
% 0.13/0.42    less_or_equal(a,b)),
% 0.13/0.42    inference(cnf_transformation,[status(thm)],[f30])).
% 0.13/0.42  fof(f77,plain,(
% 0.13/0.42    ~less_or_equal(additive_identity,add(b,additive_inverse(a)))),
% 0.13/0.42    inference(cnf_transformation,[status(thm)],[f31])).
% 0.13/0.42  fof(f89,plain,(
% 0.13/0.42    ![X0]: (less_or_equal(X0,b)|~equalish(a,X0))),
% 0.13/0.42    inference(resolution,[status(thm)],[f72,f76])).
% 0.13/0.42  fof(f91,plain,(
% 0.13/0.42    less_or_equal(a,b)|~defined(a)),
% 0.13/0.42    inference(resolution,[status(thm)],[f89,f63])).
% 0.13/0.42  fof(f92,definition,(
% 0.13/0.42    sQ2_spl <=> (less_or_equal(a,b))),
% 0.13/0.42    introduced(definition,[new_symbols(definition,[sQ2_spl])],[split_symbol_definition])).
% 0.13/0.42  fof(f95,definition,(
% 0.13/0.42    sQ3_spl <=> (defined(a))),
% 0.13/0.42    introduced(definition,[new_symbols(definition,[sQ3_spl])],[split_symbol_definition])).
% 0.13/0.42  fof(f97,plain,(
% 0.13/0.42    ~defined(a)|sQ3_spl),
% 0.13/0.42    inference(component_clause,[status(thm)],[f95])).
% 0.13/0.42  fof(f98,plain,(
% 0.13/0.42    sQ2_spl|~sQ3_spl),
% 0.13/0.42    inference(split_clause,[status(thm)],[f91,f92,f95])).
% 0.13/0.42  fof(f106,plain,(
% 0.13/0.42    ![X0]: (less_or_equal(X0,b)|less_or_equal(b,X0)|~defined(X0))),
% 0.13/0.42    inference(resolution,[status(thm)],[f58,f75])).
% 0.13/0.42  fof(f107,plain,(
% 0.13/0.42    ![X0]: (less_or_equal(X0,a)|less_or_equal(a,X0)|~defined(X0))),
% 0.13/0.42    inference(resolution,[status(thm)],[f58,f74])).
% 0.13/0.42  fof(f108,plain,(
% 0.13/0.42    ![X0]: (less_or_equal(X0,additive_identity)|less_or_equal(additive_identity,X0)|~defined(X0))),
% 0.13/0.42    inference(resolution,[status(thm)],[f58,f48])).
% 0.13/0.42  fof(f171,plain,(
% 0.13/0.42    ![X0,X1,X2,X3]: (~defined(X0)|~less_or_equal(X1,X2)|less_or_equal(X3,add(X2,X0))|~equalish(add(X1,X0),X3))),
% 0.13/0.42    inference(resolution,[status(thm)],[f60,f72])).
% 0.13/0.42  fof(f193,definition,(
% 0.13/0.42    sQ18_spl <=> (defined(additive_identity))),
% 0.13/0.42    introduced(definition,[new_symbols(definition,[sQ18_spl])],[split_symbol_definition])).
% 0.13/0.42  fof(f195,plain,(
% 0.13/0.42    ~defined(additive_identity)|sQ18_spl),
% 0.13/0.42    inference(component_clause,[status(thm)],[f193])).
% 0.13/0.42  fof(f234,plain,(
% 0.13/0.42    $false|sQ3_spl),
% 0.13/0.42    inference(forward_subsumption_resolution,[status(thm)],[f97,f74])).
% 0.13/0.42  fof(f235,plain,(
% 0.13/0.42    sQ3_spl),
% 0.13/0.42    inference(contradiction_clause,[status(thm)],[f234])).
% 0.13/0.42  fof(f321,plain,(
% 0.13/0.42    $false|sQ18_spl),
% 0.13/0.42    inference(forward_subsumption_resolution,[status(thm)],[f195,f48])).
% 0.13/0.42  fof(f322,plain,(
% 0.13/0.42    sQ18_spl),
% 0.13/0.42    inference(contradiction_clause,[status(thm)],[f321])).
% 0.13/0.42  fof(f419,plain,(
% 0.13/0.42    less_or_equal(b,b)|less_or_equal(b,b)),
% 0.13/0.42    inference(resolution,[status(thm)],[f106,f75])).
% 0.13/0.42  fof(f423,definition,(
% 0.13/0.42    sQ33_spl <=> (less_or_equal(b,b))),
% 0.13/0.42    introduced(definition,[new_symbols(definition,[sQ33_spl])],[split_symbol_definition])).
% 0.13/0.42  fof(f426,plain,(
% 0.13/0.42    sQ33_spl),
% 0.13/0.42    inference(split_clause,[status(thm)],[f419,f423])).
% 0.13/0.42  fof(f441,plain,(
% 0.13/0.42    less_or_equal(a,a)|less_or_equal(a,a)),
% 0.13/0.42    inference(resolution,[status(thm)],[f107,f74])).
% 0.13/0.42  fof(f445,definition,(
% 0.13/0.42    sQ36_spl <=> (less_or_equal(a,a))),
% 0.13/0.42    introduced(definition,[new_symbols(definition,[sQ36_spl])],[split_symbol_definition])).
% 0.13/0.42  fof(f448,plain,(
% 0.13/0.42    sQ36_spl),
% 0.13/0.42    inference(split_clause,[status(thm)],[f441,f445])).
% 0.13/0.42  fof(f492,plain,(
% 0.13/0.42    less_or_equal(additive_identity,additive_identity)|less_or_equal(additive_identity,additive_identity)),
% 0.13/0.42    inference(resolution,[status(thm)],[f108,f48])).
% 0.13/0.42  fof(f496,definition,(
% 0.13/0.42    sQ40_spl <=> (less_or_equal(additive_identity,additive_identity))),
% 0.13/0.42    introduced(definition,[new_symbols(definition,[sQ40_spl])],[split_symbol_definition])).
% 0.13/0.42  fof(f499,plain,(
% 0.13/0.42    sQ40_spl),
% 0.13/0.42    inference(split_clause,[status(thm)],[f492,f496])).
% 0.13/0.42  fof(f501,plain,(
% 0.13/0.42    ![X0]: (~defined(additive_inverse(a))|~less_or_equal(X0,b)|~equalish(add(X0,additive_inverse(a)),additive_identity))),
% 0.13/0.42    inference(resolution,[status(thm)],[f171,f77])).
% 0.13/0.42  fof(f506,definition,(
% 0.13/0.42    sQ41_spl <=> (defined(additive_inverse(a)))),
% 0.13/0.42    introduced(definition,[new_symbols(definition,[sQ41_spl])],[split_symbol_definition])).
% 0.13/0.42  fof(f508,plain,(
% 0.13/0.42    ~defined(additive_inverse(a))|sQ41_spl),
% 0.13/0.42    inference(component_clause,[status(thm)],[f506])).
% 0.13/0.42  fof(f509,definition,(
% 0.13/0.42    ![X0]: (sQ42_spl <=> (~less_or_equal(X0,b)|~equalish(add(X0,additive_inverse(a)),additive_identity)))),
% 0.13/0.42    introduced(definition,[new_symbols(definition,[sQ42_spl])],[split_symbol_definition])).
% 0.13/0.42  fof(f510,plain,(
% 0.13/0.42    ![X0]: (~less_or_equal(X0,b)|~equalish(add(X0,additive_inverse(a)),additive_identity)|~sQ42_spl)),
% 0.13/0.42    inference(component_clause,[status(thm)],[f509])).
% 0.13/0.42  fof(f512,plain,(
% 0.13/0.42    ~sQ41_spl|sQ42_spl),
% 0.13/0.42    inference(split_clause,[status(thm)],[f501,f506,f509])).
% 0.13/0.42  fof(f517,plain,(
% 0.13/0.42    ~defined(a)|sQ41_spl),
% 0.13/0.42    inference(resolution,[status(thm)],[f508,f49])).
% 0.13/0.42  fof(f518,plain,(
% 0.13/0.42    ~sQ3_spl|sQ41_spl),
% 0.13/0.42    inference(split_clause,[status(thm)],[f517,f95,f506])).
% 0.13/0.42  fof(f568,plain,(
% 0.13/0.42    ~less_or_equal(a,b)|~defined(a)|~sQ42_spl),
% 0.13/0.42    inference(resolution,[status(thm)],[f510,f35])).
% 0.13/0.42  fof(f571,plain,(
% 0.13/0.42    ~sQ2_spl|~sQ3_spl|~sQ42_spl),
% 0.13/0.42    inference(split_clause,[status(thm)],[f568,f92,f95,f509])).
% 0.13/0.42  fof(f572,plain,(
% 0.13/0.42    $false),
% 0.13/0.42    inference(sat_refutation,[status(thm)],[f98,f235,f322,f426,f448,f499,f512,f518,f571])).
% 0.13/0.42  % SZS output end CNFRefutation for theBenchmark.p
% 0.13/0.50  % Elapsed time: 0.116871 seconds
% 0.13/0.50  % CPU time: 0.334538 seconds
% 0.13/0.50  % Total memory used: 20.999 MB
% 0.13/0.50  % Net memory used: 20.748 MB
%------------------------------------------------------------------------------