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

% Computer : n014.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:18:47 PM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SYN045+1 : TPTP v9.3.1. Released v2.0.0.
% 0.00/0.03  % Command  : drodi -satmode(on) -timeout(300) /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.08/0.36  % Computer : n014.cluster.edu
% 0.08/0.36  % Model    : x86_64 x86_64
% 0.08/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.36  % Memory   : 8046.5625MB
% 0.08/0.36  % OS       : Linux 6.8.0-71-generic
% 0.08/0.36  % CPULimit : 300
% 0.01/0.36  % WCLimit  : 300
% 0.01/0.36  % DateTime : Mon Sep 21 10:39:49 UTC 2026
% 0.01/0.36  % CPUTime  : 
% 0.01/0.37  % Drodi V4.1.1
% 0.01/0.39  % Refutation found
% 0.01/0.39  % SZS status Theorem for theBenchmark: Theorem is valid
% 0.01/0.39  % SZS output start CNFRefutation for theBenchmark
% 0.01/0.39  fof(f1,conjecture,(
% 0.01/0.39    ( ( p| ( q& r ) )<=> ( ( p| q )& ( p| r ) ) ) ),
% 0.01/0.39    file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.01/0.39  fof(f2,negated_conjecture,(
% 0.01/0.39    ~(( ( p| ( q& r ) )<=> ( ( p| q )& ( p| r ) ) ) )),
% 0.01/0.39    inference(negated_conjecture,[status(cth)],[f1])).
% 0.01/0.39  fof(f3,plain,(
% 0.01/0.39    ((p|(q&r))<~>((p|q)&(p|r)))),
% 0.01/0.39    inference(pre_NNF_transformation,[status(thm)],[f2])).
% 0.01/0.39  fof(f4,definition,(
% 0.01/0.39    sP0_prd<=>(p|q)),
% 0.01/0.39    introduced(definition,[new_symbols(definition,[sP0_prd])],[])).
% 0.01/0.39  fof(f5,plain,(
% 0.01/0.39    (p|(q&r))<~>(sP0_prd&(p|r))),
% 0.01/0.39    inference(formula_renaming,[status(thm)],[f3,f4])).
% 0.01/0.39  fof(f6,plain,(
% 0.01/0.39    ((p|(q&r))|(sP0_prd&(p|r)))&((~p&(~q|~r))|(~sP0_prd|(~p&~r)))),
% 0.01/0.39    inference(NNF_transformation,[status(thm)],[f5])).
% 0.01/0.39  fof(f7,plain,(
% 0.01/0.39    p|q|sP0_prd),
% 0.01/0.39    inference(cnf_transformation,[status(thm)],[f6])).
% 0.01/0.39  fof(f10,plain,(
% 0.01/0.39    p|r|p|r),
% 0.01/0.39    inference(cnf_transformation,[status(thm)],[f6])).
% 0.01/0.39  fof(f11,plain,(
% 0.01/0.39    ~p|~sP0_prd|~p),
% 0.01/0.39    inference(cnf_transformation,[status(thm)],[f6])).
% 0.01/0.39  fof(f14,plain,(
% 0.01/0.39    ~q|~r|~sP0_prd|~r),
% 0.01/0.39    inference(cnf_transformation,[status(thm)],[f6])).
% 0.01/0.39  fof(f15,plain,(
% 0.01/0.39    (~sP0_prd|(p|q))&(sP0_prd|(~p&~q))),
% 0.01/0.39    inference(NNF_transformation,[status(thm)],[f4])).
% 0.01/0.39  fof(f16,plain,(
% 0.01/0.39    ~sP0_prd|p|q),
% 0.01/0.39    inference(cnf_transformation,[status(thm)],[f15])).
% 0.01/0.39  fof(f17,plain,(
% 0.01/0.39    sP0_prd|~p),
% 0.01/0.39    inference(cnf_transformation,[status(thm)],[f15])).
% 0.01/0.39  fof(f18,plain,(
% 0.01/0.39    sP0_prd|~q),
% 0.01/0.39    inference(cnf_transformation,[status(thm)],[f15])).
% 0.01/0.39  fof(f19,definition,(
% 0.01/0.39    sQ0_spl <=> (p)),
% 0.01/0.39    introduced(definition,[new_symbols(definition,[sQ0_spl])],[split_symbol_definition])).
% 0.01/0.39  fof(f22,definition,(
% 0.01/0.39    sQ1_spl <=> (q)),
% 0.01/0.39    introduced(definition,[new_symbols(definition,[sQ1_spl])],[split_symbol_definition])).
% 0.01/0.39  fof(f25,definition,(
% 0.01/0.39    sQ2_spl <=> (sP0_prd)),
% 0.01/0.39    introduced(definition,[new_symbols(definition,[sQ2_spl])],[split_symbol_definition])).
% 0.01/0.39  fof(f28,plain,(
% 0.01/0.39    sQ0_spl|sQ1_spl|sQ2_spl),
% 0.01/0.39    inference(split_clause,[status(thm)],[f7,f19,f22,f25])).
% 0.01/0.39  fof(f29,definition,(
% 0.01/0.39    sQ3_spl <=> (r)),
% 0.01/0.39    introduced(definition,[new_symbols(definition,[sQ3_spl])],[split_symbol_definition])).
% 0.01/0.39  fof(f34,plain,(
% 0.01/0.39    sQ0_spl|sQ3_spl),
% 0.01/0.39    inference(split_clause,[status(thm)],[f10,f19,f29])).
% 0.01/0.39  fof(f35,plain,(
% 0.01/0.39    ~sQ0_spl|~sQ2_spl),
% 0.01/0.39    inference(split_clause,[status(thm)],[f11,f19,f25])).
% 0.01/0.39  fof(f38,plain,(
% 0.01/0.39    ~sQ1_spl|~sQ3_spl|~sQ2_spl),
% 0.01/0.39    inference(split_clause,[status(thm)],[f14,f22,f29,f25])).
% 0.01/0.39  fof(f39,plain,(
% 0.01/0.39    ~sQ2_spl|sQ0_spl|sQ1_spl),
% 0.01/0.39    inference(split_clause,[status(thm)],[f16,f25,f19,f22])).
% 0.01/0.39  fof(f40,plain,(
% 0.01/0.39    sQ2_spl|~sQ0_spl),
% 0.01/0.39    inference(split_clause,[status(thm)],[f17,f25,f19])).
% 0.01/0.39  fof(f41,plain,(
% 0.01/0.39    sQ2_spl|~sQ1_spl),
% 0.01/0.39    inference(split_clause,[status(thm)],[f18,f25,f22])).
% 0.01/0.39  fof(f42,plain,(
% 0.01/0.39    $false),
% 0.01/0.39    inference(sat_refutation,[status(thm)],[f28,f34,f35,f38,f39,f40,f41])).
% 0.01/0.39  % SZS output end CNFRefutation for theBenchmark.p
% 0.01/0.41  % Elapsed time: 0.044744 seconds
% 0.01/0.41  % CPU time: 0.102365 seconds
% 0.01/0.41  % Total memory used: 16.548 MB
% 0.01/0.41  % Net memory used: 16.009 MB
%------------------------------------------------------------------------------