TSTP Solution File: MGT041+2 by PyRes---1.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : PyRes---1.3
% Problem : MGT041+2 : TPTP v8.1.0. 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 : 600s
% DateTime : Sun Jul 17 22:23:28 EDT 2022
% Result : Theorem 0.20s 0.53s
% Output : Refutation 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : MGT041+2 : TPTP v8.1.0. Released v2.0.0.
% 0.03/0.13 % Command : pyres-fof.py -tifbsVp -nlargest -HPickGiven5 %s
% 0.13/0.34 % Computer : n027.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Thu Jun 9 08:12:12 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.20/0.53 # Version: 1.3
% 0.20/0.53 # SZS status Theorem
% 0.20/0.53 # SZS output start CNFRefutation
% 0.20/0.53 fof(a16,plain,(?[X]:(?[T]:(((organisation_at_time(X,T)&founding_time(X,T))&number_of_routines(X,T,high))&(~has_elaborated_routines(X,T))))),input).
% 0.20/0.53 fof(c7,plain,(?[X]:(?[T]:(((organisation_at_time(X,T)&founding_time(X,T))&number_of_routines(X,T,high))&~has_elaborated_routines(X,T)))),inference(fof_simplification,status(thm),[a16])).
% 0.20/0.53 fof(c8,plain,(?[X4]:(?[X5]:(((organisation_at_time(X4,X5)&founding_time(X4,X5))&number_of_routines(X4,X5,high))&~has_elaborated_routines(X4,X5)))),inference(variable_rename,status(thm),[c7])).
% 0.20/0.53 fof(c9,plain,(((organisation_at_time(skolem0001,skolem0002)&founding_time(skolem0001,skolem0002))&number_of_routines(skolem0001,skolem0002,high))&~has_elaborated_routines(skolem0001,skolem0002)),inference(skolemize,status(esa),[c8])).
% 0.20/0.53 cnf(c12,plain,number_of_routines(skolem0001,skolem0002,high),inference(split_conjunct,status(thm),[c9])).
% 0.20/0.53 fof(mp_not_high_and_low,axiom,(![X]:(![T]:(~(number_of_routines(X,T,low)&number_of_routines(X,T,high))))),input).
% 0.20/0.53 fof(c20,axiom,(![X]:(![T]:(~number_of_routines(X,T,low)|~number_of_routines(X,T,high)))),inference(fof_nnf,status(thm),[mp_not_high_and_low])).
% 0.20/0.53 fof(c21,axiom,(![X10]:(![X11]:(~number_of_routines(X10,X11,low)|~number_of_routines(X10,X11,high)))),inference(variable_rename,status(thm),[c20])).
% 0.20/0.53 cnf(c22,axiom,~number_of_routines(X17,X16,low)|~number_of_routines(X17,X16,high),inference(split_conjunct,status(thm),[c21])).
% 0.20/0.53 cnf(c25,plain,~number_of_routines(skolem0001,skolem0002,low),inference(resolution,status(thm),[c22, c12])).
% 0.20/0.53 cnf(c13,plain,~has_elaborated_routines(skolem0001,skolem0002),inference(split_conjunct,status(thm),[c9])).
% 0.20/0.53 cnf(c10,plain,organisation_at_time(skolem0001,skolem0002),inference(split_conjunct,status(thm),[c9])).
% 0.20/0.53 fof(prove_t10,conjecture,(?[X]:(?[T]:((organisation_at_time(X,T)&(~first_mover(X)))&(~efficient_producer(X))))),input).
% 0.20/0.53 fof(c0,negated_conjecture,(~(?[X]:(?[T]:((organisation_at_time(X,T)&(~first_mover(X)))&(~efficient_producer(X)))))),inference(assume_negation,status(cth),[prove_t10])).
% 0.20/0.53 fof(c1,negated_conjecture,(~(?[X]:(?[T]:((organisation_at_time(X,T)&~first_mover(X))&~efficient_producer(X))))),inference(fof_simplification,status(thm),[c0])).
% 0.20/0.53 fof(c2,negated_conjecture,(![X]:(![T]:((~organisation_at_time(X,T)|first_mover(X))|efficient_producer(X)))),inference(fof_nnf,status(thm),[c1])).
% 0.20/0.53 fof(c3,negated_conjecture,(![X]:(((![T]:~organisation_at_time(X,T))|first_mover(X))|efficient_producer(X))),inference(shift_quantors,status(thm),[c2])).
% 0.20/0.53 fof(c5,negated_conjecture,(![X2]:(![X3]:((~organisation_at_time(X2,X3)|first_mover(X2))|efficient_producer(X2)))),inference(shift_quantors,status(thm),[fof(c4,negated_conjecture,(![X2]:(((![X3]:~organisation_at_time(X2,X3))|first_mover(X2))|efficient_producer(X2))),inference(variable_rename,status(thm),[c3])).])).
% 0.20/0.53 cnf(c6,negated_conjecture,~organisation_at_time(X13,X12)|first_mover(X13)|efficient_producer(X13),inference(split_conjunct,status(thm),[c5])).
% 0.20/0.53 cnf(c23,plain,first_mover(skolem0001)|efficient_producer(skolem0001),inference(resolution,status(thm),[c6, c10])).
% 0.20/0.53 cnf(c11,plain,founding_time(skolem0001,skolem0002),inference(split_conjunct,status(thm),[c9])).
% 0.20/0.53 fof(a14,plain,(![X]:(![T]:(((organisation_at_time(X,T)&efficient_producer(X))&founding_time(X,T))=>has_elaborated_routines(X,T)))),input).
% 0.20/0.53 fof(c17,plain,(![X]:(![T]:(((~organisation_at_time(X,T)|~efficient_producer(X))|~founding_time(X,T))|has_elaborated_routines(X,T)))),inference(fof_nnf,status(thm),[a14])).
% 0.20/0.53 fof(c18,plain,(![X8]:(![X9]:(((~organisation_at_time(X8,X9)|~efficient_producer(X8))|~founding_time(X8,X9))|has_elaborated_routines(X8,X9)))),inference(variable_rename,status(thm),[c17])).
% 0.20/0.53 cnf(c19,plain,~organisation_at_time(X19,X18)|~efficient_producer(X19)|~founding_time(X19,X18)|has_elaborated_routines(X19,X18),inference(split_conjunct,status(thm),[c18])).
% 0.20/0.53 cnf(c26,plain,~organisation_at_time(skolem0001,skolem0002)|~efficient_producer(skolem0001)|has_elaborated_routines(skolem0001,skolem0002),inference(resolution,status(thm),[c19, c11])).
% 0.20/0.53 cnf(c27,plain,~efficient_producer(skolem0001)|has_elaborated_routines(skolem0001,skolem0002),inference(resolution,status(thm),[c26, c10])).
% 0.20/0.53 cnf(c29,plain,has_elaborated_routines(skolem0001,skolem0002)|first_mover(skolem0001),inference(resolution,status(thm),[c27, c23])).
% 0.20/0.53 cnf(c30,plain,first_mover(skolem0001),inference(resolution,status(thm),[c29, c13])).
% 0.20/0.53 fof(a15,plain,(![X]:(![T]:(((organisation_at_time(X,T)&first_mover(X))&founding_time(X,T))=>number_of_routines(X,T,low)))),input).
% 0.20/0.53 fof(c14,plain,(![X]:(![T]:(((~organisation_at_time(X,T)|~first_mover(X))|~founding_time(X,T))|number_of_routines(X,T,low)))),inference(fof_nnf,status(thm),[a15])).
% 0.20/0.53 fof(c15,plain,(![X6]:(![X7]:(((~organisation_at_time(X6,X7)|~first_mover(X6))|~founding_time(X6,X7))|number_of_routines(X6,X7,low)))),inference(variable_rename,status(thm),[c14])).
% 0.20/0.53 cnf(c16,plain,~organisation_at_time(X14,X15)|~first_mover(X14)|~founding_time(X14,X15)|number_of_routines(X14,X15,low),inference(split_conjunct,status(thm),[c15])).
% 0.20/0.53 cnf(c24,plain,~organisation_at_time(skolem0001,skolem0002)|~first_mover(skolem0001)|number_of_routines(skolem0001,skolem0002,low),inference(resolution,status(thm),[c16, c11])).
% 0.20/0.53 cnf(c28,plain,~first_mover(skolem0001)|number_of_routines(skolem0001,skolem0002,low),inference(resolution,status(thm),[c24, c10])).
% 0.20/0.53 cnf(c31,plain,number_of_routines(skolem0001,skolem0002,low),inference(resolution,status(thm),[c28, c30])).
% 0.20/0.53 cnf(c32,plain,$false,inference(resolution,status(thm),[c31, c25])).
% 0.20/0.53 # SZS output end CNFRefutation
% 0.20/0.53
% 0.20/0.53 # Initial clauses : 8
% 0.20/0.53 # Processed clauses : 17
% 0.20/0.53 # Factors computed : 0
% 0.20/0.53 # Resolvents computed: 10
% 0.20/0.53 # Tautologies deleted: 0
% 0.20/0.53 # Forward subsumed : 0
% 0.20/0.53 # Backward subsumed : 5
% 0.20/0.53 # -------- CPU Time ---------
% 0.20/0.53 # User time : 0.173 s
% 0.20/0.53 # System time : 0.016 s
% 0.20/0.53 # Total time : 0.189 s
%------------------------------------------------------------------------------