↑ Up

Drodi-SAT---4.1.1.THM-Ass.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Drodi-SAT---4.1.1
% Problem  : SWV165+1 : TPTP v9.3.1. Bugfixed v3.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : drodi -satmode(on) -timeout(300) /export/starexec/sandbox2/benchmark/theBenchmark.p

% Computer : n013.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:50:10 PM UTC 2026

% Result   : Theorem 0.13s 0.40s
% Output   : Assurance 0s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SWV165+1 : TPTP v9.3.1. Bugfixed v3.3.0.
% 0.00/0.04  % Command  : drodi -satmode(on) -timeout(300) /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.08/0.35  % Computer : n013.cluster.edu
% 0.08/0.35  % Model    : x86_64 x86_64
% 0.08/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.35  % Memory   : 8046.5625MB
% 0.08/0.35  % OS       : Linux 6.8.0-71-generic
% 0.08/0.35  % CPULimit : 300
% 0.08/0.35  % WCLimit  : 300
% 0.08/0.35  % DateTime : Mon Sep 21 08:33:06 UTC 2026
% 0.08/0.35  % CPUTime  : 
% 0.08/0.37  % Drodi V4.1.1
% 0.13/0.40  % Refutation found
% 0.13/0.40  % SZS status Theorem for theBenchmark: Theorem is valid
% 0.13/0.40  % SZS output start CNFRefutation for theBenchmark
% 0.13/0.40  fof(f3,axiom,(
% 0.13/0.40    (! [X] : ~ gt(X,X) )),
% 0.13/0.40    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.13/0.40  fof(f5,axiom,(
% 0.13/0.40    (! [X,Y,Z] :( ( leq(X,Y)& leq(Y,Z) )=> leq(X,Z) ) )),
% 0.13/0.40    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.13/0.40  fof(f8,axiom,(
% 0.13/0.40    (! [X,Y] :( gt(Y,X)=> leq(X,Y) ) )),
% 0.13/0.40    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.13/0.40  fof(f53,conjecture,(
% 0.13/0.40    (! [A] :( ( leq(n0,A)& leq(A,tptp_minus_1) )=> uninit = init ) )),
% 0.13/0.40    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.13/0.40  fof(f54,negated_conjecture,(
% 0.13/0.40    ~((! [A] :( ( leq(n0,A)& leq(A,tptp_minus_1) )=> uninit = init ) ))),
% 0.13/0.40    inference(negated_conjecture,[status(cth)],[f53])).
% 0.13/0.40  fof(f58,axiom,(
% 0.13/0.40    gt(n0,tptp_minus_1) ),
% 0.13/0.40    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.13/0.40  fof(f78,axiom,(
% 0.13/0.40    (! [X] :( ( leq(n0,X)& leq(X,n0) )=> X = n0 ) )),
% 0.13/0.40    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.13/0.40  fof(f91,plain,(
% 0.13/0.40    ![X0]: (~gt(X0,X0))),
% 0.13/0.40    inference(cnf_transformation,[status(thm)],[f3])).
% 0.13/0.40  fof(f93,plain,(
% 0.13/0.40    ![X,Y,Z]: ((~leq(X,Y)|~leq(Y,Z))|leq(X,Z))),
% 0.13/0.40    inference(pre_NNF_transformation,[status(thm)],[f5])).
% 0.13/0.40  fof(f94,plain,(
% 0.13/0.40    ![X,Z]: ((![Y]: (~leq(X,Y)|~leq(Y,Z)))|leq(X,Z))),
% 0.13/0.40    inference(miniscoping,[status(thm)],[f93])).
% 0.13/0.40  fof(f95,plain,(
% 0.13/0.40    ![X0,X1,X2]: (~leq(X0,X1)|~leq(X1,X2)|leq(X0,X2))),
% 0.13/0.40    inference(cnf_transformation,[status(thm)],[f94])).
% 0.13/0.40  fof(f104,plain,(
% 0.13/0.40    ![X,Y]: (~gt(Y,X)|leq(X,Y))),
% 0.13/0.40    inference(pre_NNF_transformation,[status(thm)],[f8])).
% 0.13/0.40  fof(f105,plain,(
% 0.13/0.40    ![X0,X1]: (~gt(X0,X1)|leq(X1,X0))),
% 0.13/0.40    inference(cnf_transformation,[status(thm)],[f104])).
% 0.13/0.40  fof(f244,plain,(
% 0.13/0.40    (?[A]: ((leq(n0,A)&leq(A,tptp_minus_1))&~uninit=init))),
% 0.13/0.40    inference(pre_NNF_transformation,[status(thm)],[f54])).
% 0.13/0.40  fof(f245,plain,(
% 0.13/0.40    (?[A]: (leq(n0,A)&leq(A,tptp_minus_1)))&~uninit=init),
% 0.13/0.40    inference(miniscoping,[status(thm)],[f244])).
% 0.13/0.40  fof(f246,plain,(
% 0.13/0.40    (leq(n0,sK23_skl)&leq(sK23_skl,tptp_minus_1))&~uninit=init),
% 0.13/0.40    inference(skolemize,[status(esa),new_symbols(skolem,[sK23_skl]),skolemize(A,sK23_skl)],[f245])).
% 0.13/0.40  fof(f247,plain,(
% 0.13/0.40    leq(n0,sK23_skl)),
% 0.13/0.40    inference(cnf_transformation,[status(thm)],[f246])).
% 0.13/0.40  fof(f248,plain,(
% 0.13/0.40    leq(sK23_skl,tptp_minus_1)),
% 0.13/0.40    inference(cnf_transformation,[status(thm)],[f246])).
% 0.13/0.40  fof(f253,plain,(
% 0.13/0.40    gt(n0,tptp_minus_1)),
% 0.13/0.40    inference(cnf_transformation,[status(thm)],[f58])).
% 0.13/0.40  fof(f275,plain,(
% 0.13/0.40    ![X]: ((~leq(n0,X)|~leq(X,n0))|X=n0)),
% 0.13/0.40    inference(pre_NNF_transformation,[status(thm)],[f78])).
% 0.13/0.40  fof(f276,plain,(
% 0.13/0.40    ![X0]: (~leq(n0,X0)|~leq(X0,n0)|X0=n0)),
% 0.13/0.40    inference(cnf_transformation,[status(thm)],[f275])).
% 0.13/0.40  fof(f326,plain,(
% 0.13/0.40    ![X0]: (~leq(X0,sK23_skl)|leq(X0,tptp_minus_1))),
% 0.13/0.40    inference(resolution,[status(thm)],[f95,f248])).
% 0.13/0.40  fof(f331,plain,(
% 0.13/0.40    leq(n0,tptp_minus_1)),
% 0.13/0.40    inference(resolution,[status(thm)],[f326,f247])).
% 0.13/0.40  fof(f339,plain,(
% 0.13/0.40    ~leq(tptp_minus_1,n0)|tptp_minus_1=n0),
% 0.13/0.40    inference(resolution,[status(thm)],[f276,f331])).
% 0.13/0.40  fof(f343,definition,(
% 0.13/0.40    sQ0_spl <=> (leq(tptp_minus_1,n0))),
% 0.13/0.40    introduced(definition,[new_symbols(definition,[sQ0_spl])],[split_symbol_definition])).
% 0.13/0.40  fof(f345,plain,(
% 0.13/0.40    ~leq(tptp_minus_1,n0)|sQ0_spl),
% 0.13/0.40    inference(component_clause,[status(thm)],[f343])).
% 0.13/0.40  fof(f346,definition,(
% 0.13/0.40    sQ1_spl <=> (tptp_minus_1=n0)),
% 0.13/0.40    introduced(definition,[new_symbols(definition,[sQ1_spl])],[split_symbol_definition])).
% 0.13/0.40  fof(f347,plain,(
% 0.13/0.40    tptp_minus_1=n0|~sQ1_spl),
% 0.13/0.40    inference(component_clause,[status(thm)],[f346])).
% 0.13/0.40  fof(f349,plain,(
% 0.13/0.40    ~sQ0_spl|sQ1_spl),
% 0.13/0.40    inference(split_clause,[status(thm)],[f339,f343,f346])).
% 0.13/0.40  fof(f582,plain,(
% 0.13/0.40    leq(tptp_minus_1,n0)),
% 0.13/0.40    inference(resolution,[status(thm)],[f105,f253])).
% 0.13/0.40  fof(f600,plain,(
% 0.13/0.40    $false|sQ0_spl),
% 0.13/0.40    inference(forward_subsumption_resolution,[status(thm)],[f582,f345])).
% 0.13/0.40  fof(f601,plain,(
% 0.13/0.40    sQ0_spl),
% 0.13/0.40    inference(contradiction_clause,[status(thm)],[f600])).
% 0.13/0.40  fof(f619,plain,(
% 0.13/0.40    gt(tptp_minus_1,tptp_minus_1)|~sQ1_spl),
% 0.13/0.40    inference(backward_demodulation,[status(thm)],[f347,f253])).
% 0.13/0.40  fof(f626,plain,(
% 0.13/0.40    $false|~sQ1_spl),
% 0.13/0.40    inference(forward_subsumption_resolution,[status(thm)],[f619,f91])).
% 0.13/0.40  fof(f627,plain,(
% 0.13/0.40    ~sQ1_spl),
% 0.13/0.40    inference(contradiction_clause,[status(thm)],[f626])).
% 0.13/0.40  fof(f628,plain,(
% 0.13/0.40    $false),
% 0.13/0.40    inference(sat_refutation,[status(thm)],[f349,f601,f627])).
% 0.13/0.40  % SZS output end CNFRefutation for theBenchmark.p
% 0.13/0.43  % Elapsed time: 0.063430 seconds
% 0.13/0.43  % CPU time: 0.193712 seconds
% 0.13/0.43  % Total memory used: 109.020 MB
% 0.13/0.43  % Net memory used: 108.690 MB
%------------------------------------------------------------------------------