↑ 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  : SYN980+1 : TPTP v9.3.1. Released v3.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : drodi -satmode(on) -timeout(300) /export/starexec/sandbox/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 03:21:39 PM UTC 2026

% Result   : Theorem 0.20s 0.51s
% Output   : Assurance 0s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05  % Problem  : SYN980+1 : TPTP v9.3.1. Released v3.1.0.
% 0.00/0.07  % Command  : drodi -satmode(on) -timeout(300) /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.47  % Computer : n013.cluster.edu
% 0.20/0.47  % Model    : x86_64 x86_64
% 0.20/0.47  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.20/0.47  % Memory   : 8046.5625MB
% 0.20/0.47  % OS       : Linux 6.8.0-71-generic
% 0.20/0.47  % CPULimit : 300
% 0.20/0.47  % WCLimit  : 300
% 0.20/0.47  % DateTime : Mon Sep 21 11:31:36 UTC 2026
% 0.20/0.47  % CPUTime  : 
% 0.20/0.49  % Drodi V4.1.1
% 0.20/0.51  % Refutation found
% 0.20/0.51  % SZS status Theorem for theBenchmark: Theorem is valid
% 0.20/0.51  % SZS output start CNFRefutation for theBenchmark
% 0.20/0.51  fof(f1,conjecture,(
% 0.20/0.51    (! [B] :( (! [Y] :( ( r(B)=> r(Y) )=> p(f(Y),Y) ))=> (? [X,Y] :( p(X,Y)& ( q(f(B),B)=> q(X,Y) ) ) )) )),
% 0.20/0.51    file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.20/0.51  fof(f2,negated_conjecture,(
% 0.20/0.51    ~((! [B] :( (! [Y] :( ( r(B)=> r(Y) )=> p(f(Y),Y) ))=> (? [X,Y] :( p(X,Y)& ( q(f(B),B)=> q(X,Y) ) ) )) ))),
% 0.20/0.51    inference(negated_conjecture,[status(cth)],[f1])).
% 0.20/0.51  fof(f3,plain,(
% 0.20/0.51    (?[B]: ((![Y]: ((r(B)&~r(Y))|p(f(Y),Y)))&(![X,Y]: (~p(X,Y)|(q(f(B),B)&~q(X,Y))))))),
% 0.20/0.51    inference(pre_NNF_transformation,[status(thm)],[f2])).
% 0.20/0.51  fof(f4,plain,(
% 0.20/0.51    ((![Y]: ((r(sK0_skl)&~r(Y))|p(f(Y),Y)))&(![X,Y]: (~p(X,Y)|(q(f(sK0_skl),sK0_skl)&~q(X,Y)))))),
% 0.20/0.51    inference(skolemize,[status(esa),new_symbols(skolem,[sK0_skl]),skolemize(B,sK0_skl)],[f3])).
% 0.20/0.51  fof(f5,plain,(
% 0.20/0.51    ![X0]: (r(sK0_skl)|p(f(X0),X0))),
% 0.20/0.51    inference(cnf_transformation,[status(thm)],[f4])).
% 0.20/0.51  fof(f6,plain,(
% 0.20/0.51    ![X0]: (~r(X0)|p(f(X0),X0))),
% 0.20/0.51    inference(cnf_transformation,[status(thm)],[f4])).
% 0.20/0.51  fof(f7,plain,(
% 0.20/0.51    ![X0,X1]: (~p(X0,X1)|q(f(sK0_skl),sK0_skl))),
% 0.20/0.51    inference(cnf_transformation,[status(thm)],[f4])).
% 0.20/0.51  fof(f8,plain,(
% 0.20/0.51    ![X0,X1]: (~p(X0,X1)|~q(X0,X1))),
% 0.20/0.51    inference(cnf_transformation,[status(thm)],[f4])).
% 0.20/0.51  fof(f9,definition,(
% 0.20/0.51    sQ0_spl <=> (r(sK0_skl))),
% 0.20/0.51    introduced(definition,[new_symbols(definition,[sQ0_spl])],[split_symbol_definition])).
% 0.20/0.51  fof(f10,plain,(
% 0.20/0.51    r(sK0_skl)|~sQ0_spl),
% 0.20/0.51    inference(component_clause,[status(thm)],[f9])).
% 0.20/0.51  fof(f12,definition,(
% 0.20/0.51    ![X0]: (sQ1_spl <=> (p(f(X0),X0)))),
% 0.20/0.51    introduced(definition,[new_symbols(definition,[sQ1_spl])],[split_symbol_definition])).
% 0.20/0.51  fof(f13,plain,(
% 0.20/0.51    ![X0]: (p(f(X0),X0)|~sQ1_spl)),
% 0.20/0.51    inference(component_clause,[status(thm)],[f12])).
% 0.20/0.51  fof(f15,plain,(
% 0.20/0.51    sQ0_spl|sQ1_spl),
% 0.20/0.51    inference(split_clause,[status(thm)],[f5,f9,f12])).
% 0.20/0.51  fof(f16,definition,(
% 0.20/0.51    ![X0,X1]: (sQ2_spl <=> (~p(X0,X1)))),
% 0.20/0.51    introduced(definition,[new_symbols(definition,[sQ2_spl])],[split_symbol_definition])).
% 0.20/0.51  fof(f17,plain,(
% 0.20/0.51    ![X0,X1]: (~p(X0,X1)|~sQ2_spl)),
% 0.20/0.51    inference(component_clause,[status(thm)],[f16])).
% 0.20/0.51  fof(f19,definition,(
% 0.20/0.51    sQ3_spl <=> (q(f(sK0_skl),sK0_skl))),
% 0.20/0.51    introduced(definition,[new_symbols(definition,[sQ3_spl])],[split_symbol_definition])).
% 0.20/0.51  fof(f20,plain,(
% 0.20/0.51    q(f(sK0_skl),sK0_skl)|~sQ3_spl),
% 0.20/0.51    inference(component_clause,[status(thm)],[f19])).
% 0.20/0.51  fof(f22,plain,(
% 0.20/0.51    sQ2_spl|sQ3_spl),
% 0.20/0.51    inference(split_clause,[status(thm)],[f7,f16,f19])).
% 0.20/0.51  fof(f23,plain,(
% 0.20/0.51    $false|~sQ2_spl|~sQ0_spl),
% 0.20/0.51    inference(backward_subsumption_resolution,[status(thm)],[f10,f24])).
% 0.20/0.51  fof(f24,plain,(
% 0.20/0.51    ![X0]: (~r(X0)|~sQ2_spl)),
% 0.20/0.51    inference(forward_subsumption_resolution,[status(thm)],[f6,f17])).
% 0.20/0.51  fof(f25,plain,(
% 0.20/0.51    ~sQ2_spl|~sQ0_spl),
% 0.20/0.51    inference(contradiction_clause,[status(thm)],[f23])).
% 0.20/0.51  fof(f26,plain,(
% 0.20/0.51    ~p(f(sK0_skl),sK0_skl)|~sQ3_spl),
% 0.20/0.51    inference(resolution,[status(thm)],[f8,f20])).
% 0.20/0.51  fof(f27,plain,(
% 0.20/0.51    $false|~sQ1_spl|~sQ3_spl),
% 0.20/0.51    inference(forward_subsumption_resolution,[status(thm)],[f26,f13])).
% 0.20/0.51  fof(f28,plain,(
% 0.20/0.51    ~sQ1_spl|~sQ3_spl),
% 0.20/0.51    inference(contradiction_clause,[status(thm)],[f27])).
% 0.20/0.51  fof(f29,plain,(
% 0.20/0.51    p(f(sK0_skl),sK0_skl)|~sQ0_spl),
% 0.20/0.51    inference(resolution,[status(thm)],[f6,f10])).
% 0.20/0.51  fof(f30,plain,(
% 0.20/0.51    $false|~sQ3_spl|~sQ0_spl),
% 0.20/0.51    inference(forward_subsumption_resolution,[status(thm)],[f29,f26])).
% 0.20/0.51  fof(f31,plain,(
% 0.20/0.51    ~sQ3_spl|~sQ0_spl),
% 0.20/0.51    inference(contradiction_clause,[status(thm)],[f30])).
% 0.20/0.51  fof(f32,plain,(
% 0.20/0.51    $false|~sQ2_spl|~sQ1_spl),
% 0.20/0.51    inference(forward_subsumption_resolution,[status(thm)],[f13,f17])).
% 0.20/0.51  fof(f33,plain,(
% 0.20/0.51    ~sQ2_spl|~sQ1_spl),
% 0.20/0.51    inference(contradiction_clause,[status(thm)],[f32])).
% 0.20/0.51  fof(f34,plain,(
% 0.20/0.51    $false),
% 0.20/0.51    inference(sat_refutation,[status(thm)],[f15,f22,f25,f28,f31,f33])).
% 0.20/0.51  % SZS output end CNFRefutation for theBenchmark.p
% 0.20/0.54  % Elapsed time: 0.055277 seconds
% 0.20/0.54  % CPU time: 0.108383 seconds
% 0.20/0.54  % Total memory used: 9.250 MB
% 0.20/0.54  % Net memory used: 8.934 MB
%------------------------------------------------------------------------------