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

% Computer : n002.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 02:49:55 PM UTC 2026

% Result   : Unsatisfiable 0.07s 0.40s
% Output   : Assurance 0s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SWV007-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.04  % Command  : drodi -satmode(on) -timeout(300) /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.07/0.35  % Computer : n002.cluster.edu
% 0.07/0.35  % Model    : x86_64 x86_64
% 0.07/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.35  % Memory   : 8046.5625MB
% 0.07/0.35  % OS       : Linux 6.8.0-71-generic
% 0.07/0.35  % CPULimit : 300
% 0.07/0.35  % WCLimit  : 300
% 0.07/0.35  % DateTime : Mon Sep 21 08:29:02 UTC 2026
% 0.07/0.35  % CPUTime  : 
% 0.07/0.36  % Drodi V4.1.1
% 0.07/0.40  % Refutation found
% 0.07/0.40  % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 0.07/0.40  % SZS output start CNFRefutation for theBenchmark
% 0.07/0.40  fof(f6,axiom,(
% 0.07/0.40    (![X]: (less_than(X,successor(X)) ))),
% 0.07/0.40    file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.07/0.40  fof(f7,axiom,(
% 0.07/0.40    (![X,Z,Y]: (( less_than(X,Z)| ~ less_than(X,Y)| ~ less_than(Y,Z) ) ))),
% 0.07/0.40    file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.07/0.40  fof(f8,axiom,(
% 0.07/0.40    (![X,Y]: (( less_than(X,Y)| less_than(Y,X)| X = Y ) ))),
% 0.07/0.40    file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.07/0.40  fof(f10,axiom,(
% 0.07/0.40    (![X,Y]: (( ~ less_than(X,Y)| ~ less_than(Y,X) ) ))),
% 0.07/0.40    file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.07/0.40  fof(f16,negated_conjecture,(
% 0.07/0.40    ~ less_than(n,m) ),
% 0.07/0.40    file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.07/0.40  fof(f17,negated_conjecture,(
% 0.07/0.40    less_than(i,m) ),
% 0.07/0.40    file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.07/0.40  fof(f20,negated_conjecture,(
% 0.07/0.40    less_than(a(m),a(k)) ),
% 0.07/0.40    file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.07/0.40  fof(f23,negated_conjecture,(
% 0.07/0.40    (![X]: (( less_than(X,i)| ~ less_than(X,successor(n))| ~ less_than(a(X),a(k)) ) ))),
% 0.07/0.40    file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.07/0.40  fof(f29,plain,(
% 0.07/0.40    ![X0]: (less_than(X0,successor(X0)))),
% 0.07/0.40    inference(cnf_transformation,[status(thm)],[f6])).
% 0.07/0.40  fof(f30,plain,(
% 0.07/0.40    ![Z,Y]: ((![X]: (less_than(X,Z)|~less_than(X,Y)))|~less_than(Y,Z))),
% 0.07/0.40    inference(miniscoping,[status(thm)],[f7])).
% 0.07/0.40  fof(f31,plain,(
% 0.07/0.40    ![X0,X1,X2]: (less_than(X0,X1)|~less_than(X0,X2)|~less_than(X2,X1))),
% 0.07/0.40    inference(cnf_transformation,[status(thm)],[f30])).
% 0.07/0.40  fof(f32,plain,(
% 0.07/0.40    ![X0,X1]: (less_than(X0,X1)|less_than(X1,X0)|X0=X1)),
% 0.07/0.40    inference(cnf_transformation,[status(thm)],[f8])).
% 0.07/0.40  fof(f34,plain,(
% 0.07/0.40    ![X0,X1]: (~less_than(X0,X1)|~less_than(X1,X0))),
% 0.07/0.40    inference(cnf_transformation,[status(thm)],[f10])).
% 0.07/0.40  fof(f42,plain,(
% 0.07/0.40    ~less_than(n,m)),
% 0.07/0.40    inference(cnf_transformation,[status(thm)],[f16])).
% 0.07/0.40  fof(f43,plain,(
% 0.07/0.40    less_than(i,m)),
% 0.07/0.40    inference(cnf_transformation,[status(thm)],[f17])).
% 0.07/0.40  fof(f46,plain,(
% 0.07/0.40    less_than(a(m),a(k))),
% 0.07/0.40    inference(cnf_transformation,[status(thm)],[f20])).
% 0.07/0.40  fof(f49,plain,(
% 0.07/0.40    ![X0]: (less_than(X0,i)|~less_than(X0,successor(n))|~less_than(a(X0),a(k)))),
% 0.07/0.40    inference(cnf_transformation,[status(thm)],[f23])).
% 0.07/0.40  fof(f68,plain,(
% 0.07/0.40    ~less_than(m,i)),
% 0.07/0.40    inference(resolution,[status(thm)],[f34,f43])).
% 0.07/0.40  fof(f75,plain,(
% 0.07/0.40    ![X0,X1]: (less_than(X0,successor(X1))|~less_than(X0,X1))),
% 0.07/0.40    inference(resolution,[status(thm)],[f31,f29])).
% 0.07/0.40  fof(f78,plain,(
% 0.07/0.40    less_than(m,n)|n=m),
% 0.07/0.40    inference(resolution,[status(thm)],[f32,f42])).
% 0.07/0.40  fof(f120,plain,(
% 0.07/0.40    less_than(m,i)|~less_than(m,successor(n))),
% 0.07/0.40    inference(resolution,[status(thm)],[f49,f46])).
% 0.07/0.40  fof(f125,plain,(
% 0.07/0.40    ~less_than(m,successor(n))),
% 0.07/0.40    inference(forward_subsumption_resolution,[status(thm)],[f120,f68])).
% 0.07/0.40  fof(f146,plain,(
% 0.07/0.40    ~less_than(m,n)),
% 0.07/0.40    inference(resolution,[status(thm)],[f75,f125])).
% 0.07/0.40  fof(f151,plain,(
% 0.07/0.40    n=m),
% 0.07/0.40    inference(backward_subsumption_resolution,[status(thm)],[f78,f146])).
% 0.07/0.40  fof(f152,plain,(
% 0.07/0.40    ~less_than(n,successor(n))),
% 0.07/0.40    inference(backward_demodulation,[status(thm)],[f151,f125])).
% 0.07/0.40  fof(f167,plain,(
% 0.07/0.40    $false),
% 0.07/0.40    inference(forward_subsumption_resolution,[status(thm)],[f152,f29])).
% 0.07/0.40  % SZS output end CNFRefutation for theBenchmark.p
% 0.12/0.41  % Elapsed time: 0.052620 seconds
% 0.12/0.41  % CPU time: 0.154250 seconds
% 0.12/0.41  % Total memory used: 86.231 MB
% 0.12/0.41  % Net memory used: 85.890 MB
%------------------------------------------------------------------------------