↑ 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  : SYN373+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 : n004.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:30 PM UTC 2026

% Result   : Theorem 0.08s 5.39s
% Output   : Assurance 0s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SYN373+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.08/5.37  % Computer : n004.cluster.edu
% 0.08/5.37  % Model    : x86_64 x86_64
% 0.08/5.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/5.37  % Memory   : 8046.5625MB
% 0.08/5.37  % OS       : Linux 6.8.0-71-generic
% 0.08/5.37  % CPULimit : 300
% 0.08/5.37  % WCLimit  : 300
% 0.08/5.37  % DateTime : Mon Sep 21 10:52:12 UTC 2026
% 0.08/5.37  % CPUTime  : 
% 0.08/5.38  % Drodi V4.1.1
% 0.08/5.39  % Refutation found
% 0.08/5.39  % SZS status Theorem for theBenchmark: Theorem is valid
% 0.08/5.39  % SZS output start CNFRefutation for theBenchmark
% 0.08/5.39  fof(f1,conjecture,(
% 0.08/5.39    ( (? [X] :( big_p(X)=> big_q(X) ))<=> ( (! [X] : big_p(X))=> (? [X] : big_q(X) )) ) ),
% 0.08/5.39    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.08/5.39  fof(f2,negated_conjecture,(
% 0.08/5.39    ~(( (? [X] :( big_p(X)=> big_q(X) ))<=> ( (! [X] : big_p(X))=> (? [X] : big_q(X) )) ) )),
% 0.08/5.39    inference(negated_conjecture,[status(cth)],[f1])).
% 0.08/5.39  fof(f3,plain,(
% 0.08/5.39    ((?[X]: (~big_p(X)|big_q(X)))<~>((?[X]: ~big_p(X))|(?[X]: big_q(X))))),
% 0.08/5.39    inference(pre_NNF_transformation,[status(thm)],[f2])).
% 0.08/5.39  fof(f4,plain,(
% 0.08/5.39    ((?[X]: (~big_p(X)|big_q(X)))|((?[X]: ~big_p(X))|(?[X]: big_q(X))))&((![X]: (big_p(X)&~big_q(X)))|((![X]: big_p(X))&(![X]: ~big_q(X))))),
% 0.08/5.39    inference(NNF_transformation,[status(thm)],[f3])).
% 0.08/5.39  fof(f5,plain,(
% 0.08/5.39    (((?[X]: ~big_p(X))|(?[X]: big_q(X)))|((?[X]: ~big_p(X))|(?[X]: big_q(X))))&(((![X]: big_p(X))&(![X]: ~big_q(X)))|((![X]: big_p(X))&(![X]: ~big_q(X))))),
% 0.08/5.39    inference(miniscoping,[status(thm)],[f4])).
% 0.08/5.39  fof(f6,plain,(
% 0.08/5.39    ((~big_p(sK0_skl)|big_q(sK1_skl))|(~big_p(sK2_skl)|big_q(sK3_skl)))&(((![X]: big_p(X))&(![X]: ~big_q(X)))|((![X]: big_p(X))&(![X]: ~big_q(X))))),
% 0.08/5.39    inference(skolemize,[status(esa),new_symbols(skolem,[sK0_skl,sK1_skl,sK2_skl,sK3_skl]),skolemize(X,sK0_skl),skolemize(X,sK1_skl),skolemize(X,sK2_skl),skolemize(X,sK3_skl)],[f5])).
% 0.08/5.39  fof(f7,plain,(
% 0.08/5.39    ~big_p(sK0_skl)|big_q(sK1_skl)|~big_p(sK2_skl)|big_q(sK3_skl)),
% 0.08/5.39    inference(cnf_transformation,[status(thm)],[f6])).
% 0.08/5.39  fof(f8,plain,(
% 0.08/5.39    ![X0,X1]: (big_p(X0)|big_p(X1))),
% 0.08/5.39    inference(cnf_transformation,[status(thm)],[f6])).
% 0.08/5.39  fof(f11,plain,(
% 0.08/5.39    ![X0,X1]: (~big_q(X0)|~big_q(X1))),
% 0.08/5.39    inference(cnf_transformation,[status(thm)],[f6])).
% 0.08/5.39  fof(f12,definition,(
% 0.08/5.39    sQ0_spl <=> (big_p(sK0_skl))),
% 0.08/5.39    introduced(definition,[new_symbols(definition,[sQ0_spl])],[split_symbol_definition])).
% 0.08/5.39  fof(f14,plain,(
% 0.08/5.39    ~big_p(sK0_skl)|sQ0_spl),
% 0.08/5.39    inference(component_clause,[status(thm)],[f12])).
% 0.08/5.39  fof(f15,definition,(
% 0.08/5.39    sQ1_spl <=> (big_q(sK1_skl))),
% 0.08/5.39    introduced(definition,[new_symbols(definition,[sQ1_spl])],[split_symbol_definition])).
% 0.08/5.39  fof(f16,plain,(
% 0.08/5.39    big_q(sK1_skl)|~sQ1_spl),
% 0.08/5.39    inference(component_clause,[status(thm)],[f15])).
% 0.08/5.39  fof(f18,definition,(
% 0.08/5.39    sQ2_spl <=> (big_p(sK2_skl))),
% 0.08/5.39    introduced(definition,[new_symbols(definition,[sQ2_spl])],[split_symbol_definition])).
% 0.08/5.39  fof(f20,plain,(
% 0.08/5.39    ~big_p(sK2_skl)|sQ2_spl),
% 0.08/5.39    inference(component_clause,[status(thm)],[f18])).
% 0.08/5.39  fof(f21,definition,(
% 0.08/5.39    sQ3_spl <=> (big_q(sK3_skl))),
% 0.08/5.39    introduced(definition,[new_symbols(definition,[sQ3_spl])],[split_symbol_definition])).
% 0.08/5.39  fof(f22,plain,(
% 0.08/5.39    big_q(sK3_skl)|~sQ3_spl),
% 0.08/5.39    inference(component_clause,[status(thm)],[f21])).
% 0.08/5.39  fof(f24,plain,(
% 0.08/5.39    ~sQ0_spl|sQ1_spl|~sQ2_spl|sQ3_spl),
% 0.08/5.39    inference(split_clause,[status(thm)],[f7,f12,f15,f18,f21])).
% 0.08/5.39  fof(f25,definition,(
% 0.08/5.39    ![X0]: (sQ4_spl <=> (big_p(X0)))),
% 0.08/5.39    introduced(definition,[new_symbols(definition,[sQ4_spl])],[split_symbol_definition])).
% 0.08/5.39  fof(f26,plain,(
% 0.08/5.39    ![X0]: (big_p(X0)|~sQ4_spl)),
% 0.08/5.39    inference(component_clause,[status(thm)],[f25])).
% 0.08/5.39  fof(f28,plain,(
% 0.08/5.39    sQ4_spl),
% 0.08/5.39    inference(split_clause,[status(thm)],[f8,f25])).
% 0.08/5.39  fof(f29,definition,(
% 0.08/5.39    ![X1]: (sQ5_spl <=> (~big_q(X1)))),
% 0.08/5.39    introduced(definition,[new_symbols(definition,[sQ5_spl])],[split_symbol_definition])).
% 0.08/5.39  fof(f30,plain,(
% 0.08/5.39    ![X0]: (~big_q(X0)|~sQ5_spl)),
% 0.08/5.39    inference(component_clause,[status(thm)],[f29])).
% 0.08/5.39  fof(f34,plain,(
% 0.08/5.39    sQ5_spl),
% 0.08/5.39    inference(split_clause,[status(thm)],[f11,f29])).
% 0.08/5.39  fof(f35,plain,(
% 0.08/5.39    $false|~sQ5_spl|~sQ3_spl),
% 0.08/5.39    inference(forward_subsumption_resolution,[status(thm)],[f22,f30])).
% 0.08/5.39  fof(f36,plain,(
% 0.08/5.39    ~sQ5_spl|~sQ3_spl),
% 0.08/5.39    inference(contradiction_clause,[status(thm)],[f35])).
% 0.08/5.39  fof(f37,plain,(
% 0.08/5.39    $false|~sQ4_spl|sQ2_spl),
% 0.08/5.39    inference(forward_subsumption_resolution,[status(thm)],[f20,f26])).
% 0.08/5.39  fof(f38,plain,(
% 0.08/5.39    ~sQ4_spl|sQ2_spl),
% 0.08/5.39    inference(contradiction_clause,[status(thm)],[f37])).
% 0.08/5.39  fof(f39,plain,(
% 0.08/5.39    $false|~sQ4_spl|sQ0_spl),
% 0.08/5.39    inference(forward_subsumption_resolution,[status(thm)],[f14,f26])).
% 0.08/5.39  fof(f40,plain,(
% 0.08/5.39    ~sQ4_spl|sQ0_spl),
% 0.08/5.39    inference(contradiction_clause,[status(thm)],[f39])).
% 0.08/5.39  fof(f41,plain,(
% 0.08/5.39    $false|~sQ5_spl|~sQ1_spl),
% 0.08/5.39    inference(forward_subsumption_resolution,[status(thm)],[f16,f30])).
% 0.08/5.39  fof(f42,plain,(
% 0.08/5.39    ~sQ5_spl|~sQ1_spl),
% 0.08/5.39    inference(contradiction_clause,[status(thm)],[f41])).
% 0.08/5.39  fof(f43,plain,(
% 0.08/5.39    $false),
% 0.08/5.39    inference(sat_refutation,[status(thm)],[f24,f28,f34,f36,f38,f40,f42])).
% 0.08/5.39  % SZS output end CNFRefutation for theBenchmark.p
% 0.14/5.41  % Elapsed time: 0.033357 seconds
% 0.14/5.41  % CPU time: 0.085648 seconds
% 0.14/5.41  % Total memory used: 11.865 MB
% 0.14/5.41  % Net memory used: 11.457 MB
%------------------------------------------------------------------------------