↑ 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  : KRS001-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 : n015.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:03 PM UTC 2026

% Result   : Unsatisfiable 0.19s 0.48s
% Output   : Assurance 0s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05  % Problem  : KRS001-1 : TPTP v9.3.1. Released v2.0.0.
% 0.00/0.07  % Command  : drodi -satmode(on) -timeout(300) /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.45  % Computer : n015.cluster.edu
% 0.19/0.45  % Model    : x86_64 x86_64
% 0.19/0.45  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.19/0.45  % Memory   : 8046.5625MB
% 0.19/0.45  % OS       : Linux 6.8.0-71-generic
% 0.19/0.45  % CPULimit : 300
% 0.19/0.45  % WCLimit  : 300
% 0.19/0.45  % DateTime : Sun Sep 20 22:52:35 UTC 2026
% 0.19/0.45  % CPUTime  : 
% 0.19/0.46  % Drodi V4.1.1
% 0.19/0.48  % Refutation found
% 0.19/0.48  % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 0.19/0.48  % SZS output start CNFRefutation for theBenchmark
% 0.19/0.48  fof(f1,negated_conjecture,(
% 0.19/0.48    e(exist) ),
% 0.19/0.48    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.19/0.48  fof(f2,axiom,(
% 0.19/0.48    (![X1]: (( r2least(X1)| ~ c(X1) ) ))),
% 0.19/0.48    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.19/0.48  fof(f4,axiom,(
% 0.19/0.48    (![X1]: (( ~ r2least(X1)| ~ equalish(u1r2(X1),u1r1(X1)) ) ))),
% 0.19/0.48    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.19/0.48  fof(f5,axiom,(
% 0.19/0.48    (![X1]: (( r(X1,u1r1(X1))| ~ r2least(X1) ) ))),
% 0.19/0.48    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.19/0.48  fof(f6,axiom,(
% 0.19/0.48    (![X1]: (( r(X1,u1r2(X1))| ~ r2least(X1) ) ))),
% 0.19/0.48    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.19/0.48  fof(f8,axiom,(
% 0.19/0.48    (![X1]: (( r1most(X1)| ~ d(X1) ) ))),
% 0.19/0.48    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.19/0.48  fof(f10,axiom,(
% 0.19/0.48    (![X3,X2,X1]: (( equalish(X3,X2)| ~ r1most(X1)| ~ r(X1,X3)| ~ r(X1,X2) ) ))),
% 0.19/0.48    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.19/0.48  fof(f14,axiom,(
% 0.19/0.48    (![X1]: (( d(X1)| ~ e(X1) ) ))),
% 0.19/0.48    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.19/0.48  fof(f15,axiom,(
% 0.19/0.48    (![X1]: (( c(X1)| ~ e(X1) ) ))),
% 0.19/0.48    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.19/0.48  fof(f17,plain,(
% 0.19/0.48    e(exist)),
% 0.19/0.48    inference(cnf_transformation,[status(thm)],[f1])).
% 0.19/0.48  fof(f18,plain,(
% 0.19/0.48    ![X0]: (r2least(X0)|~c(X0))),
% 0.19/0.48    inference(cnf_transformation,[status(thm)],[f2])).
% 0.19/0.48  fof(f20,plain,(
% 0.19/0.48    ![X0]: (~r2least(X0)|~equalish(u1r2(X0),u1r1(X0)))),
% 0.19/0.48    inference(cnf_transformation,[status(thm)],[f4])).
% 0.19/0.48  fof(f21,plain,(
% 0.19/0.48    ![X0]: (r(X0,u1r1(X0))|~r2least(X0))),
% 0.19/0.48    inference(cnf_transformation,[status(thm)],[f5])).
% 0.19/0.48  fof(f22,plain,(
% 0.19/0.48    ![X0]: (r(X0,u1r2(X0))|~r2least(X0))),
% 0.19/0.48    inference(cnf_transformation,[status(thm)],[f6])).
% 0.19/0.48  fof(f25,plain,(
% 0.19/0.48    ![X0]: (r1most(X0)|~d(X0))),
% 0.19/0.48    inference(cnf_transformation,[status(thm)],[f8])).
% 0.19/0.48  fof(f27,plain,(
% 0.19/0.48    ![X2,X1]: ((![X3]: ((equalish(X3,X2)|~r1most(X1))|~r(X1,X3)))|~r(X1,X2))),
% 0.19/0.48    inference(miniscoping,[status(thm)],[f10])).
% 0.19/0.48  fof(f28,plain,(
% 0.19/0.48    ![X0,X1,X2]: (equalish(X0,X1)|~r1most(X2)|~r(X2,X0)|~r(X2,X1))),
% 0.19/0.48    inference(cnf_transformation,[status(thm)],[f27])).
% 0.19/0.48  fof(f32,plain,(
% 0.19/0.48    ![X0]: (d(X0)|~e(X0))),
% 0.19/0.48    inference(cnf_transformation,[status(thm)],[f14])).
% 0.19/0.48  fof(f33,plain,(
% 0.19/0.48    ![X0]: (c(X0)|~e(X0))),
% 0.19/0.48    inference(cnf_transformation,[status(thm)],[f15])).
% 0.19/0.48  fof(f35,plain,(
% 0.19/0.48    d(exist)),
% 0.19/0.48    inference(resolution,[status(thm)],[f32,f17])).
% 0.19/0.48  fof(f36,plain,(
% 0.19/0.48    c(exist)),
% 0.19/0.48    inference(resolution,[status(thm)],[f33,f17])).
% 0.19/0.48  fof(f45,plain,(
% 0.19/0.48    r2least(exist)),
% 0.19/0.48    inference(resolution,[status(thm)],[f18,f36])).
% 0.19/0.48  fof(f47,plain,(
% 0.19/0.48    r1most(exist)),
% 0.19/0.48    inference(resolution,[status(thm)],[f25,f35])).
% 0.19/0.48  fof(f49,plain,(
% 0.19/0.48    r(exist,u1r1(exist))),
% 0.19/0.48    inference(resolution,[status(thm)],[f21,f45])).
% 0.19/0.48  fof(f50,plain,(
% 0.19/0.48    r(exist,u1r2(exist))),
% 0.19/0.48    inference(resolution,[status(thm)],[f22,f45])).
% 0.19/0.48  fof(f51,plain,(
% 0.19/0.48    ![X0]: (equalish(X0,u1r1(exist))|~r1most(exist)|~r(exist,X0))),
% 0.19/0.48    inference(resolution,[status(thm)],[f28,f49])).
% 0.19/0.48  fof(f52,definition,(
% 0.19/0.48    ![X0]: (sQ2_spl <=> (equalish(X0,u1r1(exist))|~r(exist,X0)))),
% 0.19/0.48    introduced(definition,[new_symbols(definition,[sQ2_spl])],[split_symbol_definition])).
% 0.19/0.48  fof(f53,plain,(
% 0.19/0.48    ![X0]: (equalish(X0,u1r1(exist))|~r(exist,X0)|~sQ2_spl)),
% 0.19/0.48    inference(component_clause,[status(thm)],[f52])).
% 0.19/0.48  fof(f55,definition,(
% 0.19/0.48    sQ3_spl <=> (r1most(exist))),
% 0.19/0.48    introduced(definition,[new_symbols(definition,[sQ3_spl])],[split_symbol_definition])).
% 0.19/0.48  fof(f57,plain,(
% 0.19/0.48    ~r1most(exist)|sQ3_spl),
% 0.19/0.48    inference(component_clause,[status(thm)],[f55])).
% 0.19/0.48  fof(f58,plain,(
% 0.19/0.48    sQ2_spl|~sQ3_spl),
% 0.19/0.48    inference(split_clause,[status(thm)],[f51,f52,f55])).
% 0.19/0.48  fof(f105,plain,(
% 0.19/0.48    equalish(u1r2(exist),u1r1(exist))|~sQ2_spl),
% 0.19/0.48    inference(resolution,[status(thm)],[f53,f50])).
% 0.19/0.48  fof(f130,plain,(
% 0.19/0.48    ~r2least(exist)|~sQ2_spl),
% 0.19/0.48    inference(resolution,[status(thm)],[f105,f20])).
% 0.19/0.48  fof(f131,plain,(
% 0.19/0.48    $false|~sQ2_spl),
% 0.19/0.48    inference(forward_subsumption_resolution,[status(thm)],[f130,f45])).
% 0.19/0.48  fof(f132,plain,(
% 0.19/0.48    ~sQ2_spl),
% 0.19/0.48    inference(contradiction_clause,[status(thm)],[f131])).
% 0.19/0.48  fof(f133,plain,(
% 0.19/0.48    $false|sQ3_spl),
% 0.19/0.48    inference(forward_subsumption_resolution,[status(thm)],[f57,f47])).
% 0.19/0.49  fof(f134,plain,(
% 0.19/0.49    sQ3_spl),
% 0.19/0.49    inference(contradiction_clause,[status(thm)],[f133])).
% 0.19/0.49  fof(f135,plain,(
% 0.19/0.49    $false),
% 0.19/0.49    inference(sat_refutation,[status(thm)],[f58,f132,f134])).
% 0.19/0.49  % SZS output end CNFRefutation for theBenchmark.p
% 0.25/0.55  % Elapsed time: 0.082668 seconds
% 0.25/0.55  % CPU time: 0.079485 seconds
% 0.25/0.55  % Total memory used: 5.332 MB
% 0.25/0.55  % Net memory used: 5.245 MB
%------------------------------------------------------------------------------