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

% Computer : n012.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:38 PM UTC 2026

% Result   : Theorem 0.07s 0.32s
% Output   : Assurance 0s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01  % Problem  : MGT003+1 : TPTP v9.3.1. Released v2.0.0.
% 0.00/0.02  % Command  : drodi -satmode(on) -timeout(300) /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.04/0.30  % Computer : n012.cluster.edu
% 0.04/0.30  % Model    : x86_64 x86_64
% 0.04/0.30  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.04/0.30  % Memory   : 8046.5625MB
% 0.04/0.30  % OS       : Linux 6.8.0-71-generic
% 0.04/0.30  % CPULimit : 300
% 0.04/0.30  % WCLimit  : 300
% 0.04/0.30  % DateTime : Mon Sep 21 01:19:56 UTC 2026
% 0.04/0.30  % CPUTime  : 
% 0.04/0.31  % Drodi V4.1.1
% 0.07/0.32  % Refutation found
% 0.07/0.32  % SZS status Theorem for theBenchmark: Theorem is valid
% 0.07/0.32  % SZS output start CNFRefutation for theBenchmark
% 0.07/0.32  fof(f1,axiom,(
% 0.07/0.32    (! [X,T1,T2] :( reorganization_free(X,T1,T2)=> ( reorganization_free(X,T1,T1)& reorganization_free(X,T2,T2) ) ) )),
% 0.07/0.32    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.07/0.32  fof(f2,axiom,(
% 0.07/0.32    (! [X,T] :( organization(X,T)=> (? [I] : inertia(X,I,T) )) )),
% 0.07/0.32    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.07/0.32  fof(f3,hypothesis,(
% 0.07/0.32    (! [X,Y,T1,T2,I1,I2,P1,P2] :( ( organization(X,T1)& organization(Y,T2)& reorganization_free(X,T1,T1)& reorganization_free(Y,T2,T2)& inertia(X,I1,T1)& inertia(Y,I2,T2)& survival_chance(X,P1,T1)& survival_chance(Y,P2,T2)& greater(I2,I1) )=> greater(P2,P1) ) )),
% 0.07/0.32    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.07/0.32  fof(f4,hypothesis,(
% 0.07/0.32    (! [X,I1,I2,T1,T2] :( ( organization(X,T1)& organization(X,T2)& reorganization_free(X,T1,T2)& inertia(X,I1,T1)& inertia(X,I2,T2)& greater(T2,T1) )=> greater(I2,I1) ) )),
% 0.07/0.32    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.07/0.32  fof(f5,conjecture,(
% 0.07/0.32    (! [X,P1,P2,T1,T2] :( ( organization(X,T1)& organization(X,T2)& reorganization_free(X,T1,T2)& survival_chance(X,P1,T1)& survival_chance(X,P2,T2)& greater(T2,T1) )=> greater(P2,P1) ) )),
% 0.07/0.32    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.07/0.32  fof(f6,negated_conjecture,(
% 0.07/0.32    ~((! [X,P1,P2,T1,T2] :( ( organization(X,T1)& organization(X,T2)& reorganization_free(X,T1,T2)& survival_chance(X,P1,T1)& survival_chance(X,P2,T2)& greater(T2,T1) )=> greater(P2,P1) ) ))),
% 0.07/0.32    inference(negated_conjecture,[status(cth)],[f5])).
% 0.07/0.32  fof(f7,plain,(
% 0.07/0.32    ![X,T1,T2]: (~reorganization_free(X,T1,T2)|(reorganization_free(X,T1,T1)&reorganization_free(X,T2,T2)))),
% 0.07/0.32    inference(pre_NNF_transformation,[status(thm)],[f1])).
% 0.07/0.32  fof(f8,plain,(
% 0.07/0.32    ![X0,X1,X2]: (~reorganization_free(X0,X1,X2)|reorganization_free(X0,X1,X1))),
% 0.07/0.32    inference(cnf_transformation,[status(thm)],[f7])).
% 0.07/0.32  fof(f9,plain,(
% 0.07/0.32    ![X0,X1,X2]: (~reorganization_free(X0,X1,X2)|reorganization_free(X0,X2,X2))),
% 0.07/0.32    inference(cnf_transformation,[status(thm)],[f7])).
% 0.07/0.32  fof(f10,plain,(
% 0.07/0.32    ![X,T]: (~organization(X,T)|(?[I]: inertia(X,I,T)))),
% 0.07/0.32    inference(pre_NNF_transformation,[status(thm)],[f2])).
% 0.07/0.32  fof(f11,plain,(
% 0.07/0.32    ![X,T]: (~organization(X,T)|inertia(X,sK0_skl(T,X),T))),
% 0.07/0.32    inference(skolemize,[status(esa),new_symbols(skolem,[sK0_skl]),skolemize(I,sK0_skl(T,X))],[f10])).
% 0.07/0.32  fof(f12,plain,(
% 0.07/0.32    ![X0,X1]: (~organization(X0,X1)|inertia(X0,sK0_skl(X1,X0),X1))),
% 0.07/0.32    inference(cnf_transformation,[status(thm)],[f11])).
% 0.07/0.32  fof(f13,plain,(
% 0.07/0.32    ![X,Y,T1,T2,I1,I2,P1,P2]: (((((((((~organization(X,T1)|~organization(Y,T2))|~reorganization_free(X,T1,T1))|~reorganization_free(Y,T2,T2))|~inertia(X,I1,T1))|~inertia(Y,I2,T2))|~survival_chance(X,P1,T1))|~survival_chance(Y,P2,T2))|~greater(I2,I1))|greater(P2,P1))),
% 0.07/0.32    inference(pre_NNF_transformation,[status(thm)],[f3])).
% 0.07/0.32  fof(f14,plain,(
% 0.07/0.32    ![P1,P2]: ((![I1,I2]: ((![Y,T2]: ((![X,T1]: ((((((~organization(X,T1)|~organization(Y,T2))|~reorganization_free(X,T1,T1))|~reorganization_free(Y,T2,T2))|~inertia(X,I1,T1))|~inertia(Y,I2,T2))|~survival_chance(X,P1,T1)))|~survival_chance(Y,P2,T2)))|~greater(I2,I1)))|greater(P2,P1))),
% 0.07/0.32    inference(miniscoping,[status(thm)],[f13])).
% 0.07/0.32  fof(f15,plain,(
% 0.07/0.32    ![X0,X1,X2,X3,X4,X5,X6,X7]: (~organization(X0,X1)|~organization(X2,X3)|~reorganization_free(X0,X1,X1)|~reorganization_free(X2,X3,X3)|~inertia(X0,X4,X1)|~inertia(X2,X5,X3)|~survival_chance(X0,X6,X1)|~survival_chance(X2,X7,X3)|~greater(X5,X4)|greater(X7,X6))),
% 0.07/0.32    inference(cnf_transformation,[status(thm)],[f14])).
% 0.07/0.32  fof(f16,plain,(
% 0.07/0.32    ![X,I1,I2,T1,T2]: ((((((~organization(X,T1)|~organization(X,T2))|~reorganization_free(X,T1,T2))|~inertia(X,I1,T1))|~inertia(X,I2,T2))|~greater(T2,T1))|greater(I2,I1))),
% 0.07/0.32    inference(pre_NNF_transformation,[status(thm)],[f4])).
% 0.07/0.32  fof(f17,plain,(
% 0.07/0.32    ![I1,I2]: ((![T1,T2]: ((![X]: ((((~organization(X,T1)|~organization(X,T2))|~reorganization_free(X,T1,T2))|~inertia(X,I1,T1))|~inertia(X,I2,T2)))|~greater(T2,T1)))|greater(I2,I1))),
% 0.07/0.32    inference(miniscoping,[status(thm)],[f16])).
% 0.07/0.32  fof(f18,plain,(
% 0.07/0.32    ![X0,X1,X2,X3,X4]: (~organization(X0,X1)|~organization(X0,X2)|~reorganization_free(X0,X1,X2)|~inertia(X0,X3,X1)|~inertia(X0,X4,X2)|~greater(X2,X1)|greater(X4,X3))),
% 0.07/0.33    inference(cnf_transformation,[status(thm)],[f17])).
% 0.07/0.33  fof(f19,plain,(
% 0.07/0.33    (?[X,P1,P2,T1,T2]: ((((((organization(X,T1)&organization(X,T2))&reorganization_free(X,T1,T2))&survival_chance(X,P1,T1))&survival_chance(X,P2,T2))&greater(T2,T1))&~greater(P2,P1)))),
% 0.07/0.33    inference(pre_NNF_transformation,[status(thm)],[f6])).
% 0.07/0.33  fof(f20,plain,(
% 0.07/0.33    ?[P1,P2]: ((?[T1,T2]: ((?[X]: ((((organization(X,T1)&organization(X,T2))&reorganization_free(X,T1,T2))&survival_chance(X,P1,T1))&survival_chance(X,P2,T2)))&greater(T2,T1)))&~greater(P2,P1))),
% 0.07/0.33    inference(miniscoping,[status(thm)],[f19])).
% 0.07/0.33  fof(f21,plain,(
% 0.07/0.33    ((((((organization(sK5_skl,sK3_skl)&organization(sK5_skl,sK4_skl))&reorganization_free(sK5_skl,sK3_skl,sK4_skl))&survival_chance(sK5_skl,sK1_skl,sK3_skl))&survival_chance(sK5_skl,sK2_skl,sK4_skl))&greater(sK4_skl,sK3_skl))&~greater(sK2_skl,sK1_skl))),
% 0.07/0.33    inference(skolemize,[status(esa),new_symbols(skolem,[sK1_skl,sK2_skl,sK3_skl,sK4_skl,sK5_skl]),skolemize(P1,sK1_skl),skolemize(P2,sK2_skl),skolemize(T1,sK3_skl),skolemize(T2,sK4_skl),skolemize(X,sK5_skl)],[f20])).
% 0.07/0.33  fof(f22,plain,(
% 0.07/0.33    organization(sK5_skl,sK3_skl)),
% 0.07/0.33    inference(cnf_transformation,[status(thm)],[f21])).
% 0.07/0.33  fof(f23,plain,(
% 0.07/0.33    organization(sK5_skl,sK4_skl)),
% 0.07/0.33    inference(cnf_transformation,[status(thm)],[f21])).
% 0.07/0.33  fof(f24,plain,(
% 0.07/0.33    reorganization_free(sK5_skl,sK3_skl,sK4_skl)),
% 0.07/0.33    inference(cnf_transformation,[status(thm)],[f21])).
% 0.07/0.33  fof(f25,plain,(
% 0.07/0.33    survival_chance(sK5_skl,sK1_skl,sK3_skl)),
% 0.07/0.33    inference(cnf_transformation,[status(thm)],[f21])).
% 0.07/0.33  fof(f26,plain,(
% 0.07/0.33    survival_chance(sK5_skl,sK2_skl,sK4_skl)),
% 0.07/0.33    inference(cnf_transformation,[status(thm)],[f21])).
% 0.07/0.33  fof(f27,plain,(
% 0.07/0.33    greater(sK4_skl,sK3_skl)),
% 0.07/0.33    inference(cnf_transformation,[status(thm)],[f21])).
% 0.07/0.33  fof(f28,plain,(
% 0.07/0.33    ~greater(sK2_skl,sK1_skl)),
% 0.07/0.33    inference(cnf_transformation,[status(thm)],[f21])).
% 0.07/0.33  fof(f29,plain,(
% 0.07/0.33    ![X0,X1,X2,X3,X4,X5,X6]: (~organization(X0,X1)|~organization(X2,X3)|~organization(X0,X1)|~reorganization_free(X2,X3,X3)|~reorganization_free(X0,X1,X1)|~inertia(X2,X4,X3)|~survival_chance(X2,X5,X3)|~survival_chance(X0,X6,X1)|~greater(sK0_skl(X1,X0),X4)|greater(X6,X5))),
% 0.07/0.33    inference(resolution,[status(thm)],[f12,f15])).
% 0.07/0.33  fof(f30,plain,(
% 0.07/0.33    ![X0,X1,X2,X3,X4,X5,X6]: (~organization(X0,X1)|~organization(X2,X3)|~reorganization_free(X2,X3,X3)|~reorganization_free(X0,X1,X1)|~inertia(X2,X4,X3)|~survival_chance(X2,X5,X3)|~survival_chance(X0,X6,X1)|~greater(sK0_skl(X1,X0),X4)|greater(X6,X5))),
% 0.07/0.33    inference(duplicate_literals_removal,[status(thm)],[f29])).
% 0.07/0.33  fof(f31,plain,(
% 0.07/0.33    ![X0,X1,X2]: (~organization(X0,sK3_skl)|~organization(X0,sK4_skl)|~reorganization_free(X0,sK3_skl,sK4_skl)|~inertia(X0,X1,sK3_skl)|~inertia(X0,X2,sK4_skl)|greater(X2,X1))),
% 0.07/0.33    inference(resolution,[status(thm)],[f18,f27])).
% 0.07/0.33  fof(f32,plain,(
% 0.07/0.33    ![X0,X1]: (~organization(sK5_skl,sK3_skl)|~reorganization_free(sK5_skl,sK3_skl,sK4_skl)|~inertia(sK5_skl,X0,sK3_skl)|~inertia(sK5_skl,X1,sK4_skl)|greater(X1,X0))),
% 0.07/0.33    inference(resolution,[status(thm)],[f31,f23])).
% 0.07/0.33  fof(f33,plain,(
% 0.07/0.33    ![X0,X1]: (~reorganization_free(sK5_skl,sK3_skl,sK4_skl)|~inertia(sK5_skl,X0,sK3_skl)|~inertia(sK5_skl,X1,sK4_skl)|greater(X1,X0))),
% 0.07/0.33    inference(forward_subsumption_resolution,[status(thm)],[f32,f22])).
% 0.07/0.33  fof(f34,plain,(
% 0.07/0.33    ![X0,X1]: (~inertia(sK5_skl,X0,sK3_skl)|~inertia(sK5_skl,X1,sK4_skl)|greater(X1,X0))),
% 0.07/0.33    inference(forward_subsumption_resolution,[status(thm)],[f33,f24])).
% 0.07/0.33  fof(f35,plain,(
% 0.07/0.33    ![X0]: (~inertia(sK5_skl,X0,sK3_skl)|greater(sK0_skl(sK4_skl,sK5_skl),X0)|~organization(sK5_skl,sK4_skl))),
% 0.07/0.33    inference(resolution,[status(thm)],[f34,f12])).
% 0.07/0.33  fof(f36,plain,(
% 0.07/0.33    ![X0]: (~inertia(sK5_skl,X0,sK3_skl)|greater(sK0_skl(sK4_skl,sK5_skl),X0))),
% 0.07/0.33    inference(forward_subsumption_resolution,[status(thm)],[f35,f23])).
% 0.07/0.33  fof(f37,plain,(
% 0.07/0.33    greater(sK0_skl(sK4_skl,sK5_skl),sK0_skl(sK3_skl,sK5_skl))|~organization(sK5_skl,sK3_skl)),
% 0.07/0.33    inference(resolution,[status(thm)],[f36,f12])).
% 0.07/0.33  fof(f38,plain,(
% 0.07/0.33    greater(sK0_skl(sK4_skl,sK5_skl),sK0_skl(sK3_skl,sK5_skl))),
% 0.07/0.33    inference(forward_subsumption_resolution,[status(thm)],[f37,f22])).
% 0.07/0.33  fof(f39,plain,(
% 0.07/0.33    ![X0,X1,X2,X3]: (~organization(sK5_skl,sK4_skl)|~organization(X0,X1)|~reorganization_free(X0,X1,X1)|~reorganization_free(sK5_skl,sK4_skl,sK4_skl)|~inertia(X0,sK0_skl(sK3_skl,sK5_skl),X1)|~survival_chance(X0,X2,X1)|~survival_chance(sK5_skl,X3,sK4_skl)|greater(X3,X2))),
% 0.07/0.33    inference(resolution,[status(thm)],[f38,f30])).
% 0.07/0.33  fof(f41,plain,(
% 0.07/0.33    ![X0,X1,X2,X3]: (~organization(X0,X1)|~reorganization_free(X0,X1,X1)|~reorganization_free(sK5_skl,sK4_skl,sK4_skl)|~inertia(X0,sK0_skl(sK3_skl,sK5_skl),X1)|~survival_chance(X0,X2,X1)|~survival_chance(sK5_skl,X3,sK4_skl)|greater(X3,X2))),
% 0.07/0.33    inference(forward_subsumption_resolution,[status(thm)],[f39,f23])).
% 0.07/0.33  fof(f42,plain,(
% 0.07/0.33    ![X0,X1,X2]: (~organization(X0,X1)|~reorganization_free(X0,X1,X1)|~reorganization_free(sK5_skl,sK4_skl,sK4_skl)|~inertia(X0,sK0_skl(sK3_skl,sK5_skl),X1)|~survival_chance(X0,X2,X1)|greater(sK2_skl,X2))),
% 0.07/0.33    inference(resolution,[status(thm)],[f41,f26])).
% 0.07/0.33  fof(f43,plain,(
% 0.07/0.33    ![X0]: (~organization(sK5_skl,sK3_skl)|~reorganization_free(sK5_skl,sK3_skl,sK3_skl)|~reorganization_free(sK5_skl,sK4_skl,sK4_skl)|~survival_chance(sK5_skl,X0,sK3_skl)|greater(sK2_skl,X0)|~organization(sK5_skl,sK3_skl))),
% 0.07/0.33    inference(resolution,[status(thm)],[f42,f12])).
% 0.07/0.33  fof(f44,plain,(
% 0.07/0.33    ![X0]: (~organization(sK5_skl,sK3_skl)|~reorganization_free(sK5_skl,sK3_skl,sK3_skl)|~reorganization_free(sK5_skl,sK4_skl,sK4_skl)|~survival_chance(sK5_skl,X0,sK3_skl)|greater(sK2_skl,X0))),
% 0.07/0.33    inference(duplicate_literals_removal,[status(thm)],[f43])).
% 0.07/0.33  fof(f45,plain,(
% 0.07/0.33    ![X0]: (~reorganization_free(sK5_skl,sK3_skl,sK3_skl)|~reorganization_free(sK5_skl,sK4_skl,sK4_skl)|~survival_chance(sK5_skl,X0,sK3_skl)|greater(sK2_skl,X0))),
% 0.07/0.33    inference(forward_subsumption_resolution,[status(thm)],[f44,f22])).
% 0.07/0.33  fof(f46,plain,(
% 0.07/0.33    ~reorganization_free(sK5_skl,sK3_skl,sK3_skl)|~reorganization_free(sK5_skl,sK4_skl,sK4_skl)|greater(sK2_skl,sK1_skl)),
% 0.07/0.33    inference(resolution,[status(thm)],[f45,f25])).
% 0.07/0.33  fof(f47,plain,(
% 0.07/0.33    ~reorganization_free(sK5_skl,sK3_skl,sK3_skl)|~reorganization_free(sK5_skl,sK4_skl,sK4_skl)),
% 0.07/0.33    inference(forward_subsumption_resolution,[status(thm)],[f46,f28])).
% 0.07/0.33  fof(f48,plain,(
% 0.07/0.33    ![X0]: (~reorganization_free(sK5_skl,sK3_skl,sK3_skl)|~reorganization_free(sK5_skl,X0,sK4_skl))),
% 0.07/0.33    inference(resolution,[status(thm)],[f47,f9])).
% 0.07/0.33  fof(f51,plain,(
% 0.07/0.33    ![X0,X1]: (~reorganization_free(sK5_skl,X0,sK4_skl)|~reorganization_free(sK5_skl,sK3_skl,X1))),
% 0.07/0.33    inference(resolution,[status(thm)],[f48,f8])).
% 0.07/0.33  fof(f54,plain,(
% 0.07/0.33    ![X0]: (~reorganization_free(sK5_skl,X0,sK4_skl))),
% 0.07/0.33    inference(resolution,[status(thm)],[f51,f24])).
% 0.07/0.33  fof(f58,plain,(
% 0.07/0.33    $false),
% 0.07/0.33    inference(backward_subsumption_resolution,[status(thm)],[f24,f54])).
% 0.07/0.33  % SZS output end CNFRefutation for theBenchmark.p
% 0.07/0.34  % Elapsed time: 0.034405 seconds
% 0.07/0.34  % CPU time: 0.083456 seconds
% 0.07/0.34  % Total memory used: 56.098 MB
% 0.07/0.34  % Net memory used: 55.620 MB
%------------------------------------------------------------------------------