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

% Computer : n017.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:19:25 PM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SYN343+1 : TPTP v9.3.1. Released v2.0.0.
% 0.00/0.04  % Command  : drodi -satmode(on) -timeout(300) /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.10/0.36  % Computer : n017.cluster.edu
% 0.10/0.36  % Model    : x86_64 x86_64
% 0.10/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36  % Memory   : 8046.5625MB
% 0.10/0.36  % OS       : Linux 6.8.0-71-generic
% 0.10/0.36  % CPULimit : 300
% 0.10/0.36  % WCLimit  : 300
% 0.10/0.36  % DateTime : Mon Sep 21 10:45:42 UTC 2026
% 0.10/0.36  % CPUTime  : 
% 0.10/0.37  % Drodi V4.1.1
% 0.10/0.40  % Refutation found
% 0.10/0.40  % SZS status Theorem for theBenchmark: Theorem is valid
% 0.10/0.40  % SZS output start CNFRefutation for theBenchmark
% 0.10/0.40  fof(f1,conjecture,(
% 0.10/0.40    (? [X,Y1,Y2] :(! [Z] :( ( ( big_f(X,Y1)=> big_f(Z,X) )=> big_f(X,X) )=> ( big_f(X,X)& big_f(Y1,Y2) ) ) ))),
% 0.10/0.40    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.10/0.40  fof(f2,negated_conjecture,(
% 0.10/0.40    ~((? [X,Y1,Y2] :(! [Z] :( ( ( big_f(X,Y1)=> big_f(Z,X) )=> big_f(X,X) )=> ( big_f(X,X)& big_f(Y1,Y2) ) ) )))),
% 0.10/0.40    inference(negated_conjecture,[status(cth)],[f1])).
% 0.10/0.40  fof(f3,plain,(
% 0.10/0.40    (![X,Y1,Y2]: ?[Z]: (((big_f(X,Y1)&~big_f(Z,X))|big_f(X,X))&(~big_f(X,X)|~big_f(Y1,Y2))))),
% 0.10/0.40    inference(pre_NNF_transformation,[status(thm)],[f2])).
% 0.10/0.40  fof(f4,plain,(
% 0.10/0.40    (![X]: (((![Y1]: big_f(X,Y1))&(?[Z]: ~big_f(Z,X)))|big_f(X,X)))&((![X]: ~big_f(X,X))|(![Y1,Y2]: ~big_f(Y1,Y2)))),
% 0.10/0.40    inference(miniscoping,[status(thm)],[f3])).
% 0.10/0.40  fof(f5,plain,(
% 0.10/0.40    (![X]: (((![Y1]: big_f(X,Y1))&~big_f(sK0_skl(X),X))|big_f(X,X)))&((![X]: ~big_f(X,X))|(![Y1,Y2]: ~big_f(Y1,Y2)))),
% 0.10/0.40    inference(skolemize,[status(esa),new_symbols(skolem,[sK0_skl]),skolemize(Z,sK0_skl(X))],[f4])).
% 0.10/0.40  fof(f6,plain,(
% 0.10/0.40    ![X0,X1]: (big_f(X0,X1)|big_f(X0,X0))),
% 0.10/0.40    inference(cnf_transformation,[status(thm)],[f5])).
% 0.10/0.40  fof(f8,plain,(
% 0.10/0.40    ![X0,X1,X2]: (~big_f(X0,X0)|~big_f(X1,X2))),
% 0.10/0.40    inference(cnf_transformation,[status(thm)],[f5])).
% 0.10/0.40  fof(f9,definition,(
% 0.10/0.40    ![X0]: (sQ0_spl <=> (~big_f(X0,X0)))),
% 0.10/0.40    introduced(definition,[new_symbols(definition,[sQ0_spl])],[split_symbol_definition])).
% 0.10/0.40  fof(f10,plain,(
% 0.10/0.40    ![X0]: (~big_f(X0,X0)|~sQ0_spl)),
% 0.10/0.40    inference(component_clause,[status(thm)],[f9])).
% 0.10/0.40  fof(f12,definition,(
% 0.10/0.40    ![X1,X2]: (sQ1_spl <=> (~big_f(X1,X2)))),
% 0.10/0.40    introduced(definition,[new_symbols(definition,[sQ1_spl])],[split_symbol_definition])).
% 0.10/0.40  fof(f13,plain,(
% 0.10/0.40    ![X0,X1]: (~big_f(X0,X1)|~sQ1_spl)),
% 0.10/0.40    inference(component_clause,[status(thm)],[f12])).
% 0.10/0.40  fof(f15,plain,(
% 0.10/0.40    sQ0_spl|sQ1_spl),
% 0.10/0.40    inference(split_clause,[status(thm)],[f8,f9,f12])).
% 0.10/0.40  fof(f16,plain,(
% 0.10/0.40    $false|~sQ0_spl),
% 0.10/0.40    inference(backward_subsumption_resolution,[status(thm)],[f10,f17])).
% 0.10/0.40  fof(f17,plain,(
% 0.10/0.40    ![X0,X1]: (big_f(X0,X1)|~sQ0_spl)),
% 0.10/0.40    inference(forward_subsumption_resolution,[status(thm)],[f6,f10])).
% 0.10/0.40  fof(f18,plain,(
% 0.10/0.40    ~sQ0_spl),
% 0.10/0.40    inference(contradiction_clause,[status(thm)],[f16])).
% 0.10/0.40  fof(f19,plain,(
% 0.10/0.40    ![X0]: (big_f(X0,X0)|~sQ1_spl)),
% 0.10/0.40    inference(forward_subsumption_resolution,[status(thm)],[f6,f13])).
% 0.10/0.40  fof(f20,plain,(
% 0.10/0.40    $false|~sQ1_spl),
% 0.10/0.40    inference(resolution,[status(thm)],[f19,f13])).
% 0.10/0.40  fof(f21,plain,(
% 0.10/0.40    ~sQ1_spl),
% 0.10/0.40    inference(contradiction_clause,[status(thm)],[f20])).
% 0.10/0.40  fof(f22,plain,(
% 0.10/0.40    $false),
% 0.10/0.40    inference(sat_refutation,[status(thm)],[f15,f18,f21])).
% 0.10/0.40  % SZS output end CNFRefutation for theBenchmark.p
% 0.10/0.42  % Elapsed time: 0.046368 seconds
% 0.10/0.42  % CPU time: 0.112599 seconds
% 0.10/0.42  % Total memory used: 16.426 MB
% 0.10/0.42  % Net memory used: 15.834 MB
%------------------------------------------------------------------------------