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

View Problem - Process Solution

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

% Computer : n028.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:54 EDT 2024

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

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.10  % Problem  : SYN722+1 : TPTP v8.1.2. Released v2.5.0.
% 0.02/0.10  % Command  : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.10/0.30  % Computer : n028.cluster.edu
% 0.10/0.30  % Model    : x86_64 x86_64
% 0.10/0.30  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.30  % Memory   : 8042.1875MB
% 0.10/0.30  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.10/0.30  % CPULimit : 300
% 0.10/0.30  % WCLimit  : 300
% 0.10/0.30  % DateTime : Mon Apr 29 22:14:14 EDT 2024
% 0.10/0.30  % CPUTime  : 
% 0.10/0.31  % Drodi V3.6.0
% 0.10/0.31  % Refutation found
% 0.10/0.31  % SZS status Theorem for theBenchmark: Theorem is valid
% 0.10/0.31  % SZS output start CNFRefutation for theBenchmark
% 0.10/0.31  fof(f1,conjecture,(
% 0.10/0.31    ~ ( (! [Z] :( ( p(Z)| r(Z) )& q(Z) ))& (! [X] :(? [Y] :( p(X)| ~ q(X)| ~ q(Y)| ~ q(c)| ~ q(d) )))& ( ~ p(a)| ~ p(b) ) ) ),
% 0.10/0.31    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.10/0.31  fof(f2,negated_conjecture,(
% 0.10/0.31    ~(~ ( (! [Z] :( ( p(Z)| r(Z) )& q(Z) ))& (! [X] :(? [Y] :( p(X)| ~ q(X)| ~ q(Y)| ~ q(c)| ~ q(d) )))& ( ~ p(a)| ~ p(b) ) ) )),
% 0.10/0.31    inference(negated_conjecture,[status(cth)],[f1])).
% 0.10/0.31  fof(f3,plain,(
% 0.10/0.31    (((![Z]: (p(Z)|r(Z)))&(![Z]: q(Z)))&((((![X]: (p(X)|~q(X)))|(?[Y]: ~q(Y)))|~q(c))|~q(d)))&(~p(a)|~p(b))),
% 0.10/0.31    inference(miniscoping,[status(esa)],[f2])).
% 0.10/0.31  fof(f4,plain,(
% 0.10/0.31    (((![Z]: (p(Z)|r(Z)))&(![Z]: q(Z)))&((((![X]: (p(X)|~q(X)))|~q(sk0_0))|~q(c))|~q(d)))&(~p(a)|~p(b))),
% 0.10/0.31    inference(skolemization,[status(esa)],[f3])).
% 0.10/0.31  fof(f6,plain,(
% 0.10/0.31    ![X0]: (q(X0))),
% 0.10/0.31    inference(cnf_transformation,[status(esa)],[f4])).
% 0.10/0.31  fof(f7,plain,(
% 0.10/0.31    ![X0]: (p(X0)|~q(X0)|~q(sk0_0)|~q(c)|~q(d))),
% 0.10/0.31    inference(cnf_transformation,[status(esa)],[f4])).
% 0.10/0.31  fof(f8,plain,(
% 0.10/0.31    ~p(a)|~p(b)),
% 0.10/0.31    inference(cnf_transformation,[status(esa)],[f4])).
% 0.10/0.31  fof(f9,plain,(
% 0.10/0.31    spl0_0 <=> p(X0)|~q(X0)),
% 0.10/0.31    introduced(split_symbol_definition)).
% 0.10/0.31  fof(f10,plain,(
% 0.10/0.31    ![X0]: (p(X0)|~q(X0)|~spl0_0)),
% 0.10/0.31    inference(component_clause,[status(thm)],[f9])).
% 0.10/0.31  fof(f12,plain,(
% 0.10/0.31    spl0_1 <=> q(sk0_0)),
% 0.10/0.31    introduced(split_symbol_definition)).
% 0.10/0.31  fof(f14,plain,(
% 0.10/0.31    ~q(sk0_0)|spl0_1),
% 0.10/0.31    inference(component_clause,[status(thm)],[f12])).
% 0.10/0.31  fof(f15,plain,(
% 0.10/0.31    spl0_2 <=> q(c)),
% 0.10/0.31    introduced(split_symbol_definition)).
% 0.10/0.31  fof(f17,plain,(
% 0.10/0.31    ~q(c)|spl0_2),
% 0.10/0.31    inference(component_clause,[status(thm)],[f15])).
% 0.10/0.31  fof(f18,plain,(
% 0.10/0.31    spl0_3 <=> q(d)),
% 0.10/0.31    introduced(split_symbol_definition)).
% 0.10/0.31  fof(f20,plain,(
% 0.10/0.31    ~q(d)|spl0_3),
% 0.10/0.31    inference(component_clause,[status(thm)],[f18])).
% 0.10/0.31  fof(f21,plain,(
% 0.10/0.31    spl0_0|~spl0_1|~spl0_2|~spl0_3),
% 0.10/0.31    inference(split_clause,[status(thm)],[f7,f9,f12,f15,f18])).
% 0.10/0.31  fof(f22,plain,(
% 0.10/0.31    spl0_4 <=> p(a)),
% 0.10/0.31    introduced(split_symbol_definition)).
% 0.10/0.31  fof(f24,plain,(
% 0.10/0.31    ~p(a)|spl0_4),
% 0.10/0.31    inference(component_clause,[status(thm)],[f22])).
% 0.10/0.31  fof(f25,plain,(
% 0.10/0.31    spl0_5 <=> p(b)),
% 0.10/0.31    introduced(split_symbol_definition)).
% 0.10/0.31  fof(f27,plain,(
% 0.10/0.31    ~p(b)|spl0_5),
% 0.10/0.31    inference(component_clause,[status(thm)],[f25])).
% 0.10/0.31  fof(f28,plain,(
% 0.10/0.31    ~spl0_4|~spl0_5),
% 0.10/0.31    inference(split_clause,[status(thm)],[f8,f22,f25])).
% 0.10/0.31  fof(f29,plain,(
% 0.10/0.31    $false|spl0_3),
% 0.10/0.31    inference(forward_subsumption_resolution,[status(thm)],[f20,f6])).
% 0.10/0.31  fof(f30,plain,(
% 0.10/0.31    spl0_3),
% 0.10/0.31    inference(contradiction_clause,[status(thm)],[f29])).
% 0.10/0.31  fof(f31,plain,(
% 0.10/0.31    $false|spl0_2),
% 0.10/0.31    inference(forward_subsumption_resolution,[status(thm)],[f17,f6])).
% 0.10/0.31  fof(f32,plain,(
% 0.10/0.31    spl0_2),
% 0.10/0.31    inference(contradiction_clause,[status(thm)],[f31])).
% 0.10/0.31  fof(f33,plain,(
% 0.10/0.31    $false|spl0_1),
% 0.10/0.31    inference(forward_subsumption_resolution,[status(thm)],[f14,f6])).
% 0.10/0.31  fof(f34,plain,(
% 0.10/0.31    spl0_1),
% 0.10/0.31    inference(contradiction_clause,[status(thm)],[f33])).
% 0.10/0.31  fof(f35,plain,(
% 0.10/0.31    ![X0]: (p(X0)|~spl0_0)),
% 0.10/0.31    inference(forward_subsumption_resolution,[status(thm)],[f10,f6])).
% 0.10/0.31  fof(f36,plain,(
% 0.10/0.31    $false|~spl0_0|spl0_4),
% 0.10/0.31    inference(backward_subsumption_resolution,[status(thm)],[f24,f35])).
% 0.10/0.31  fof(f37,plain,(
% 0.10/0.31    ~spl0_0|spl0_4),
% 0.10/0.31    inference(contradiction_clause,[status(thm)],[f36])).
% 0.10/0.31  fof(f38,plain,(
% 0.10/0.31    $false|~spl0_0|spl0_5),
% 0.10/0.31    inference(forward_subsumption_resolution,[status(thm)],[f27,f35])).
% 0.10/0.31  fof(f39,plain,(
% 0.10/0.31    ~spl0_0|spl0_5),
% 0.10/0.31    inference(contradiction_clause,[status(thm)],[f38])).
% 0.10/0.31  fof(f40,plain,(
% 0.10/0.31    $false),
% 0.10/0.31    inference(sat_refutation,[status(thm)],[f21,f28,f30,f32,f34,f37,f39])).
% 0.10/0.31  % SZS output end CNFRefutation for theBenchmark.p
% 0.15/0.33  % Elapsed time: 0.011496 seconds
% 0.15/0.33  % CPU time: 0.019344 seconds
% 0.15/0.33  % Total memory used: 1.889 MB
% 0.15/0.33  % Net memory used: 1.733 MB
%------------------------------------------------------------------------------