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

% Computer : n011.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:21:34 PM UTC 2026

% Result   : Theorem 0.09s 0.39s
% Output   : Assurance 0s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SYN934+1 : TPTP v9.3.1. Released v3.1.0.
% 0.00/0.04  % Command  : drodi -satmode(on) -timeout(300) /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.09/0.36  % Computer : n011.cluster.edu
% 0.09/0.36  % Model    : x86_64 x86_64
% 0.09/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36  % Memory   : 8046.5625MB
% 0.09/0.36  % OS       : Linux 6.8.0-71-generic
% 0.09/0.36  % CPULimit : 300
% 0.09/0.36  % WCLimit  : 300
% 0.09/0.36  % DateTime : Mon Sep 21 11:30:25 UTC 2026
% 0.09/0.37  % CPUTime  : 
% 0.09/0.37  % Drodi V4.1.1
% 0.09/0.39  % Refutation found
% 0.09/0.39  % SZS status Theorem for theBenchmark: Theorem is valid
% 0.09/0.39  % SZS output start CNFRefutation for theBenchmark
% 0.09/0.39  fof(f1,conjecture,(
% 0.09/0.39    ( (? [X] :( c=> p(X) ))<=> ( c=> (? [X] : p(X) )) ) ),
% 0.09/0.39    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.09/0.39  fof(f2,negated_conjecture,(
% 0.09/0.39    ~(( (? [X] :( c=> p(X) ))<=> ( c=> (? [X] : p(X) )) ) )),
% 0.09/0.39    inference(negated_conjecture,[status(cth)],[f1])).
% 0.09/0.39  fof(f3,plain,(
% 0.09/0.39    ((?[X]: (~c|p(X)))<~>(~c|(?[X]: p(X))))),
% 0.09/0.39    inference(pre_NNF_transformation,[status(thm)],[f2])).
% 0.09/0.39  fof(f4,plain,(
% 0.09/0.39    ((?[X]: (~c|p(X)))|(~c|(?[X]: p(X))))&((![X]: (c&~p(X)))|(c&(![X]: ~p(X))))),
% 0.09/0.39    inference(NNF_transformation,[status(thm)],[f3])).
% 0.09/0.39  fof(f5,plain,(
% 0.09/0.39    ((~c|(?[X]: p(X)))|(~c|(?[X]: p(X))))&((c&(![X]: ~p(X)))|(c&(![X]: ~p(X))))),
% 0.09/0.39    inference(miniscoping,[status(thm)],[f4])).
% 0.09/0.39  fof(f6,plain,(
% 0.09/0.39    ((~c|p(sK0_skl))|(~c|p(sK1_skl)))&((c&(![X]: ~p(X)))|(c&(![X]: ~p(X))))),
% 0.09/0.39    inference(skolemize,[status(esa),new_symbols(skolem,[sK0_skl,sK1_skl]),skolemize(X,sK0_skl),skolemize(X,sK1_skl)],[f5])).
% 0.09/0.39  fof(f7,plain,(
% 0.09/0.39    ~c|p(sK0_skl)|~c|p(sK1_skl)),
% 0.09/0.39    inference(cnf_transformation,[status(thm)],[f6])).
% 0.09/0.39  fof(f8,plain,(
% 0.09/0.39    c|c),
% 0.09/0.39    inference(cnf_transformation,[status(thm)],[f6])).
% 0.09/0.39  fof(f11,plain,(
% 0.09/0.39    ![X0,X1]: (~p(X0)|~p(X1))),
% 0.09/0.39    inference(cnf_transformation,[status(thm)],[f6])).
% 0.09/0.39  fof(f12,definition,(
% 0.09/0.39    sQ0_spl <=> (c)),
% 0.09/0.39    introduced(definition,[new_symbols(definition,[sQ0_spl])],[split_symbol_definition])).
% 0.09/0.39  fof(f15,definition,(
% 0.09/0.39    sQ1_spl <=> (p(sK0_skl))),
% 0.09/0.39    introduced(definition,[new_symbols(definition,[sQ1_spl])],[split_symbol_definition])).
% 0.09/0.39  fof(f16,plain,(
% 0.09/0.39    p(sK0_skl)|~sQ1_spl),
% 0.09/0.39    inference(component_clause,[status(thm)],[f15])).
% 0.09/0.39  fof(f18,definition,(
% 0.09/0.39    sQ2_spl <=> (p(sK1_skl))),
% 0.09/0.39    introduced(definition,[new_symbols(definition,[sQ2_spl])],[split_symbol_definition])).
% 0.09/0.39  fof(f19,plain,(
% 0.09/0.39    p(sK1_skl)|~sQ2_spl),
% 0.09/0.39    inference(component_clause,[status(thm)],[f18])).
% 0.09/0.39  fof(f21,plain,(
% 0.09/0.39    ~sQ0_spl|sQ1_spl|sQ2_spl),
% 0.09/0.39    inference(split_clause,[status(thm)],[f7,f12,f15,f18])).
% 0.09/0.39  fof(f22,plain,(
% 0.09/0.39    sQ0_spl),
% 0.09/0.39    inference(split_clause,[status(thm)],[f8,f12])).
% 0.09/0.39  fof(f23,definition,(
% 0.09/0.39    ![X0]: (sQ3_spl <=> (~p(X0)))),
% 0.09/0.39    introduced(definition,[new_symbols(definition,[sQ3_spl])],[split_symbol_definition])).
% 0.09/0.39  fof(f24,plain,(
% 0.09/0.39    ![X0]: (~p(X0)|~sQ3_spl)),
% 0.09/0.39    inference(component_clause,[status(thm)],[f23])).
% 0.09/0.39  fof(f28,plain,(
% 0.09/0.39    sQ3_spl),
% 0.09/0.39    inference(split_clause,[status(thm)],[f11,f23])).
% 0.09/0.39  fof(f29,plain,(
% 0.09/0.39    $false|~sQ3_spl|~sQ1_spl),
% 0.09/0.39    inference(forward_subsumption_resolution,[status(thm)],[f16,f24])).
% 0.09/0.39  fof(f30,plain,(
% 0.09/0.39    ~sQ3_spl|~sQ1_spl),
% 0.09/0.39    inference(contradiction_clause,[status(thm)],[f29])).
% 0.09/0.39  fof(f31,plain,(
% 0.09/0.39    $false|~sQ3_spl|~sQ2_spl),
% 0.09/0.39    inference(forward_subsumption_resolution,[status(thm)],[f19,f24])).
% 0.09/0.39  fof(f32,plain,(
% 0.09/0.39    ~sQ3_spl|~sQ2_spl),
% 0.09/0.39    inference(contradiction_clause,[status(thm)],[f31])).
% 0.09/0.39  fof(f33,plain,(
% 0.09/0.39    $false),
% 0.09/0.39    inference(sat_refutation,[status(thm)],[f21,f22,f28,f30,f32])).
% 0.09/0.39  % SZS output end CNFRefutation for theBenchmark.p
% 0.09/0.42  % Elapsed time: 0.039951 seconds
% 0.09/0.42  % CPU time: 0.103570 seconds
% 0.09/0.42  % Total memory used: 16.483 MB
% 0.09/0.42  % Net memory used: 15.875 MB
%------------------------------------------------------------------------------