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

% Computer : n003.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:28:22 PM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : MSC012+1 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.03  % Command  : drodi -satmode(on) -timeout(300) /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.08/0.53  % Computer : n003.cluster.edu
% 0.08/0.53  % Model    : x86_64 x86_64
% 0.08/0.53  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.53  % Memory   : 8046.5625MB
% 0.08/0.53  % OS       : Linux 6.8.0-71-generic
% 0.08/0.53  % CPULimit : 300
% 0.08/0.53  % WCLimit  : 300
% 0.08/0.53  % DateTime : Mon Sep 21 01:29:16 UTC 2026
% 0.08/0.53  % CPUTime  : 
% 0.08/0.54  % Drodi V4.1.1
% 0.13/0.56  % Refutation found
% 0.13/0.56  % SZS status Theorem for theBenchmark: Theorem is valid
% 0.13/0.56  % SZS output start CNFRefutation for theBenchmark
% 0.13/0.56  fof(f1,axiom,(
% 0.13/0.56    (! [A,B] :( ( p(A)& less(A,B)& p(B) )=> goal ) )),
% 0.13/0.56    file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.13/0.56  fof(f2,axiom,(
% 0.13/0.56    (! [A] :( p(A)| (? [B] :( less(A,B)& p(B) ) )) )),
% 0.13/0.56    file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.13/0.56  fof(f3,axiom,(
% 0.13/0.56    (! [A,B,C] :( ( less(A,B)& less(B,C) )=> less(A,C) ) )),
% 0.13/0.56    file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.13/0.56  fof(f4,axiom,(
% 0.13/0.56    (! [A] :(? [B] : less(A,B) ))),
% 0.13/0.56    file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.13/0.56  fof(f5,conjecture,(
% 0.13/0.56    goal ),
% 0.13/0.56    file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.13/0.56  fof(f6,negated_conjecture,(
% 0.13/0.56    ~(goal )),
% 0.13/0.56    inference(negated_conjecture,[status(cth)],[f5])).
% 0.13/0.56  fof(f7,plain,(
% 0.13/0.56    ![A,B]: (((~p(A)|~less(A,B))|~p(B))|goal)),
% 0.13/0.56    inference(pre_NNF_transformation,[status(thm)],[f1])).
% 0.13/0.56  fof(f8,plain,(
% 0.13/0.56    (![B]: ((![A]: (~p(A)|~less(A,B)))|~p(B)))|goal),
% 0.13/0.56    inference(miniscoping,[status(thm)],[f7])).
% 0.13/0.56  fof(f9,plain,(
% 0.13/0.56    ![X0,X1]: (~p(X0)|~less(X0,X1)|~p(X1)|goal)),
% 0.13/0.56    inference(cnf_transformation,[status(thm)],[f8])).
% 0.13/0.56  fof(f10,plain,(
% 0.13/0.56    ![A]: (p(A)|(less(A,sK0_skl(A))&p(sK0_skl(A))))),
% 0.13/0.56    inference(skolemize,[status(esa),new_symbols(skolem,[sK0_skl]),skolemize(B,sK0_skl(A))],[f2])).
% 0.13/0.56  fof(f11,plain,(
% 0.13/0.56    ![X0]: (p(X0)|less(X0,sK0_skl(X0)))),
% 0.13/0.56    inference(cnf_transformation,[status(thm)],[f10])).
% 0.13/0.56  fof(f12,plain,(
% 0.13/0.56    ![X0]: (p(X0)|p(sK0_skl(X0)))),
% 0.13/0.56    inference(cnf_transformation,[status(thm)],[f10])).
% 0.13/0.56  fof(f13,plain,(
% 0.13/0.56    ![A,B,C]: ((~less(A,B)|~less(B,C))|less(A,C))),
% 0.13/0.56    inference(pre_NNF_transformation,[status(thm)],[f3])).
% 0.13/0.56  fof(f14,plain,(
% 0.13/0.56    ![A,C]: ((![B]: (~less(A,B)|~less(B,C)))|less(A,C))),
% 0.13/0.56    inference(miniscoping,[status(thm)],[f13])).
% 0.13/0.56  fof(f15,plain,(
% 0.13/0.56    ![X0,X1,X2]: (~less(X0,X1)|~less(X1,X2)|less(X0,X2))),
% 0.13/0.56    inference(cnf_transformation,[status(thm)],[f14])).
% 0.13/0.56  fof(f16,plain,(
% 0.13/0.56    ![A]: less(A,sK1_skl(A))),
% 0.13/0.56    inference(skolemize,[status(esa),new_symbols(skolem,[sK1_skl]),skolemize(B,sK1_skl(A))],[f4])).
% 0.13/0.56  fof(f17,plain,(
% 0.13/0.56    ![X0]: (less(X0,sK1_skl(X0)))),
% 0.13/0.56    inference(cnf_transformation,[status(thm)],[f16])).
% 0.13/0.56  fof(f18,plain,(
% 0.13/0.56    ~goal),
% 0.13/0.56    inference(cnf_transformation,[status(thm)],[f6])).
% 0.13/0.56  fof(f19,definition,(
% 0.13/0.56    ![X0,X1]: (sQ0_spl <=> (~p(X0)|~less(X0,X1)|~p(X1)))),
% 0.13/0.56    introduced(definition,[new_symbols(definition,[sQ0_spl])],[split_symbol_definition])).
% 0.13/0.56  fof(f20,plain,(
% 0.13/0.56    ![X0,X1]: (~p(X0)|~less(X0,X1)|~p(X1)|~sQ0_spl)),
% 0.13/0.56    inference(component_clause,[status(thm)],[f19])).
% 0.13/0.56  fof(f22,definition,(
% 0.13/0.56    sQ1_spl <=> (goal)),
% 0.13/0.56    introduced(definition,[new_symbols(definition,[sQ1_spl])],[split_symbol_definition])).
% 0.13/0.56  fof(f23,plain,(
% 0.13/0.56    goal|~sQ1_spl),
% 0.13/0.56    inference(component_clause,[status(thm)],[f22])).
% 0.13/0.56  fof(f25,plain,(
% 0.13/0.56    sQ0_spl|sQ1_spl),
% 0.13/0.56    inference(split_clause,[status(thm)],[f9,f19,f22])).
% 0.13/0.56  fof(f26,plain,(
% 0.13/0.56    ![X0,X1]: (p(X0)|~p(X1)|~less(X1,sK0_skl(X0))|~sQ0_spl)),
% 0.13/0.56    inference(resolution,[status(thm)],[f12,f20])).
% 0.13/0.56  fof(f27,plain,(
% 0.13/0.56    ![X0,X1]: (p(X0)|~less(sK0_skl(X1),sK0_skl(X0))|p(X1)|~sQ0_spl)),
% 0.13/0.56    inference(resolution,[status(thm)],[f26,f12])).
% 0.13/0.56  fof(f30,plain,(
% 0.13/0.56    ![X0,X1,X2]: (~less(sK0_skl(X0),X1)|~less(X1,sK0_skl(X2))|p(X2)|p(X0)|~sQ0_spl)),
% 0.13/0.56    inference(resolution,[status(thm)],[f15,f27])).
% 0.13/0.56  fof(f31,plain,(
% 0.13/0.56    ![X0,X1]: (~less(sK0_skl(X0),X1)|p(X1)|p(X0)|p(X1)|~sQ0_spl)),
% 0.13/0.56    inference(resolution,[status(thm)],[f30,f11])).
% 0.13/0.56  fof(f33,plain,(
% 0.13/0.56    ![X0,X1]: (~less(sK0_skl(X0),X1)|p(X1)|p(X0)|~sQ0_spl)),
% 0.13/0.56    inference(duplicate_literals_removal,[status(thm)],[f31])).
% 0.13/0.56  fof(f35,plain,(
% 0.13/0.56    ![X0]: (p(sK1_skl(sK0_skl(X0)))|p(X0)|~sQ0_spl)),
% 0.13/0.56    inference(resolution,[status(thm)],[f33,f17])).
% 0.13/0.56  fof(f41,plain,(
% 0.13/0.56    ![X0,X1]: (p(X0)|~p(X1)|~less(X1,sK1_skl(sK0_skl(X0)))|~sQ0_spl)),
% 0.13/0.56    inference(resolution,[status(thm)],[f35,f20])).
% 0.13/0.56  fof(f43,plain,(
% 0.13/0.56    ![X0,X1]: (p(X0)|~less(sK0_skl(X1),sK1_skl(sK0_skl(X0)))|p(X1)|~sQ0_spl)),
% 0.13/0.56    inference(resolution,[status(thm)],[f41,f12])).
% 0.13/0.56  fof(f56,plain,(
% 0.13/0.56    ![X0]: (p(X0)|p(X0)|~sQ0_spl)),
% 0.13/0.56    inference(resolution,[status(thm)],[f43,f17])).
% 0.13/0.56  fof(f58,plain,(
% 0.13/0.56    ![X0]: (p(X0)|~sQ0_spl)),
% 0.13/0.56    inference(duplicate_literals_removal,[status(thm)],[f56])).
% 0.13/0.56  fof(f59,plain,(
% 0.13/0.56    ![X0,X1]: (~less(X0,X1)|~p(X1)|~sQ0_spl)),
% 0.13/0.56    inference(backward_subsumption_resolution,[status(thm)],[f20,f58])).
% 0.13/0.56  fof(f60,plain,(
% 0.13/0.56    ![X0,X1]: (~less(X0,X1)|~sQ0_spl)),
% 0.13/0.56    inference(forward_subsumption_resolution,[status(thm)],[f59,f58])).
% 0.13/0.56  fof(f61,plain,(
% 0.13/0.56    $false|~sQ0_spl),
% 0.13/0.56    inference(backward_subsumption_resolution,[status(thm)],[f17,f60])).
% 0.13/0.56  fof(f62,plain,(
% 0.13/0.56    ~sQ0_spl),
% 0.13/0.56    inference(contradiction_clause,[status(thm)],[f61])).
% 0.13/0.56  fof(f63,plain,(
% 0.13/0.56    $false|~sQ1_spl),
% 0.13/0.56    inference(forward_subsumption_resolution,[status(thm)],[f23,f18])).
% 0.13/0.56  fof(f64,plain,(
% 0.13/0.56    ~sQ1_spl),
% 0.13/0.56    inference(contradiction_clause,[status(thm)],[f63])).
% 0.13/0.56  fof(f65,plain,(
% 0.13/0.56    $false),
% 0.13/0.56    inference(sat_refutation,[status(thm)],[f25,f62,f64])).
% 0.13/0.56  % SZS output end CNFRefutation for theBenchmark.p
% 0.13/0.58  % Elapsed time: 0.047549 seconds
% 0.13/0.58  % CPU time: 0.126311 seconds
% 0.13/0.58  % Total memory used: 17.008 MB
% 0.13/0.58  % Net memory used: 16.446 MB
%------------------------------------------------------------------------------