↑ 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  : MGT041+2 : 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 : n010.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 01:25:48 PM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : MGT041+2 : 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.09/0.36  % Computer : n010.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 01:22:55 UTC 2026
% 0.09/0.36  % CPUTime  : 
% 0.09/0.37  % Drodi V4.1.1
% 0.09/0.38  % Refutation found
% 0.09/0.38  % SZS status Theorem for theBenchmark: Theorem is valid
% 0.09/0.38  % SZS output start CNFRefutation for theBenchmark
% 0.09/0.38  fof(f1,axiom,(
% 0.09/0.38    (! [X,T] :~ ( number_of_routines(X,T,low)& number_of_routines(X,T,high) ) )),
% 0.09/0.38    file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.09/0.38  fof(f2,hypothesis,(
% 0.09/0.38    (! [X,T] :( ( organisation_at_time(X,T)& efficient_producer(X)& founding_time(X,T) )=> has_elaborated_routines(X,T) ) )),
% 0.09/0.38    file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.09/0.38  fof(f3,hypothesis,(
% 0.09/0.38    (! [X,T] :( ( organisation_at_time(X,T)& first_mover(X)& founding_time(X,T) )=> number_of_routines(X,T,low) ) )),
% 0.09/0.38    file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.09/0.38  fof(f4,hypothesis,(
% 0.09/0.38    (? [X,T] :( organisation_at_time(X,T)& founding_time(X,T)& number_of_routines(X,T,high)& ~ has_elaborated_routines(X,T) ) )),
% 0.09/0.38    file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.09/0.38  fof(f5,conjecture,(
% 0.09/0.38    (? [X,T] :( organisation_at_time(X,T)& ~ first_mover(X)& ~ efficient_producer(X) ) )),
% 0.09/0.38    file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.09/0.38  fof(f6,negated_conjecture,(
% 0.09/0.38    ~((? [X,T] :( organisation_at_time(X,T)& ~ first_mover(X)& ~ efficient_producer(X) ) ))),
% 0.09/0.38    inference(negated_conjecture,[status(cth)],[f5])).
% 0.09/0.38  fof(f7,plain,(
% 0.09/0.38    ![X,T]: (~number_of_routines(X,T,low)|~number_of_routines(X,T,high))),
% 0.09/0.38    inference(pre_NNF_transformation,[status(thm)],[f1])).
% 0.09/0.38  fof(f8,plain,(
% 0.09/0.38    ![X0,X1]: (~number_of_routines(X0,X1,low)|~number_of_routines(X0,X1,high))),
% 0.09/0.38    inference(cnf_transformation,[status(thm)],[f7])).
% 0.09/0.38  fof(f9,plain,(
% 0.09/0.38    ![X,T]: (((~organisation_at_time(X,T)|~efficient_producer(X))|~founding_time(X,T))|has_elaborated_routines(X,T))),
% 0.09/0.38    inference(pre_NNF_transformation,[status(thm)],[f2])).
% 0.09/0.38  fof(f10,plain,(
% 0.09/0.38    ![X0,X1]: (~organisation_at_time(X0,X1)|~efficient_producer(X0)|~founding_time(X0,X1)|has_elaborated_routines(X0,X1))),
% 0.09/0.38    inference(cnf_transformation,[status(thm)],[f9])).
% 0.09/0.38  fof(f11,plain,(
% 0.09/0.38    ![X,T]: (((~organisation_at_time(X,T)|~first_mover(X))|~founding_time(X,T))|number_of_routines(X,T,low))),
% 0.09/0.38    inference(pre_NNF_transformation,[status(thm)],[f3])).
% 0.09/0.38  fof(f12,plain,(
% 0.09/0.38    ![X0,X1]: (~organisation_at_time(X0,X1)|~first_mover(X0)|~founding_time(X0,X1)|number_of_routines(X0,X1,low))),
% 0.09/0.38    inference(cnf_transformation,[status(thm)],[f11])).
% 0.09/0.38  fof(f13,plain,(
% 0.09/0.38    (((organisation_at_time(sK0_skl,sK1_skl)&founding_time(sK0_skl,sK1_skl))&number_of_routines(sK0_skl,sK1_skl,high))&~has_elaborated_routines(sK0_skl,sK1_skl))),
% 0.09/0.38    inference(skolemize,[status(esa),new_symbols(skolem,[sK0_skl,sK1_skl]),skolemize(X,sK0_skl),skolemize(T,sK1_skl)],[f4])).
% 0.09/0.38  fof(f14,plain,(
% 0.09/0.38    organisation_at_time(sK0_skl,sK1_skl)),
% 0.09/0.38    inference(cnf_transformation,[status(thm)],[f13])).
% 0.09/0.38  fof(f15,plain,(
% 0.09/0.38    founding_time(sK0_skl,sK1_skl)),
% 0.09/0.38    inference(cnf_transformation,[status(thm)],[f13])).
% 0.09/0.38  fof(f16,plain,(
% 0.09/0.38    number_of_routines(sK0_skl,sK1_skl,high)),
% 0.09/0.38    inference(cnf_transformation,[status(thm)],[f13])).
% 0.09/0.38  fof(f17,plain,(
% 0.09/0.38    ~has_elaborated_routines(sK0_skl,sK1_skl)),
% 0.09/0.38    inference(cnf_transformation,[status(thm)],[f13])).
% 0.09/0.38  fof(f18,plain,(
% 0.09/0.38    (![X,T]: ((~organisation_at_time(X,T)|first_mover(X))|efficient_producer(X)))),
% 0.09/0.38    inference(pre_NNF_transformation,[status(thm)],[f6])).
% 0.09/0.38  fof(f19,plain,(
% 0.09/0.38    ![X]: (((![T]: ~organisation_at_time(X,T))|first_mover(X))|efficient_producer(X))),
% 0.09/0.38    inference(miniscoping,[status(thm)],[f18])).
% 0.09/0.38  fof(f20,plain,(
% 0.09/0.38    ![X0,X1]: (~organisation_at_time(X0,X1)|first_mover(X0)|efficient_producer(X0))),
% 0.09/0.38    inference(cnf_transformation,[status(thm)],[f19])).
% 0.09/0.38  fof(f21,plain,(
% 0.09/0.38    first_mover(sK0_skl)|efficient_producer(sK0_skl)),
% 0.09/0.38    inference(resolution,[status(thm)],[f14,f20])).
% 0.09/0.38  fof(f22,definition,(
% 0.09/0.38    sQ0_spl <=> (first_mover(sK0_skl))),
% 0.09/0.38    introduced(definition,[new_symbols(definition,[sQ0_spl])],[split_symbol_definition])).
% 0.09/0.38  fof(f25,definition,(
% 0.09/0.38    sQ1_spl <=> (efficient_producer(sK0_skl))),
% 0.09/0.38    introduced(definition,[new_symbols(definition,[sQ1_spl])],[split_symbol_definition])).
% 0.09/0.38  fof(f26,plain,(
% 0.09/0.38    efficient_producer(sK0_skl)|~sQ1_spl),
% 0.09/0.38    inference(component_clause,[status(thm)],[f25])).
% 0.09/0.38  fof(f28,plain,(
% 0.09/0.38    sQ0_spl|sQ1_spl),
% 0.09/0.38    inference(split_clause,[status(thm)],[f21,f22,f25])).
% 0.09/0.38  fof(f29,plain,(
% 0.09/0.38    ~organisation_at_time(sK0_skl,sK1_skl)|~first_mover(sK0_skl)|number_of_routines(sK0_skl,sK1_skl,low)),
% 0.09/0.38    inference(resolution,[status(thm)],[f15,f12])).
% 0.09/0.38  fof(f30,definition,(
% 0.09/0.38    sQ2_spl <=> (organisation_at_time(sK0_skl,sK1_skl))),
% 0.09/0.38    introduced(definition,[new_symbols(definition,[sQ2_spl])],[split_symbol_definition])).
% 0.09/0.38  fof(f32,plain,(
% 0.09/0.38    ~organisation_at_time(sK0_skl,sK1_skl)|sQ2_spl),
% 0.09/0.38    inference(component_clause,[status(thm)],[f30])).
% 0.09/0.38  fof(f33,definition,(
% 0.09/0.38    sQ3_spl <=> (number_of_routines(sK0_skl,sK1_skl,low))),
% 0.09/0.38    introduced(definition,[new_symbols(definition,[sQ3_spl])],[split_symbol_definition])).
% 0.09/0.38  fof(f34,plain,(
% 0.09/0.38    number_of_routines(sK0_skl,sK1_skl,low)|~sQ3_spl),
% 0.09/0.38    inference(component_clause,[status(thm)],[f33])).
% 0.09/0.38  fof(f36,plain,(
% 0.09/0.38    ~sQ2_spl|~sQ0_spl|sQ3_spl),
% 0.09/0.38    inference(split_clause,[status(thm)],[f29,f30,f22,f33])).
% 0.09/0.38  fof(f37,plain,(
% 0.09/0.38    ![X0]: (~organisation_at_time(sK0_skl,X0)|~founding_time(sK0_skl,X0)|has_elaborated_routines(sK0_skl,X0)|~sQ1_spl)),
% 0.09/0.38    inference(resolution,[status(thm)],[f26,f10])).
% 0.09/0.38  fof(f38,plain,(
% 0.09/0.38    ~organisation_at_time(sK0_skl,sK1_skl)|~founding_time(sK0_skl,sK1_skl)|~sQ1_spl),
% 0.09/0.38    inference(resolution,[status(thm)],[f17,f37])).
% 0.09/0.38  fof(f39,definition,(
% 0.09/0.38    sQ4_spl <=> (founding_time(sK0_skl,sK1_skl))),
% 0.09/0.38    introduced(definition,[new_symbols(definition,[sQ4_spl])],[split_symbol_definition])).
% 0.09/0.38  fof(f41,plain,(
% 0.09/0.38    ~founding_time(sK0_skl,sK1_skl)|sQ4_spl),
% 0.09/0.38    inference(component_clause,[status(thm)],[f39])).
% 0.09/0.38  fof(f42,plain,(
% 0.09/0.38    ~sQ2_spl|~sQ4_spl|~sQ1_spl),
% 0.09/0.38    inference(split_clause,[status(thm)],[f38,f30,f39,f25])).
% 0.09/0.38  fof(f43,plain,(
% 0.09/0.38    $false|sQ2_spl),
% 0.09/0.38    inference(forward_subsumption_resolution,[status(thm)],[f32,f14])).
% 0.09/0.38  fof(f44,plain,(
% 0.09/0.38    sQ2_spl),
% 0.09/0.38    inference(contradiction_clause,[status(thm)],[f43])).
% 0.09/0.38  fof(f45,plain,(
% 0.09/0.38    $false|sQ4_spl),
% 0.09/0.38    inference(forward_subsumption_resolution,[status(thm)],[f41,f15])).
% 0.09/0.38  fof(f46,plain,(
% 0.09/0.38    sQ4_spl),
% 0.09/0.38    inference(contradiction_clause,[status(thm)],[f45])).
% 0.09/0.38  fof(f47,plain,(
% 0.09/0.38    ~number_of_routines(sK0_skl,sK1_skl,low)),
% 0.09/0.38    inference(resolution,[status(thm)],[f8,f16])).
% 0.09/0.38  fof(f48,plain,(
% 0.09/0.38    $false|~sQ3_spl),
% 0.09/0.38    inference(forward_subsumption_resolution,[status(thm)],[f47,f34])).
% 0.09/0.38  fof(f49,plain,(
% 0.09/0.38    ~sQ3_spl),
% 0.09/0.38    inference(contradiction_clause,[status(thm)],[f48])).
% 0.09/0.38  fof(f50,plain,(
% 0.09/0.38    $false),
% 0.09/0.38    inference(sat_refutation,[status(thm)],[f28,f36,f42,f44,f46,f49])).
% 0.09/0.38  % SZS output end CNFRefutation for theBenchmark.p
% 0.09/0.40  % Elapsed time: 0.029158 seconds
% 0.09/0.40  % CPU time: 0.081908 seconds
% 0.09/0.40  % Total memory used: 11.426 MB
% 0.09/0.40  % Net memory used: 11.103 MB
%------------------------------------------------------------------------------