↑ 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  : FLD058-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 : n005.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:27 PM UTC 2026

% Result   : Unsatisfiable 0.15s 0.46s
% Output   : Assurance 0s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04  % Problem  : FLD058-1 : 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.15/0.41  % Computer : n005.cluster.edu
% 0.15/0.41  % Model    : x86_64 x86_64
% 0.15/0.41  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.41  % Memory   : 8046.5625MB
% 0.15/0.41  % OS       : Linux 6.8.0-71-generic
% 0.15/0.41  % CPULimit : 300
% 0.15/0.41  % WCLimit  : 300
% 0.15/0.41  % DateTime : Mon Sep 21 15:43:33 UTC 2026
% 0.15/0.42  % CPUTime  : 
% 0.15/0.43  % Drodi V4.1.1
% 0.15/0.46  % Refutation found
% 0.15/0.46  % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 0.15/0.46  % SZS output start CNFRefutation for theBenchmark
% 0.15/0.46  fof(f16,axiom,(
% 0.15/0.46    (![X,Y]: (( equalish(X,Y)| ~ less_or_equal(X,Y)| ~ less_or_equal(Y,X) ) ))),
% 0.15/0.46    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.15/0.46  fof(f22,axiom,(
% 0.15/0.46    (![X,Y]: (( equalish(X,Y)| ~ equalish(Y,X) ) ))),
% 0.15/0.46    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.15/0.46  fof(f23,axiom,(
% 0.15/0.46    (![X,Z,Y]: (( equalish(X,Z)| ~ equalish(X,Y)| ~ equalish(Y,Z) ) ))),
% 0.15/0.46    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.15/0.46  fof(f26,axiom,(
% 0.15/0.46    (![Y,Z,X]: (( less_or_equal(Y,Z)| ~ less_or_equal(X,Z)| ~ equalish(X,Y) ) ))),
% 0.15/0.46    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.15/0.46  fof(f30,negated_conjecture,(
% 0.15/0.46    less_or_equal(additive_identity,a) ),
% 0.15/0.46    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.15/0.46  fof(f31,negated_conjecture,(
% 0.15/0.46    less_or_equal(a,b) ),
% 0.15/0.46    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.15/0.46  fof(f32,negated_conjecture,(
% 0.15/0.46    ~ equalish(a,additive_identity) ),
% 0.15/0.46    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.15/0.46  fof(f33,negated_conjecture,(
% 0.15/0.46    equalish(b,additive_identity) ),
% 0.15/0.46    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.15/0.46  fof(f56,plain,(
% 0.15/0.46    ![X0,X1]: (equalish(X0,X1)|~less_or_equal(X0,X1)|~less_or_equal(X1,X0))),
% 0.15/0.46    inference(cnf_transformation,[status(thm)],[f16])).
% 0.15/0.46  fof(f66,plain,(
% 0.15/0.46    ![X0,X1]: (equalish(X0,X1)|~equalish(X1,X0))),
% 0.15/0.46    inference(cnf_transformation,[status(thm)],[f22])).
% 0.15/0.46  fof(f67,plain,(
% 0.15/0.46    ![Z,Y]: ((![X]: (equalish(X,Z)|~equalish(X,Y)))|~equalish(Y,Z))),
% 0.15/0.46    inference(miniscoping,[status(thm)],[f23])).
% 0.15/0.46  fof(f68,plain,(
% 0.15/0.46    ![X0,X1,X2]: (equalish(X0,X1)|~equalish(X0,X2)|~equalish(X2,X1))),
% 0.15/0.46    inference(cnf_transformation,[status(thm)],[f67])).
% 0.15/0.46  fof(f73,plain,(
% 0.15/0.46    ![Y,X]: ((![Z]: (less_or_equal(Y,Z)|~less_or_equal(X,Z)))|~equalish(X,Y))),
% 0.15/0.46    inference(miniscoping,[status(thm)],[f26])).
% 0.15/0.46  fof(f74,plain,(
% 0.15/0.46    ![X0,X1,X2]: (less_or_equal(X0,X1)|~less_or_equal(X2,X1)|~equalish(X2,X0))),
% 0.15/0.46    inference(cnf_transformation,[status(thm)],[f73])).
% 0.15/0.46  fof(f78,plain,(
% 0.15/0.46    less_or_equal(additive_identity,a)),
% 0.15/0.46    inference(cnf_transformation,[status(thm)],[f30])).
% 0.15/0.46  fof(f79,plain,(
% 0.15/0.46    less_or_equal(a,b)),
% 0.15/0.46    inference(cnf_transformation,[status(thm)],[f31])).
% 0.15/0.46  fof(f80,plain,(
% 0.15/0.46    ~equalish(a,additive_identity)),
% 0.15/0.46    inference(cnf_transformation,[status(thm)],[f32])).
% 0.15/0.46  fof(f81,plain,(
% 0.15/0.46    equalish(b,additive_identity)),
% 0.15/0.46    inference(cnf_transformation,[status(thm)],[f33])).
% 0.15/0.46  fof(f82,plain,(
% 0.15/0.46    ~equalish(additive_identity,a)),
% 0.15/0.46    inference(resolution,[status(thm)],[f66,f80])).
% 0.15/0.46  fof(f84,plain,(
% 0.15/0.46    equalish(b,a)|~less_or_equal(b,a)),
% 0.15/0.46    inference(resolution,[status(thm)],[f56,f79])).
% 0.15/0.46  fof(f86,definition,(
% 0.15/0.46    sQ0_spl <=> (equalish(b,a))),
% 0.15/0.46    introduced(definition,[new_symbols(definition,[sQ0_spl])],[split_symbol_definition])).
% 0.15/0.46  fof(f87,plain,(
% 0.15/0.46    equalish(b,a)|~sQ0_spl),
% 0.15/0.46    inference(component_clause,[status(thm)],[f86])).
% 0.15/0.46  fof(f89,definition,(
% 0.15/0.46    sQ1_spl <=> (less_or_equal(b,a))),
% 0.15/0.46    introduced(definition,[new_symbols(definition,[sQ1_spl])],[split_symbol_definition])).
% 0.15/0.46  fof(f91,plain,(
% 0.15/0.46    ~less_or_equal(b,a)|sQ1_spl),
% 0.15/0.46    inference(component_clause,[status(thm)],[f89])).
% 0.15/0.46  fof(f92,plain,(
% 0.15/0.46    sQ0_spl|~sQ1_spl),
% 0.15/0.46    inference(split_clause,[status(thm)],[f84,f86,f89])).
% 0.15/0.46  fof(f122,plain,(
% 0.15/0.46    ![X0]: (~equalish(additive_identity,X0)|~equalish(X0,a))),
% 0.15/0.46    inference(resolution,[status(thm)],[f68,f82])).
% 0.15/0.46  fof(f154,plain,(
% 0.15/0.46    ![X0]: (~equalish(X0,a)|~equalish(X0,additive_identity))),
% 0.15/0.46    inference(resolution,[status(thm)],[f122,f66])).
% 0.15/0.46  fof(f187,plain,(
% 0.15/0.46    ~equalish(b,additive_identity)|~sQ0_spl),
% 0.15/0.46    inference(resolution,[status(thm)],[f154,f87])).
% 0.15/0.46  fof(f199,plain,(
% 0.15/0.46    $false|~sQ0_spl),
% 0.15/0.46    inference(forward_subsumption_resolution,[status(thm)],[f187,f81])).
% 0.15/0.46  fof(f200,plain,(
% 0.15/0.46    ~sQ0_spl),
% 0.15/0.46    inference(contradiction_clause,[status(thm)],[f199])).
% 0.15/0.46  fof(f238,plain,(
% 0.15/0.46    ![X0]: (less_or_equal(X0,a)|~equalish(additive_identity,X0))),
% 0.15/0.46    inference(resolution,[status(thm)],[f74,f78])).
% 0.15/0.46  fof(f334,plain,(
% 0.15/0.46    ![X0]: (less_or_equal(X0,a)|~equalish(X0,additive_identity))),
% 0.15/0.46    inference(resolution,[status(thm)],[f238,f66])).
% 0.15/0.46  fof(f458,plain,(
% 0.15/0.47    less_or_equal(b,a)),
% 0.15/0.47    inference(resolution,[status(thm)],[f334,f81])).
% 0.15/0.47  fof(f470,plain,(
% 0.15/0.47    $false|sQ1_spl),
% 0.15/0.47    inference(forward_subsumption_resolution,[status(thm)],[f458,f91])).
% 0.15/0.47  fof(f471,plain,(
% 0.15/0.47    sQ1_spl),
% 0.15/0.47    inference(contradiction_clause,[status(thm)],[f470])).
% 0.15/0.47  fof(f472,plain,(
% 0.15/0.47    $false),
% 0.15/0.47    inference(sat_refutation,[status(thm)],[f92,f200,f471])).
% 0.15/0.47  % SZS output end CNFRefutation for theBenchmark.p
% 0.15/0.49  % Elapsed time: 0.061189 seconds
% 0.15/0.49  % CPU time: 0.209981 seconds
% 0.15/0.49  % Total memory used: 18.810 MB
% 0.15/0.49  % Net memory used: 18.614 MB
%------------------------------------------------------------------------------