TSTP Solution File: SYN931+1 by Drodi---3.5.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Drodi---3.5.1
% Problem  : SYN931+1 : TPTP v8.1.2. Released v3.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : drodi -learnfrom(drodi.lrn) -timeout(%d) %s

% Computer : n022.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 : Wed May 31 12:48:26 EDT 2023

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

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11  % Problem  : SYN931+1 : TPTP v8.1.2. Released v3.1.0.
% 0.06/0.11  % Command  : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.07/0.31  % Computer : n022.cluster.edu
% 0.07/0.31  % Model    : x86_64 x86_64
% 0.07/0.31  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.31  % Memory   : 8042.1875MB
% 0.07/0.31  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.10/0.31  % CPULimit : 300
% 0.10/0.31  % WCLimit  : 300
% 0.10/0.31  % DateTime : Tue May 30 10:22:42 EDT 2023
% 0.10/0.31  % CPUTime  : 
% 0.10/0.31  % Drodi V3.5.1
% 0.10/0.32  % Refutation found
% 0.10/0.32  % SZS status Theorem for theBenchmark: Theorem is valid
% 0.10/0.32  % SZS output start CNFRefutation for theBenchmark
% 0.10/0.32  fof(f1,conjecture,(
% 0.10/0.32    ( (? [X] :( p(X)& c ))<=> ( (? [X] : p(X))& c ) ) ),
% 0.10/0.32    file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.10/0.32  fof(f2,negated_conjecture,(
% 0.10/0.32    ~(( (? [X] :( p(X)& c ))<=> ( (? [X] : p(X))& c ) ) )),
% 0.10/0.32    inference(negated_conjecture,[status(cth)],[f1])).
% 0.10/0.32  fof(f3,plain,(
% 0.10/0.32    ((?[X]: (p(X)&c))<~>((?[X]: p(X))&c))),
% 0.10/0.32    inference(pre_NNF_transformation,[status(esa)],[f2])).
% 0.10/0.32  fof(f4,plain,(
% 0.10/0.32    pd0_0<=>((?[X]: p(X))&c)),
% 0.10/0.32    introduced(predicate_definition,[f3])).
% 0.10/0.32  fof(f5,plain,(
% 0.10/0.32    (?[X]: (p(X)&c))<~>pd0_0),
% 0.10/0.32    inference(formula_renaming,[status(thm)],[f3,f4])).
% 0.10/0.32  fof(f6,plain,(
% 0.10/0.32    ((?[X]: (p(X)&c))|pd0_0)&((![X]: (~p(X)|~c))|~pd0_0)),
% 0.10/0.32    inference(NNF_transformation,[status(esa)],[f5])).
% 0.10/0.32  fof(f7,plain,(
% 0.10/0.32    (((?[X]: p(X))&c)|pd0_0)&(((![X]: ~p(X))|~c)|~pd0_0)),
% 0.10/0.32    inference(miniscoping,[status(esa)],[f6])).
% 0.10/0.32  fof(f8,plain,(
% 0.10/0.32    ((p(sk0_0)&c)|pd0_0)&(((![X]: ~p(X))|~c)|~pd0_0)),
% 0.10/0.32    inference(skolemization,[status(esa)],[f7])).
% 0.10/0.32  fof(f9,plain,(
% 0.10/0.32    p(sk0_0)|pd0_0),
% 0.10/0.32    inference(cnf_transformation,[status(esa)],[f8])).
% 0.10/0.32  fof(f10,plain,(
% 0.10/0.32    c|pd0_0),
% 0.10/0.32    inference(cnf_transformation,[status(esa)],[f8])).
% 0.10/0.32  fof(f11,plain,(
% 0.10/0.32    ![X0]: (~p(X0)|~c|~pd0_0)),
% 0.10/0.32    inference(cnf_transformation,[status(esa)],[f8])).
% 0.10/0.32  fof(f12,plain,(
% 0.10/0.32    (~pd0_0|((?[X]: p(X))&c))&(pd0_0|((![X]: ~p(X))|~c))),
% 0.10/0.32    inference(NNF_transformation,[status(esa)],[f4])).
% 0.10/0.32  fof(f13,plain,(
% 0.10/0.32    (~pd0_0|(p(sk0_1)&c))&(pd0_0|((![X]: ~p(X))|~c))),
% 0.10/0.32    inference(skolemization,[status(esa)],[f12])).
% 0.10/0.32  fof(f14,plain,(
% 0.10/0.32    ~pd0_0|p(sk0_1)),
% 0.10/0.32    inference(cnf_transformation,[status(esa)],[f13])).
% 0.10/0.32  fof(f15,plain,(
% 0.10/0.32    ~pd0_0|c),
% 0.10/0.32    inference(cnf_transformation,[status(esa)],[f13])).
% 0.10/0.32  fof(f16,plain,(
% 0.10/0.32    ![X0]: (pd0_0|~p(X0)|~c)),
% 0.10/0.32    inference(cnf_transformation,[status(esa)],[f13])).
% 0.10/0.32  fof(f17,plain,(
% 0.10/0.32    spl0_0 <=> p(sk0_0)),
% 0.10/0.32    introduced(split_symbol_definition)).
% 0.10/0.32  fof(f18,plain,(
% 0.10/0.32    p(sk0_0)|~spl0_0),
% 0.10/0.32    inference(component_clause,[status(thm)],[f17])).
% 0.10/0.32  fof(f20,plain,(
% 0.10/0.32    spl0_1 <=> pd0_0),
% 0.10/0.32    introduced(split_symbol_definition)).
% 0.10/0.32  fof(f23,plain,(
% 0.10/0.32    spl0_0|spl0_1),
% 0.10/0.32    inference(split_clause,[status(thm)],[f9,f17,f20])).
% 0.10/0.32  fof(f24,plain,(
% 0.10/0.32    spl0_2 <=> c),
% 0.10/0.32    introduced(split_symbol_definition)).
% 0.10/0.32  fof(f27,plain,(
% 0.10/0.32    spl0_2|spl0_1),
% 0.10/0.32    inference(split_clause,[status(thm)],[f10,f24,f20])).
% 0.10/0.32  fof(f28,plain,(
% 0.10/0.32    spl0_3 <=> ~p(X0)),
% 0.10/0.32    introduced(split_symbol_definition)).
% 0.10/0.32  fof(f29,plain,(
% 0.10/0.32    ![X0]: (~p(X0)|~spl0_3)),
% 0.10/0.32    inference(component_clause,[status(thm)],[f28])).
% 0.10/0.32  fof(f31,plain,(
% 0.10/0.32    spl0_3|~spl0_2|~spl0_1),
% 0.10/0.32    inference(split_clause,[status(thm)],[f11,f28,f24,f20])).
% 0.10/0.32  fof(f32,plain,(
% 0.10/0.32    spl0_4 <=> p(sk0_1)),
% 0.10/0.32    introduced(split_symbol_definition)).
% 0.10/0.32  fof(f33,plain,(
% 0.10/0.32    p(sk0_1)|~spl0_4),
% 0.10/0.32    inference(component_clause,[status(thm)],[f32])).
% 0.10/0.32  fof(f35,plain,(
% 0.10/0.32    ~spl0_1|spl0_4),
% 0.10/0.32    inference(split_clause,[status(thm)],[f14,f20,f32])).
% 0.10/0.32  fof(f36,plain,(
% 0.10/0.32    ~spl0_1|spl0_2),
% 0.10/0.32    inference(split_clause,[status(thm)],[f15,f20,f24])).
% 0.10/0.32  fof(f37,plain,(
% 0.10/0.32    spl0_1|spl0_3|~spl0_2),
% 0.10/0.32    inference(split_clause,[status(thm)],[f16,f20,f28,f24])).
% 0.10/0.32  fof(f38,plain,(
% 0.10/0.32    $false|~spl0_3|~spl0_0),
% 0.10/0.32    inference(forward_subsumption_resolution,[status(thm)],[f18,f29])).
% 0.10/0.32  fof(f39,plain,(
% 0.10/0.32    ~spl0_3|~spl0_0),
% 0.10/0.32    inference(contradiction_clause,[status(thm)],[f38])).
% 0.10/0.32  fof(f40,plain,(
% 0.10/0.32    $false|~spl0_3|~spl0_4),
% 0.10/0.32    inference(forward_subsumption_resolution,[status(thm)],[f33,f29])).
% 0.10/0.32  fof(f41,plain,(
% 0.10/0.32    ~spl0_3|~spl0_4),
% 0.10/0.32    inference(contradiction_clause,[status(thm)],[f40])).
% 0.10/0.32  fof(f42,plain,(
% 0.10/0.32    $false),
% 0.10/0.32    inference(sat_refutation,[status(thm)],[f23,f27,f31,f35,f36,f37,f39,f41])).
% 0.10/0.32  % SZS output end CNFRefutation for theBenchmark.p
% 0.10/0.32  % Elapsed time: 0.012545 seconds
% 0.10/0.32  % CPU time: 0.018384 seconds
% 0.10/0.32  % Memory used: 1.820 MB
%------------------------------------------------------------------------------