↑ 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  : SYN951+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 : n013.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:36 PM UTC 2026

% Result   : Theorem 0.12s 0.38s
% Output   : Assurance 0s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SYN951+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.11/0.35  % Computer : n013.cluster.edu
% 0.11/0.35  % Model    : x86_64 x86_64
% 0.11/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.35  % Memory   : 8046.5625MB
% 0.11/0.35  % OS       : Linux 6.8.0-71-generic
% 0.11/0.35  % CPULimit : 300
% 0.11/0.35  % WCLimit  : 300
% 0.11/0.35  % DateTime : Mon Sep 21 11:30:21 UTC 2026
% 0.11/0.36  % CPUTime  : 
% 0.12/0.36  % Drodi V4.1.1
% 0.12/0.38  % Refutation found
% 0.12/0.38  % SZS status Theorem for theBenchmark: Theorem is valid
% 0.12/0.38  % SZS output start CNFRefutation for theBenchmark
% 0.12/0.38  fof(f1,conjecture,(
% 0.12/0.38    ( (? [X] : p(X))=> ( (? [X] : p(X))& ( a=> ( ( b| ~ b )& ( q=> q ) ) ) ) ) ),
% 0.12/0.38    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.12/0.38  fof(f2,negated_conjecture,(
% 0.12/0.38    ~(( (? [X] : p(X))=> ( (? [X] : p(X))& ( a=> ( ( b| ~ b )& ( q=> q ) ) ) ) ) )),
% 0.12/0.38    inference(negated_conjecture,[status(cth)],[f1])).
% 0.12/0.38  fof(f3,plain,(
% 0.12/0.38    ((?[X]: p(X))&((![X]: ~p(X))|(a&((~b&b)|(q&~q)))))),
% 0.12/0.38    inference(pre_NNF_transformation,[status(thm)],[f2])).
% 0.12/0.38  fof(f4,definition,(
% 0.12/0.38    sP0_prd<=>(~b&b)),
% 0.12/0.38    introduced(definition,[new_symbols(definition,[sP0_prd])],[])).
% 0.12/0.38  fof(f5,plain,(
% 0.12/0.38    (?[X]: p(X))&((![X]: ~p(X))|(a&(sP0_prd|(q&~q))))),
% 0.12/0.38    inference(formula_renaming,[status(thm)],[f3,f4])).
% 0.12/0.38  fof(f6,plain,(
% 0.12/0.38    p(sK0_skl)&((![X]: ~p(X))|(a&(sP0_prd|(q&~q))))),
% 0.12/0.38    inference(skolemize,[status(esa),new_symbols(skolem,[sK0_skl]),skolemize(X,sK0_skl)],[f5])).
% 0.12/0.38  fof(f7,plain,(
% 0.12/0.38    p(sK0_skl)),
% 0.12/0.38    inference(cnf_transformation,[status(thm)],[f6])).
% 0.12/0.38  fof(f8,plain,(
% 0.12/0.38    ![X0]: (~p(X0)|a)),
% 0.12/0.38    inference(cnf_transformation,[status(thm)],[f6])).
% 0.12/0.38  fof(f9,plain,(
% 0.12/0.38    ![X0]: (~p(X0)|sP0_prd|q)),
% 0.12/0.38    inference(cnf_transformation,[status(thm)],[f6])).
% 0.12/0.38  fof(f10,plain,(
% 0.12/0.38    ![X0]: (~p(X0)|sP0_prd|~q)),
% 0.12/0.38    inference(cnf_transformation,[status(thm)],[f6])).
% 0.12/0.38  fof(f11,plain,(
% 0.12/0.38    (~sP0_prd|(~b&b))&(sP0_prd|(b|~b))),
% 0.12/0.38    inference(NNF_transformation,[status(thm)],[f4])).
% 0.12/0.38  fof(f12,plain,(
% 0.12/0.38    ~sP0_prd|~b),
% 0.12/0.38    inference(cnf_transformation,[status(thm)],[f11])).
% 0.12/0.38  fof(f13,plain,(
% 0.12/0.38    ~sP0_prd|b),
% 0.12/0.38    inference(cnf_transformation,[status(thm)],[f11])).
% 0.12/0.38  fof(f15,definition,(
% 0.12/0.38    ![X0]: (sQ0_spl <=> (~p(X0)))),
% 0.12/0.38    introduced(definition,[new_symbols(definition,[sQ0_spl])],[split_symbol_definition])).
% 0.12/0.38  fof(f16,plain,(
% 0.12/0.38    ![X0]: (~p(X0)|~sQ0_spl)),
% 0.12/0.38    inference(component_clause,[status(thm)],[f15])).
% 0.12/0.38  fof(f18,definition,(
% 0.12/0.38    sQ1_spl <=> (a)),
% 0.12/0.38    introduced(definition,[new_symbols(definition,[sQ1_spl])],[split_symbol_definition])).
% 0.12/0.38  fof(f21,plain,(
% 0.12/0.38    sQ0_spl|sQ1_spl),
% 0.12/0.38    inference(split_clause,[status(thm)],[f8,f15,f18])).
% 0.12/0.38  fof(f22,definition,(
% 0.12/0.38    sQ2_spl <=> (sP0_prd)),
% 0.12/0.38    introduced(definition,[new_symbols(definition,[sQ2_spl])],[split_symbol_definition])).
% 0.12/0.38  fof(f25,definition,(
% 0.12/0.38    sQ3_spl <=> (q)),
% 0.12/0.38    introduced(definition,[new_symbols(definition,[sQ3_spl])],[split_symbol_definition])).
% 0.12/0.38  fof(f28,plain,(
% 0.12/0.38    sQ0_spl|sQ2_spl|sQ3_spl),
% 0.12/0.38    inference(split_clause,[status(thm)],[f9,f15,f22,f25])).
% 0.12/0.38  fof(f29,plain,(
% 0.12/0.38    sQ0_spl|sQ2_spl|~sQ3_spl),
% 0.12/0.38    inference(split_clause,[status(thm)],[f10,f15,f22,f25])).
% 0.12/0.38  fof(f30,definition,(
% 0.12/0.38    sQ4_spl <=> (b)),
% 0.12/0.38    introduced(definition,[new_symbols(definition,[sQ4_spl])],[split_symbol_definition])).
% 0.12/0.38  fof(f33,plain,(
% 0.12/0.38    ~sQ2_spl|~sQ4_spl),
% 0.12/0.38    inference(split_clause,[status(thm)],[f12,f22,f30])).
% 0.12/0.38  fof(f34,plain,(
% 0.12/0.38    ~sQ2_spl|sQ4_spl),
% 0.12/0.38    inference(split_clause,[status(thm)],[f13,f22,f30])).
% 0.12/0.38  fof(f36,plain,(
% 0.12/0.38    $false|~sQ0_spl),
% 0.12/0.38    inference(forward_subsumption_resolution,[status(thm)],[f7,f16])).
% 0.12/0.38  fof(f37,plain,(
% 0.12/0.38    ~sQ0_spl),
% 0.12/0.38    inference(contradiction_clause,[status(thm)],[f36])).
% 0.12/0.38  fof(f38,plain,(
% 0.12/0.38    $false),
% 0.12/0.38    inference(sat_refutation,[status(thm)],[f21,f28,f29,f33,f34,f37])).
% 0.12/0.38  % SZS output end CNFRefutation for theBenchmark.p
% 0.12/0.40  % Elapsed time: 0.039753 seconds
% 0.12/0.40  % CPU time: 0.111658 seconds
% 0.12/0.40  % Total memory used: 14.975 MB
% 0.12/0.40  % Net memory used: 14.477 MB
%------------------------------------------------------------------------------