TSTP Solution File: MGT003+1 by PyRes---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : PyRes---1.5
% Problem : MGT003+1 : TPTP v8.1.2. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : pyres-fof.py -tifbsVp -nlargest -HPickGiven5 %s
% Computer : n027.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Thu May 9 17:33:00 EDT 2024
% Result : Theorem 0.40s 0.60s
% Output : Refutation 0.40s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : MGT003+1 : TPTP v8.1.2. Released v2.0.0.
% 0.07/0.13 % Command : pyres-fof.py -tifbsVp -nlargest -HPickGiven5 %s
% 0.14/0.34 % Computer : n027.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Thu May 9 01:01:38 EDT 2024
% 0.14/0.34 % CPUTime :
% 0.40/0.60 % Version: 1.5
% 0.40/0.60 % SZS status Theorem
% 0.40/0.60 % SZS output start CNFRefutation
% 0.40/0.60 fof(t3_FOL,conjecture,(![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))))))),file('/export/starexec/sandbox2/benchmark/theBenchmark.p', t3_FOL)).
% 0.40/0.60 fof(c0,negated_conjecture,(~(![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)))))))),inference(assume_negation,[status(cth)],[t3_FOL])).
% 0.40/0.60 fof(c1,negated_conjecture,(?[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))))))),inference(fof_nnf,[status(thm)],[c0])).
% 0.40/0.60 fof(c2,negated_conjecture,(?[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))))),inference(shift_quantors,[status(thm)],[c1])).
% 0.40/0.60 fof(c3,negated_conjecture,(?[X2]:(?[X3]:(?[X4]:((?[X5]:(?[X6]:(((((organization(X2,X5)&organization(X2,X6))&reorganization_free(X2,X5,X6))&survival_chance(X2,X3,X5))&survival_chance(X2,X4,X6))&greater(X6,X5))))&~greater(X4,X3))))),inference(variable_rename,[status(thm)],[c2])).
% 0.40/0.60 fof(c4,negated_conjecture,((((((organization(skolem0001,skolem0004)&organization(skolem0001,skolem0005))&reorganization_free(skolem0001,skolem0004,skolem0005))&survival_chance(skolem0001,skolem0002,skolem0004))&survival_chance(skolem0001,skolem0003,skolem0005))&greater(skolem0005,skolem0004))&~greater(skolem0003,skolem0002)),inference(skolemize,[status(esa)],[c3])).
% 0.40/0.60 cnf(c11,negated_conjecture,~greater(skolem0003,skolem0002),inference(split_conjunct,[status(thm)],[c4])).
% 0.40/0.60 cnf(c5,negated_conjecture,organization(skolem0001,skolem0004),inference(split_conjunct,[status(thm)],[c4])).
% 0.40/0.60 cnf(c6,negated_conjecture,organization(skolem0001,skolem0005),inference(split_conjunct,[status(thm)],[c4])).
% 0.40/0.60 cnf(c7,negated_conjecture,reorganization_free(skolem0001,skolem0004,skolem0005),inference(split_conjunct,[status(thm)],[c4])).
% 0.40/0.60 fof(mp4,axiom,(![X]:(![T1]:(![T2]:(reorganization_free(X,T1,T2)=>(reorganization_free(X,T1,T1)&reorganization_free(X,T2,T2)))))),file('/export/starexec/sandbox2/benchmark/theBenchmark.p', mp4)).
% 0.40/0.60 fof(c24,plain,(![X]:(![T1]:(![T2]:(~reorganization_free(X,T1,T2)|(reorganization_free(X,T1,T1)&reorganization_free(X,T2,T2)))))),inference(fof_nnf,[status(thm)],[mp4])).
% 0.40/0.60 fof(c25,plain,(![X23]:(![X24]:(![X25]:(~reorganization_free(X23,X24,X25)|(reorganization_free(X23,X24,X24)&reorganization_free(X23,X25,X25)))))),inference(variable_rename,[status(thm)],[c24])).
% 0.40/0.60 fof(c26,plain,(![X23]:(![X24]:(![X25]:((~reorganization_free(X23,X24,X25)|reorganization_free(X23,X24,X24))&(~reorganization_free(X23,X24,X25)|reorganization_free(X23,X25,X25)))))),inference(distribute,[status(thm)],[c25])).
% 0.40/0.60 cnf(c27,plain,~reorganization_free(X27,X28,X26)|reorganization_free(X27,X28,X28),inference(split_conjunct,[status(thm)],[c26])).
% 0.40/0.60 cnf(c29,plain,reorganization_free(skolem0001,skolem0004,skolem0004),inference(resolution,[status(thm)],[c27, c7])).
% 0.40/0.60 cnf(c28,plain,~reorganization_free(X30,X31,X29)|reorganization_free(X30,X29,X29),inference(split_conjunct,[status(thm)],[c26])).
% 0.40/0.60 cnf(c32,plain,reorganization_free(skolem0001,skolem0005,skolem0005),inference(resolution,[status(thm)],[c28, c7])).
% 0.40/0.60 fof(mp5,axiom,(![X]:(![T]:(organization(X,T)=>(?[I]:inertia(X,I,T))))),file('/export/starexec/sandbox2/benchmark/theBenchmark.p', mp5)).
% 0.40/0.60 fof(c20,plain,(![X]:(![T]:(~organization(X,T)|(?[I]:inertia(X,I,T))))),inference(fof_nnf,[status(thm)],[mp5])).
% 0.40/0.60 fof(c21,plain,(![X20]:(![X21]:(~organization(X20,X21)|(?[X22]:inertia(X20,X22,X21))))),inference(variable_rename,[status(thm)],[c20])).
% 0.40/0.60 fof(c22,plain,(![X20]:(![X21]:(~organization(X20,X21)|inertia(X20,skolem0006(X20,X21),X21)))),inference(skolemize,[status(esa)],[c21])).
% 0.40/0.60 cnf(c23,plain,~organization(X37,X38)|inertia(X37,skolem0006(X37,X38),X38),inference(split_conjunct,[status(thm)],[c22])).
% 0.40/0.60 cnf(c37,plain,inertia(skolem0001,skolem0006(skolem0001,skolem0004),skolem0004),inference(resolution,[status(thm)],[c23, c5])).
% 0.40/0.60 cnf(c10,negated_conjecture,greater(skolem0005,skolem0004),inference(split_conjunct,[status(thm)],[c4])).
% 0.40/0.60 fof(t2_FOL,plain,(![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))))))),file('/export/starexec/sandbox2/benchmark/theBenchmark.p', t2_FOL)).
% 0.40/0.60 fof(c12,plain,(![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))))))),inference(fof_nnf,[status(thm)],[t2_FOL])).
% 0.40/0.60 fof(c13,plain,(![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))))),inference(shift_quantors,[status(thm)],[c12])).
% 0.40/0.60 fof(c15,plain,(![X7]:(![X8]:(![X9]:(![X10]:(![X11]:((((((~organization(X7,X10)|~organization(X7,X11))|~reorganization_free(X7,X10,X11))|~inertia(X7,X8,X10))|~inertia(X7,X9,X11))|~greater(X11,X10))|greater(X9,X8))))))),inference(shift_quantors,[status(thm)],[fof(c14,plain,(![X7]:(![X8]:(![X9]:((![X10]:(![X11]:(((((~organization(X7,X10)|~organization(X7,X11))|~reorganization_free(X7,X10,X11))|~inertia(X7,X8,X10))|~inertia(X7,X9,X11))|~greater(X11,X10))))|greater(X9,X8))))),inference(variable_rename,[status(thm)],[c13])).])).
% 0.40/0.60 cnf(c16,plain,~organization(X36,X32)|~organization(X36,X35)|~reorganization_free(X36,X32,X35)|~inertia(X36,X33,X32)|~inertia(X36,X34,X35)|~greater(X35,X32)|greater(X34,X33),inference(split_conjunct,[status(thm)],[c15])).
% 0.40/0.60 cnf(c36,plain,inertia(skolem0001,skolem0006(skolem0001,skolem0005),skolem0005),inference(resolution,[status(thm)],[c23, c6])).
% 0.40/0.60 cnf(c41,plain,~organization(skolem0001,X60)|~organization(skolem0001,skolem0005)|~reorganization_free(skolem0001,X60,skolem0005)|~inertia(skolem0001,X61,X60)|~greater(skolem0005,X60)|greater(skolem0006(skolem0001,skolem0005),X61),inference(resolution,[status(thm)],[c36, c16])).
% 0.40/0.60 cnf(c51,plain,~organization(skolem0001,skolem0004)|~organization(skolem0001,skolem0005)|~reorganization_free(skolem0001,skolem0004,skolem0005)|~greater(skolem0005,skolem0004)|greater(skolem0006(skolem0001,skolem0005),skolem0006(skolem0001,skolem0004)),inference(resolution,[status(thm)],[c41, c37])).
% 0.40/0.60 cnf(c64,plain,~organization(skolem0001,skolem0004)|~organization(skolem0001,skolem0005)|~greater(skolem0005,skolem0004)|greater(skolem0006(skolem0001,skolem0005),skolem0006(skolem0001,skolem0004)),inference(resolution,[status(thm)],[c51, c7])).
% 0.40/0.60 cnf(c65,plain,~organization(skolem0001,skolem0004)|~organization(skolem0001,skolem0005)|greater(skolem0006(skolem0001,skolem0005),skolem0006(skolem0001,skolem0004)),inference(resolution,[status(thm)],[c64, c10])).
% 0.40/0.60 cnf(c66,plain,~organization(skolem0001,skolem0004)|greater(skolem0006(skolem0001,skolem0005),skolem0006(skolem0001,skolem0004)),inference(resolution,[status(thm)],[c65, c6])).
% 0.40/0.60 cnf(c67,plain,greater(skolem0006(skolem0001,skolem0005),skolem0006(skolem0001,skolem0004)),inference(resolution,[status(thm)],[c66, c5])).
% 0.40/0.60 cnf(c8,negated_conjecture,survival_chance(skolem0001,skolem0002,skolem0004),inference(split_conjunct,[status(thm)],[c4])).
% 0.40/0.60 cnf(c9,negated_conjecture,survival_chance(skolem0001,skolem0003,skolem0005),inference(split_conjunct,[status(thm)],[c4])).
% 0.40/0.60 fof(t1_FOL,plain,(![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)))))))))),file('/export/starexec/sandbox2/benchmark/theBenchmark.p', t1_FOL)).
% 0.40/0.60 fof(c17,plain,(![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)))))))))),inference(fof_nnf,[status(thm)],[t1_FOL])).
% 0.40/0.60 fof(c18,plain,(![X12]:(![X13]:(![X14]:(![X15]:(![X16]:(![X17]:(![X18]:(![X19]:(((((((((~organization(X12,X14)|~organization(X13,X15))|~reorganization_free(X12,X14,X14))|~reorganization_free(X13,X15,X15))|~inertia(X12,X16,X14))|~inertia(X13,X17,X15))|~survival_chance(X12,X18,X14))|~survival_chance(X13,X19,X15))|~greater(X17,X16))|greater(X19,X18)))))))))),inference(variable_rename,[status(thm)],[c17])).
% 0.40/0.60 cnf(c19,plain,~organization(X44,X39)|~organization(X40,X43)|~reorganization_free(X44,X39,X39)|~reorganization_free(X40,X43,X43)|~inertia(X44,X42,X39)|~inertia(X40,X46,X43)|~survival_chance(X44,X45,X39)|~survival_chance(X40,X41,X43)|~greater(X46,X42)|greater(X41,X45),inference(split_conjunct,[status(thm)],[c18])).
% 0.40/0.60 cnf(c40,plain,~organization(X63,X66)|~organization(skolem0001,skolem0005)|~reorganization_free(X63,X66,X66)|~reorganization_free(skolem0001,skolem0005,skolem0005)|~inertia(X63,X62,X66)|~inertia(skolem0001,X64,skolem0005)|~survival_chance(X63,X65,X66)|~greater(X64,X62)|greater(skolem0003,X65),inference(resolution,[status(thm)],[c19, c9])).
% 0.40/0.60 cnf(c53,plain,~organization(skolem0001,skolem0004)|~organization(skolem0001,skolem0005)|~reorganization_free(skolem0001,skolem0004,skolem0004)|~reorganization_free(skolem0001,skolem0005,skolem0005)|~inertia(skolem0001,X84,skolem0004)|~inertia(skolem0001,X83,skolem0005)|~greater(X83,X84)|greater(skolem0003,skolem0002),inference(resolution,[status(thm)],[c40, c8])).
% 0.40/0.60 cnf(c68,plain,~organization(skolem0001,skolem0004)|~organization(skolem0001,skolem0005)|~reorganization_free(skolem0001,skolem0004,skolem0004)|~reorganization_free(skolem0001,skolem0005,skolem0005)|~inertia(skolem0001,X86,skolem0004)|~greater(skolem0006(skolem0001,skolem0005),X86)|greater(skolem0003,skolem0002),inference(resolution,[status(thm)],[c53, c36])).
% 0.40/0.60 cnf(c70,plain,~organization(skolem0001,skolem0004)|~organization(skolem0001,skolem0005)|~reorganization_free(skolem0001,skolem0004,skolem0004)|~reorganization_free(skolem0001,skolem0005,skolem0005)|~inertia(skolem0001,skolem0006(skolem0001,skolem0004),skolem0004)|greater(skolem0003,skolem0002),inference(resolution,[status(thm)],[c68, c67])).
% 0.40/0.60 cnf(c71,plain,~organization(skolem0001,skolem0004)|~organization(skolem0001,skolem0005)|~reorganization_free(skolem0001,skolem0004,skolem0004)|~reorganization_free(skolem0001,skolem0005,skolem0005)|greater(skolem0003,skolem0002),inference(resolution,[status(thm)],[c70, c37])).
% 0.40/0.60 cnf(c72,plain,~organization(skolem0001,skolem0004)|~organization(skolem0001,skolem0005)|~reorganization_free(skolem0001,skolem0004,skolem0004)|greater(skolem0003,skolem0002),inference(resolution,[status(thm)],[c71, c32])).
% 0.40/0.60 cnf(c73,plain,~organization(skolem0001,skolem0004)|~organization(skolem0001,skolem0005)|greater(skolem0003,skolem0002),inference(resolution,[status(thm)],[c72, c29])).
% 0.40/0.60 cnf(c74,plain,~organization(skolem0001,skolem0004)|greater(skolem0003,skolem0002),inference(resolution,[status(thm)],[c73, c6])).
% 0.40/0.60 cnf(c75,plain,greater(skolem0003,skolem0002),inference(resolution,[status(thm)],[c74, c5])).
% 0.40/0.60 cnf(c76,plain,$false,inference(resolution,[status(thm)],[c75, c11])).
% 0.40/0.60 % SZS output end CNFRefutation
% 0.40/0.60
% 0.40/0.60 % Initial clauses : 12
% 0.40/0.60 % Processed clauses : 51
% 0.40/0.60 % Factors computed : 4
% 0.40/0.60 % Resolvents computed: 44
% 0.40/0.60 % Tautologies deleted: 0
% 0.40/0.60 % Forward subsumed : 8
% 0.40/0.60 % Backward subsumed : 13
% 0.40/0.60 % -------- CPU Time ---------
% 0.40/0.60 % User time : 0.244 s
% 0.40/0.60 % System time : 0.014 s
% 0.40/0.60 % Total time : 0.258 s
%------------------------------------------------------------------------------