TSTP Solution File: SYN409+1 by Drodi---3.6.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Drodi---3.6.0
% Problem  : SYN409+1 : TPTP v8.1.2. Released v2.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : drodi -learnfrom(drodi.lrn) -timeout(%d) %s

% Computer : n016.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Tue Apr 30 20:52:09 EDT 2024

% Result   : Theorem 0.10s 0.36s
% Output   : CNFRefutation 0.10s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13  % Problem  : SYN409+1 : TPTP v8.1.2. Released v2.0.0.
% 0.03/0.14  % Command  : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.10/0.35  % Computer : n016.cluster.edu
% 0.10/0.35  % Model    : x86_64 x86_64
% 0.10/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.35  % Memory   : 8042.1875MB
% 0.10/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.10/0.35  % CPULimit : 300
% 0.10/0.35  % WCLimit  : 300
% 0.10/0.35  % DateTime : Mon Apr 29 22:41:55 EDT 2024
% 0.10/0.35  % CPUTime  : 
% 0.10/0.35  % Drodi V3.6.0
% 0.10/0.36  % Refutation found
% 0.10/0.36  % SZS status Theorem for theBenchmark: Theorem is valid
% 0.10/0.36  % SZS output start CNFRefutation for theBenchmark
% 0.10/0.36  fof(f1,conjecture,(
% 0.10/0.36    ( (! [X] : f(X))<=> (! [Y,Z] :( f(Y)& f(Z) ) )) ),
% 0.10/0.36    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.10/0.36  fof(f2,negated_conjecture,(
% 0.10/0.36    ~(( (! [X] : f(X))<=> (! [Y,Z] :( f(Y)& f(Z) ) )) )),
% 0.10/0.36    inference(negated_conjecture,[status(cth)],[f1])).
% 0.10/0.36  fof(f3,plain,(
% 0.10/0.36    ((![X]: f(X))<~>(![Y,Z]: (f(Y)&f(Z))))),
% 0.10/0.36    inference(pre_NNF_transformation,[status(esa)],[f2])).
% 0.10/0.36  fof(f4,plain,(
% 0.10/0.36    ((![X]: f(X))|(![Y,Z]: (f(Y)&f(Z))))&((?[X]: ~f(X))|(?[Y,Z]: (~f(Y)|~f(Z))))),
% 0.10/0.36    inference(NNF_transformation,[status(esa)],[f3])).
% 0.10/0.36  fof(f5,plain,(
% 0.10/0.36    ((![X]: f(X))|((![Y]: f(Y))&(![Z]: f(Z))))&((?[X]: ~f(X))|((?[Y]: ~f(Y))|(?[Z]: ~f(Z))))),
% 0.10/0.36    inference(miniscoping,[status(esa)],[f4])).
% 0.10/0.36  fof(f6,plain,(
% 0.10/0.36    ((![X]: f(X))|((![Y]: f(Y))&(![Z]: f(Z))))&(~f(sk0_0)|(~f(sk0_1)|~f(sk0_2)))),
% 0.10/0.36    inference(skolemization,[status(esa)],[f5])).
% 0.10/0.36  fof(f7,plain,(
% 0.10/0.36    ![X0,X1]: (f(X0)|f(X1))),
% 0.10/0.36    inference(cnf_transformation,[status(esa)],[f6])).
% 0.10/0.36  fof(f9,plain,(
% 0.10/0.36    ~f(sk0_0)|~f(sk0_1)|~f(sk0_2)),
% 0.10/0.36    inference(cnf_transformation,[status(esa)],[f6])).
% 0.10/0.36  fof(f10,plain,(
% 0.10/0.36    spl0_0 <=> f(X0)),
% 0.10/0.36    introduced(split_symbol_definition)).
% 0.10/0.36  fof(f11,plain,(
% 0.10/0.36    ![X0]: (f(X0)|~spl0_0)),
% 0.10/0.36    inference(component_clause,[status(thm)],[f10])).
% 0.10/0.36  fof(f13,plain,(
% 0.10/0.36    spl0_0),
% 0.10/0.36    inference(split_clause,[status(thm)],[f7,f10])).
% 0.10/0.36  fof(f15,plain,(
% 0.10/0.36    spl0_1 <=> f(sk0_0)),
% 0.10/0.36    introduced(split_symbol_definition)).
% 0.10/0.36  fof(f17,plain,(
% 0.10/0.36    ~f(sk0_0)|spl0_1),
% 0.10/0.36    inference(component_clause,[status(thm)],[f15])).
% 0.10/0.36  fof(f18,plain,(
% 0.10/0.36    spl0_2 <=> f(sk0_1)),
% 0.10/0.36    introduced(split_symbol_definition)).
% 0.10/0.36  fof(f20,plain,(
% 0.10/0.36    ~f(sk0_1)|spl0_2),
% 0.10/0.36    inference(component_clause,[status(thm)],[f18])).
% 0.10/0.36  fof(f21,plain,(
% 0.10/0.36    spl0_3 <=> f(sk0_2)),
% 0.10/0.36    introduced(split_symbol_definition)).
% 0.10/0.36  fof(f23,plain,(
% 0.10/0.36    ~f(sk0_2)|spl0_3),
% 0.10/0.36    inference(component_clause,[status(thm)],[f21])).
% 0.10/0.36  fof(f24,plain,(
% 0.10/0.36    ~spl0_1|~spl0_2|~spl0_3),
% 0.10/0.36    inference(split_clause,[status(thm)],[f9,f15,f18,f21])).
% 0.10/0.36  fof(f25,plain,(
% 0.10/0.36    $false|~spl0_0|spl0_3),
% 0.10/0.36    inference(forward_subsumption_resolution,[status(thm)],[f23,f11])).
% 0.10/0.36  fof(f26,plain,(
% 0.10/0.36    ~spl0_0|spl0_3),
% 0.10/0.36    inference(contradiction_clause,[status(thm)],[f25])).
% 0.10/0.36  fof(f27,plain,(
% 0.10/0.36    $false|~spl0_0|spl0_1),
% 0.10/0.36    inference(forward_subsumption_resolution,[status(thm)],[f17,f11])).
% 0.10/0.36  fof(f28,plain,(
% 0.10/0.36    ~spl0_0|spl0_1),
% 0.10/0.36    inference(contradiction_clause,[status(thm)],[f27])).
% 0.10/0.36  fof(f29,plain,(
% 0.10/0.36    $false|~spl0_0|spl0_2),
% 0.10/0.36    inference(forward_subsumption_resolution,[status(thm)],[f20,f11])).
% 0.10/0.36  fof(f30,plain,(
% 0.10/0.36    ~spl0_0|spl0_2),
% 0.10/0.36    inference(contradiction_clause,[status(thm)],[f29])).
% 0.10/0.36  fof(f31,plain,(
% 0.10/0.36    $false),
% 0.10/0.36    inference(sat_refutation,[status(thm)],[f13,f24,f26,f28,f30])).
% 0.10/0.36  % SZS output end CNFRefutation for theBenchmark.p
% 0.10/0.38  % Elapsed time: 0.015206 seconds
% 0.10/0.38  % CPU time: 0.011903 seconds
% 0.10/0.38  % Total memory used: 813.024 KB
% 0.10/0.38  % Net memory used: 740.560 KB
%------------------------------------------------------------------------------