TSTP Solution File: MGT049+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : MGT049+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n018.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:06:49 EDT 2022
% Result : Theorem 7.50s 2.27s
% Output : CNFRefutation 7.50s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 3
% Syntax : Number of formulae : 14 ( 4 unt; 0 def)
% Number of atoms : 35 ( 15 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 33 ( 12 ~; 9 |; 6 &)
% ( 0 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 29 ( 6 sgn 18 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(assumption_6,axiom,
! [X1,X4,X5] :
( organization(X1)
=> ( ( greater(external_ties(X1,X5),external_ties(X1,X4))
=> greater(position(X1,X5),position(X1,X4)) )
& ( external_ties(X1,X5) = external_ties(X1,X4)
=> position(X1,X5) = position(X1,X4) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',assumption_6) ).
fof(assumption_11,axiom,
! [X1,X4,X5] :
( organization(X1)
=> external_ties(X1,X5) = external_ties(X1,X4) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',assumption_11) ).
fof(lemma_6,conjecture,
! [X1,X4,X5] :
( ( organization(X1)
& greater(age(X1,X5),age(X1,X4)) )
=> position(X1,X5) = position(X1,X4) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',lemma_6) ).
fof(c_0_3,plain,
! [X19,X20,X21] :
( ( ~ greater(external_ties(X19,X21),external_ties(X19,X20))
| greater(position(X19,X21),position(X19,X20))
| ~ organization(X19) )
& ( external_ties(X19,X21) != external_ties(X19,X20)
| position(X19,X21) = position(X19,X20)
| ~ organization(X19) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[assumption_6])])]) ).
fof(c_0_4,plain,
! [X22,X23,X24] :
( ~ organization(X22)
| external_ties(X22,X24) = external_ties(X22,X23) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[assumption_11])]) ).
fof(c_0_5,negated_conjecture,
~ ! [X1,X4,X5] :
( ( organization(X1)
& greater(age(X1,X5),age(X1,X4)) )
=> position(X1,X5) = position(X1,X4) ),
inference(assume_negation,[status(cth)],[lemma_6]) ).
cnf(c_0_6,plain,
( position(X1,X2) = position(X1,X3)
| external_ties(X1,X2) != external_ties(X1,X3)
| ~ organization(X1) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_7,plain,
( external_ties(X1,X2) = external_ties(X1,X3)
| ~ organization(X1) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
fof(c_0_8,negated_conjecture,
( organization(esk1_0)
& greater(age(esk1_0,esk3_0),age(esk1_0,esk2_0))
& position(esk1_0,esk3_0) != position(esk1_0,esk2_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])]) ).
cnf(c_0_9,plain,
( position(X1,X2) = position(X1,X3)
| ~ organization(X1) ),
inference(csr,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_10,negated_conjecture,
organization(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_11,negated_conjecture,
position(esk1_0,esk3_0) != position(esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_12,negated_conjecture,
position(esk1_0,X1) = position(esk1_0,X2),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_13,negated_conjecture,
$false,
inference(sr,[status(thm)],[c_0_11,c_0_12]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : MGT049+1 : TPTP v8.1.0. Released v2.4.0.
% 0.11/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n018.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Thu Jun 9 10:41:25 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.19/0.45 # ENIGMATIC: Selected SinE mode:
% 0.19/0.45 # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.45 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.19/0.45 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.19/0.45 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 7.50/2.27 # ENIGMATIC: Solved by autoschedule:
% 7.50/2.27 # No SInE strategy applied
% 7.50/2.27 # Trying AutoSched0 for 150 seconds
% 7.50/2.27 # AutoSched0-Mode selected heuristic G_E___302_C18_F1_URBAN_S0Y
% 7.50/2.27 # and selection function SelectMaxLComplexAvoidPosPred.
% 7.50/2.27 #
% 7.50/2.27 # Preprocessing time : 0.013 s
% 7.50/2.27
% 7.50/2.27 # Proof found!
% 7.50/2.27 # SZS status Theorem
% 7.50/2.27 # SZS output start CNFRefutation
% See solution above
% 7.50/2.27 # Training examples: 0 positive, 0 negative
% 7.50/2.27
% 7.50/2.27 # -------------------------------------------------
% 7.50/2.27 # User time : 0.015 s
% 7.50/2.27 # System time : 0.004 s
% 7.50/2.27 # Total time : 0.019 s
% 7.50/2.27 # Maximum resident set size: 7120 pages
% 7.50/2.27
%------------------------------------------------------------------------------