↑ 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  : KRS003-1 : TPTP v9.3.1. Released v2.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : drodi -satmode(on) -timeout(300) /export/starexec/sandbox2/benchmark/theBenchmark.p

% Computer : n019.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 01:00:04 PM UTC 2026

% Result   : Unsatisfiable 0.18s 0.47s
% Output   : Assurance 0s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05  % Problem  : KRS003-1 : TPTP v9.3.1. Released v2.0.0.
% 0.00/0.06  % Command  : drodi -satmode(on) -timeout(300) /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.18/0.45  % Computer : n019.cluster.edu
% 0.18/0.45  % Model    : x86_64 x86_64
% 0.18/0.45  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.45  % Memory   : 8046.5625MB
% 0.18/0.45  % OS       : Linux 6.8.0-71-generic
% 0.18/0.45  % CPULimit : 300
% 0.18/0.45  % WCLimit  : 300
% 0.18/0.45  % DateTime : Sun Sep 20 22:50:20 UTC 2026
% 0.18/0.45  % CPUTime  : 
% 0.18/0.46  % Drodi V4.1.1
% 0.18/0.47  % Refutation found
% 0.18/0.47  % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 0.18/0.47  % SZS output start CNFRefutation for theBenchmark
% 0.18/0.47  fof(f1,negated_conjecture,(
% 0.18/0.47    e(exist) ),
% 0.18/0.47    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.18/0.47  fof(f2,negated_conjecture,(
% 0.18/0.47    f(exist) ),
% 0.18/0.47    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.18/0.47  fof(f3,axiom,(
% 0.18/0.47    (![X1]: (( s2least(X1)| ~ c(X1) ) ))),
% 0.18/0.47    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.18/0.47  fof(f5,axiom,(
% 0.18/0.47    (![X1]: (( ~ s2least(X1)| ~ equalish(u1r2(X1),u1r1(X1)) ) ))),
% 0.18/0.47    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.18/0.47  fof(f6,axiom,(
% 0.18/0.47    (![X1]: (( s(X1,u1r1(X1))| ~ s2least(X1) ) ))),
% 0.18/0.47    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.18/0.47  fof(f7,axiom,(
% 0.18/0.47    (![X1]: (( s(X1,u1r2(X1))| ~ s2least(X1) ) ))),
% 0.18/0.47    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.18/0.47  fof(f9,axiom,(
% 0.18/0.47    (![X1]: (( s1most(X1)| ~ d(X1) ) ))),
% 0.18/0.47    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.18/0.47  fof(f11,axiom,(
% 0.18/0.47    (![X3,X2,X1]: (( equalish(X3,X2)| ~ s1most(X1)| ~ s(X1,X3)| ~ s(X1,X2) ) ))),
% 0.18/0.47    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.18/0.47  fof(f15,axiom,(
% 0.18/0.47    (![X1]: (( c(X1)| ~ e(X1) ) ))),
% 0.18/0.47    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.18/0.47  fof(f16,axiom,(
% 0.18/0.47    (![X1]: (( d(X1)| ~ f(X1) ) ))),
% 0.18/0.47    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.18/0.47  fof(f17,plain,(
% 0.18/0.47    e(exist)),
% 0.18/0.47    inference(cnf_transformation,[status(thm)],[f1])).
% 0.18/0.47  fof(f18,plain,(
% 0.18/0.47    f(exist)),
% 0.18/0.47    inference(cnf_transformation,[status(thm)],[f2])).
% 0.18/0.47  fof(f19,plain,(
% 0.18/0.47    ![X0]: (s2least(X0)|~c(X0))),
% 0.18/0.47    inference(cnf_transformation,[status(thm)],[f3])).
% 0.18/0.47  fof(f21,plain,(
% 0.18/0.47    ![X0]: (~s2least(X0)|~equalish(u1r2(X0),u1r1(X0)))),
% 0.18/0.47    inference(cnf_transformation,[status(thm)],[f5])).
% 0.18/0.47  fof(f22,plain,(
% 0.18/0.47    ![X0]: (s(X0,u1r1(X0))|~s2least(X0))),
% 0.18/0.47    inference(cnf_transformation,[status(thm)],[f6])).
% 0.18/0.47  fof(f23,plain,(
% 0.18/0.47    ![X0]: (s(X0,u1r2(X0))|~s2least(X0))),
% 0.18/0.47    inference(cnf_transformation,[status(thm)],[f7])).
% 0.18/0.47  fof(f26,plain,(
% 0.18/0.47    ![X0]: (s1most(X0)|~d(X0))),
% 0.18/0.47    inference(cnf_transformation,[status(thm)],[f9])).
% 0.18/0.47  fof(f28,plain,(
% 0.18/0.47    ![X2,X1]: ((![X3]: ((equalish(X3,X2)|~s1most(X1))|~s(X1,X3)))|~s(X1,X2))),
% 0.18/0.47    inference(miniscoping,[status(thm)],[f11])).
% 0.18/0.47  fof(f29,plain,(
% 0.18/0.47    ![X0,X1,X2]: (equalish(X0,X1)|~s1most(X2)|~s(X2,X0)|~s(X2,X1))),
% 0.18/0.47    inference(cnf_transformation,[status(thm)],[f28])).
% 0.18/0.47  fof(f33,plain,(
% 0.18/0.47    ![X0]: (c(X0)|~e(X0))),
% 0.18/0.47    inference(cnf_transformation,[status(thm)],[f15])).
% 0.18/0.47  fof(f34,plain,(
% 0.18/0.47    ![X0]: (d(X0)|~f(X0))),
% 0.18/0.47    inference(cnf_transformation,[status(thm)],[f16])).
% 0.18/0.47  fof(f35,plain,(
% 0.18/0.47    ![X0]: (s2least(X0)|~e(X0))),
% 0.18/0.47    inference(resolution,[status(thm)],[f19,f33])).
% 0.18/0.47  fof(f37,plain,(
% 0.18/0.47    ![X0]: (s1most(X0)|~f(X0))),
% 0.18/0.47    inference(resolution,[status(thm)],[f26,f34])).
% 0.18/0.47  fof(f41,plain,(
% 0.18/0.47    ![X0,X1,X2]: (equalish(X0,X1)|~s(X2,X0)|~s(X2,X1)|~f(X2))),
% 0.18/0.47    inference(resolution,[status(thm)],[f29,f37])).
% 0.18/0.47  fof(f42,plain,(
% 0.18/0.47    ![X0,X1]: (equalish(X0,X1)|~s(exist,X0)|~s(exist,X1))),
% 0.18/0.47    inference(resolution,[status(thm)],[f41,f18])).
% 0.18/0.47  fof(f44,plain,(
% 0.18/0.47    ![X0]: (~s(exist,u1r2(X0))|~s(exist,u1r1(X0))|~s2least(X0))),
% 0.18/0.47    inference(resolution,[status(thm)],[f42,f21])).
% 0.18/0.47  fof(f60,plain,(
% 0.18/0.47    ~s(exist,u1r2(exist))|~s2least(exist)|~s2least(exist)),
% 0.18/0.47    inference(resolution,[status(thm)],[f44,f22])).
% 0.18/0.47  fof(f61,definition,(
% 0.18/0.47    sQ2_spl <=> (s(exist,u1r2(exist)))),
% 0.18/0.47    introduced(definition,[new_symbols(definition,[sQ2_spl])],[split_symbol_definition])).
% 0.18/0.47  fof(f63,plain,(
% 0.18/0.47    ~s(exist,u1r2(exist))|sQ2_spl),
% 0.18/0.47    inference(component_clause,[status(thm)],[f61])).
% 0.18/0.47  fof(f64,definition,(
% 0.18/0.47    sQ3_spl <=> (s2least(exist))),
% 0.18/0.47    introduced(definition,[new_symbols(definition,[sQ3_spl])],[split_symbol_definition])).
% 0.18/0.47  fof(f66,plain,(
% 0.18/0.47    ~s2least(exist)|sQ3_spl),
% 0.18/0.47    inference(component_clause,[status(thm)],[f64])).
% 0.18/0.47  fof(f67,plain,(
% 0.18/0.47    ~sQ2_spl|~sQ3_spl),
% 0.18/0.47    inference(split_clause,[status(thm)],[f60,f61,f64])).
% 0.18/0.47  fof(f68,plain,(
% 0.18/0.47    ~s2least(exist)|sQ2_spl),
% 0.18/0.47    inference(resolution,[status(thm)],[f63,f23])).
% 0.18/0.47  fof(f69,plain,(
% 0.18/0.47    ~e(exist)|sQ2_spl),
% 0.18/0.47    inference(resolution,[status(thm)],[f68,f35])).
% 0.18/0.47  fof(f70,plain,(
% 0.18/0.47    $false|sQ2_spl),
% 0.18/0.47    inference(forward_subsumption_resolution,[status(thm)],[f69,f17])).
% 0.18/0.48  fof(f71,plain,(
% 0.18/0.48    sQ2_spl),
% 0.18/0.48    inference(contradiction_clause,[status(thm)],[f70])).
% 0.18/0.48  fof(f72,plain,(
% 0.18/0.48    ~e(exist)|sQ3_spl),
% 0.18/0.48    inference(resolution,[status(thm)],[f66,f35])).
% 0.18/0.48  fof(f73,plain,(
% 0.18/0.48    $false|sQ3_spl),
% 0.18/0.48    inference(forward_subsumption_resolution,[status(thm)],[f72,f17])).
% 0.18/0.48  fof(f74,plain,(
% 0.18/0.48    sQ3_spl),
% 0.18/0.48    inference(contradiction_clause,[status(thm)],[f73])).
% 0.18/0.48  fof(f75,plain,(
% 0.18/0.48    $false),
% 0.18/0.48    inference(sat_refutation,[status(thm)],[f67,f71,f74])).
% 0.18/0.48  % SZS output end CNFRefutation for theBenchmark.p
% 0.18/0.52  % Elapsed time: 0.066286 seconds
% 0.18/0.52  % CPU time: 0.062595 seconds
% 0.18/0.52  % Total memory used: 1.099 MB
% 0.18/0.52  % Net memory used: 1.095 MB
%------------------------------------------------------------------------------