TSTP Solution File: MGT041+2 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : MGT041+2 : TPTP v8.1.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n028.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:10:11 EDT 2022
% Result : Theorem 0.23s 1.41s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 5
% Syntax : Number of formulae : 25 ( 8 unt; 0 def)
% Number of atoms : 62 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 66 ( 29 ~; 20 |; 15 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 7 ( 6 usr; 1 prp; 0-3 aty)
% Number of functors : 4 ( 4 usr; 4 con; 0-0 aty)
% Number of variables : 28 ( 1 sgn 14 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(prove_t10,conjecture,
? [X1,X2] :
( organisation_at_time(X1,X2)
& ~ first_mover(X1)
& ~ efficient_producer(X1) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',prove_t10) ).
fof(a16,hypothesis,
? [X1,X2] :
( organisation_at_time(X1,X2)
& founding_time(X1,X2)
& number_of_routines(X1,X2,high)
& ~ has_elaborated_routines(X1,X2) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',a16) ).
fof(a14,hypothesis,
! [X1,X2] :
( ( organisation_at_time(X1,X2)
& efficient_producer(X1)
& founding_time(X1,X2) )
=> has_elaborated_routines(X1,X2) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',a14) ).
fof(a15,hypothesis,
! [X1,X2] :
( ( organisation_at_time(X1,X2)
& first_mover(X1)
& founding_time(X1,X2) )
=> number_of_routines(X1,X2,low) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',a15) ).
fof(mp_not_high_and_low,axiom,
! [X1,X2] :
~ ( number_of_routines(X1,X2,low)
& number_of_routines(X1,X2,high) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mp_not_high_and_low) ).
fof(c_0_5,negated_conjecture,
~ ? [X1,X2] :
( organisation_at_time(X1,X2)
& ~ first_mover(X1)
& ~ efficient_producer(X1) ),
inference(assume_negation,[status(cth)],[prove_t10]) ).
fof(c_0_6,negated_conjecture,
! [X3,X4] :
( ~ organisation_at_time(X3,X4)
| first_mover(X3)
| efficient_producer(X3) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[c_0_5])])])])]) ).
fof(c_0_7,hypothesis,
( organisation_at_time(esk1_0,esk2_0)
& founding_time(esk1_0,esk2_0)
& number_of_routines(esk1_0,esk2_0,high)
& ~ has_elaborated_routines(esk1_0,esk2_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_simplification,[status(thm)],[a16])])]) ).
fof(c_0_8,hypothesis,
! [X3,X4] :
( ~ organisation_at_time(X3,X4)
| ~ efficient_producer(X3)
| ~ founding_time(X3,X4)
| has_elaborated_routines(X3,X4) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[a14])]) ).
fof(c_0_9,hypothesis,
! [X3,X4] :
( ~ organisation_at_time(X3,X4)
| ~ first_mover(X3)
| ~ founding_time(X3,X4)
| number_of_routines(X3,X4,low) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[a15])]) ).
cnf(c_0_10,negated_conjecture,
( efficient_producer(X1)
| first_mover(X1)
| ~ organisation_at_time(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_11,hypothesis,
organisation_at_time(esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_12,hypothesis,
~ has_elaborated_routines(esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_13,hypothesis,
( has_elaborated_routines(X1,X2)
| ~ founding_time(X1,X2)
| ~ efficient_producer(X1)
| ~ organisation_at_time(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_14,hypothesis,
founding_time(esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_15,hypothesis,
( number_of_routines(X1,X2,low)
| ~ founding_time(X1,X2)
| ~ first_mover(X1)
| ~ organisation_at_time(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_16,hypothesis,
( first_mover(esk1_0)
| efficient_producer(esk1_0) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_17,hypothesis,
~ efficient_producer(esk1_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_11])]),c_0_14])]) ).
fof(c_0_18,plain,
! [X3,X4] :
( ~ number_of_routines(X3,X4,low)
| ~ number_of_routines(X3,X4,high) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mp_not_high_and_low])]) ).
cnf(c_0_19,hypothesis,
( number_of_routines(esk1_0,esk2_0,low)
| ~ first_mover(esk1_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_14]),c_0_11])]) ).
cnf(c_0_20,hypothesis,
first_mover(esk1_0),
inference(sr,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_21,plain,
( ~ number_of_routines(X1,X2,high)
| ~ number_of_routines(X1,X2,low) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_22,hypothesis,
number_of_routines(esk1_0,esk2_0,low),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_19,c_0_20])]) ).
cnf(c_0_23,hypothesis,
number_of_routines(esk1_0,esk2_0,high),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_24,hypothesis,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : MGT041+2 : TPTP v8.1.0. Released v2.0.0.
% 0.07/0.13 % Command : run_ET %s %d
% 0.14/0.34 % Computer : n028.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 : 600
% 0.14/0.34 % DateTime : Thu Jun 9 08:05:47 EDT 2022
% 0.14/0.34 % CPUTime :
% 0.23/1.41 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.23/1.41 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.23/1.41 # Preprocessing time : 0.014 s
% 0.23/1.41
% 0.23/1.41 # Proof found!
% 0.23/1.41 # SZS status Theorem
% 0.23/1.41 # SZS output start CNFRefutation
% See solution above
% 0.23/1.41 # Proof object total steps : 25
% 0.23/1.41 # Proof object clause steps : 14
% 0.23/1.41 # Proof object formula steps : 11
% 0.23/1.41 # Proof object conjectures : 4
% 0.23/1.41 # Proof object clause conjectures : 1
% 0.23/1.41 # Proof object formula conjectures : 3
% 0.23/1.41 # Proof object initial clauses used : 8
% 0.23/1.41 # Proof object initial formulas used : 5
% 0.23/1.41 # Proof object generating inferences : 4
% 0.23/1.41 # Proof object simplifying inferences : 11
% 0.23/1.41 # Training examples: 0 positive, 0 negative
% 0.23/1.41 # Parsed axioms : 5
% 0.23/1.41 # Removed by relevancy pruning/SinE : 0
% 0.23/1.41 # Initial clauses : 8
% 0.23/1.41 # Removed in clause preprocessing : 0
% 0.23/1.41 # Initial clauses in saturation : 8
% 0.23/1.41 # Processed clauses : 13
% 0.23/1.41 # ...of these trivial : 0
% 0.23/1.41 # ...subsumed : 0
% 0.23/1.41 # ...remaining for further processing : 13
% 0.23/1.41 # Other redundant clauses eliminated : 0
% 0.23/1.41 # Clauses deleted for lack of memory : 0
% 0.23/1.41 # Backward-subsumed : 0
% 0.23/1.41 # Backward-rewritten : 1
% 0.23/1.41 # Generated clauses : 6
% 0.23/1.41 # ...of the previous two non-trivial : 6
% 0.23/1.41 # Contextual simplify-reflections : 0
% 0.23/1.41 # Paramodulations : 5
% 0.23/1.41 # Factorizations : 0
% 0.23/1.41 # Equation resolutions : 0
% 0.23/1.41 # Current number of processed clauses : 11
% 0.23/1.41 # Positive orientable unit clauses : 5
% 0.23/1.41 # Positive unorientable unit clauses: 0
% 0.23/1.41 # Negative unit clauses : 2
% 0.23/1.41 # Non-unit-clauses : 4
% 0.23/1.41 # Current number of unprocessed clauses: 0
% 0.23/1.41 # ...number of literals in the above : 0
% 0.23/1.41 # Current number of archived formulas : 0
% 0.23/1.41 # Current number of archived clauses : 2
% 0.23/1.41 # Clause-clause subsumption calls (NU) : 0
% 0.23/1.41 # Rec. Clause-clause subsumption calls : 0
% 0.23/1.41 # Non-unit clause-clause subsumptions : 0
% 0.23/1.41 # Unit Clause-clause subsumption calls : 6
% 0.23/1.41 # Rewrite failures with RHS unbound : 0
% 0.23/1.41 # BW rewrite match attempts : 2
% 0.23/1.41 # BW rewrite match successes : 1
% 0.23/1.41 # Condensation attempts : 0
% 0.23/1.41 # Condensation successes : 0
% 0.23/1.41 # Termbank termtop insertions : 522
% 0.23/1.41
% 0.23/1.41 # -------------------------------------------------
% 0.23/1.41 # User time : 0.011 s
% 0.23/1.41 # System time : 0.004 s
% 0.23/1.41 # Total time : 0.015 s
% 0.23/1.41 # Maximum resident set size: 2768 pages
%------------------------------------------------------------------------------