↑ Up

Drodi-SAT---4.1.1.UNS-Ass.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Drodi-SAT---4.1.1
% Problem  : PUZ009-1 : TPTP v9.3.1. Released v1.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : drodi -satmode(on) -timeout(300) /export/starexec/sandbox/benchmark/theBenchmark.p

% Computer : n020.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 02:00:14 PM UTC 2026

% Result   : Unsatisfiable 0.10s 0.39s
% Output   : Assurance 0s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : PUZ009-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.04  % Command  : drodi -satmode(on) -timeout(300) /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.10/0.36  % Computer : n020.cluster.edu
% 0.10/0.36  % Model    : x86_64 x86_64
% 0.10/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36  % Memory   : 8046.5625MB
% 0.10/0.36  % OS       : Linux 6.8.0-71-generic
% 0.10/0.36  % CPULimit : 300
% 0.10/0.36  % WCLimit  : 300
% 0.10/0.36  % DateTime : Mon Sep 21 03:45:47 UTC 2026
% 0.10/0.36  % CPUTime  : 
% 0.10/0.37  % Drodi V4.1.1
% 0.10/0.39  % Refutation found
% 0.10/0.39  % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 0.10/0.39  % SZS output start CNFRefutation for theBenchmark
% 0.10/0.39  fof(f1,axiom,(
% 0.10/0.39    ( ~ a_is_a_knight| ~ b_is_a_knight ) ),
% 0.10/0.39    file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.10/0.39  fof(f5,axiom,(
% 0.10/0.39    ( ~ b_is_a_knight| c_is_a_knight| d_is_a_knight ) ),
% 0.10/0.39    file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.10/0.39  fof(f10,axiom,(
% 0.10/0.39    ( ~ e_is_a_knight| ~ d_is_a_knight| c_is_a_knight ) ),
% 0.10/0.39    file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.10/0.39  fof(f16,axiom,(
% 0.10/0.39    ( a_is_a_knight| e_is_a_knight ) ),
% 0.10/0.39    file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.10/0.39  fof(f17,axiom,(
% 0.10/0.39    ( a_is_a_knight| ~ c_is_a_knight ) ),
% 0.10/0.39    file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.10/0.39  fof(f18,negated_conjecture,(
% 0.10/0.39    b_is_a_knight ),
% 0.10/0.39    file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.10/0.39  fof(f19,plain,(
% 0.10/0.39    ~a_is_a_knight|~b_is_a_knight),
% 0.10/0.39    inference(cnf_transformation,[status(thm)],[f1])).
% 0.10/0.39  fof(f23,plain,(
% 0.10/0.39    ~b_is_a_knight|c_is_a_knight|d_is_a_knight),
% 0.10/0.39    inference(cnf_transformation,[status(thm)],[f5])).
% 0.10/0.39  fof(f28,plain,(
% 0.10/0.39    ~e_is_a_knight|~d_is_a_knight|c_is_a_knight),
% 0.10/0.39    inference(cnf_transformation,[status(thm)],[f10])).
% 0.10/0.39  fof(f34,plain,(
% 0.10/0.39    a_is_a_knight|e_is_a_knight),
% 0.10/0.39    inference(cnf_transformation,[status(thm)],[f16])).
% 0.10/0.39  fof(f35,plain,(
% 0.10/0.39    a_is_a_knight|~c_is_a_knight),
% 0.10/0.39    inference(cnf_transformation,[status(thm)],[f17])).
% 0.10/0.39  fof(f36,plain,(
% 0.10/0.39    b_is_a_knight),
% 0.10/0.39    inference(cnf_transformation,[status(thm)],[f18])).
% 0.10/0.39  fof(f37,definition,(
% 0.10/0.39    sQ0_spl <=> (a_is_a_knight)),
% 0.10/0.39    introduced(definition,[new_symbols(definition,[sQ0_spl])],[split_symbol_definition])).
% 0.10/0.39  fof(f40,definition,(
% 0.10/0.39    sQ1_spl <=> (b_is_a_knight)),
% 0.10/0.39    introduced(definition,[new_symbols(definition,[sQ1_spl])],[split_symbol_definition])).
% 0.10/0.39  fof(f42,plain,(
% 0.10/0.39    ~b_is_a_knight|sQ1_spl),
% 0.10/0.39    inference(component_clause,[status(thm)],[f40])).
% 0.10/0.39  fof(f43,plain,(
% 0.10/0.39    ~sQ0_spl|~sQ1_spl),
% 0.10/0.39    inference(split_clause,[status(thm)],[f19,f37,f40])).
% 0.10/0.39  fof(f44,definition,(
% 0.10/0.39    sQ2_spl <=> (d_is_a_knight)),
% 0.10/0.39    introduced(definition,[new_symbols(definition,[sQ2_spl])],[split_symbol_definition])).
% 0.10/0.39  fof(f50,definition,(
% 0.10/0.39    sQ3_spl <=> (c_is_a_knight)),
% 0.10/0.39    introduced(definition,[new_symbols(definition,[sQ3_spl])],[split_symbol_definition])).
% 0.10/0.39  fof(f53,plain,(
% 0.10/0.39    ~sQ1_spl|sQ3_spl|sQ2_spl),
% 0.10/0.39    inference(split_clause,[status(thm)],[f23,f40,f50,f44])).
% 0.10/0.39  fof(f58,definition,(
% 0.10/0.39    sQ4_spl <=> (e_is_a_knight)),
% 0.10/0.39    introduced(definition,[new_symbols(definition,[sQ4_spl])],[split_symbol_definition])).
% 0.10/0.39  fof(f61,plain,(
% 0.10/0.39    ~sQ4_spl|~sQ2_spl|sQ3_spl),
% 0.10/0.39    inference(split_clause,[status(thm)],[f28,f58,f44,f50])).
% 0.10/0.39  fof(f67,plain,(
% 0.10/0.39    sQ0_spl|sQ4_spl),
% 0.10/0.39    inference(split_clause,[status(thm)],[f34,f37,f58])).
% 0.10/0.39  fof(f68,plain,(
% 0.10/0.39    sQ0_spl|~sQ3_spl),
% 0.10/0.39    inference(split_clause,[status(thm)],[f35,f37,f50])).
% 0.10/0.39  fof(f69,plain,(
% 0.10/0.39    $false|sQ1_spl),
% 0.10/0.39    inference(forward_subsumption_resolution,[status(thm)],[f42,f36])).
% 0.10/0.39  fof(f70,plain,(
% 0.10/0.39    sQ1_spl),
% 0.10/0.39    inference(contradiction_clause,[status(thm)],[f69])).
% 0.10/0.39  fof(f71,plain,(
% 0.10/0.39    $false),
% 0.10/0.39    inference(sat_refutation,[status(thm)],[f43,f53,f61,f67,f68,f70])).
% 0.10/0.39  % SZS output end CNFRefutation for theBenchmark.p
% 0.10/0.41  % Elapsed time: 0.041050 seconds
% 0.10/0.41  % CPU time: 0.103054 seconds
% 0.10/0.41  % Total memory used: 16.657 MB
% 0.10/0.41  % Net memory used: 16.218 MB
%------------------------------------------------------------------------------