TSTP Solution File: MGT052+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : MGT052+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% 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:06:49 EDT 2022
% Result : Theorem 7.09s 2.23s
% Output : CNFRefutation 7.09s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 3
% Syntax : Number of clauses : 8 ( 4 unt; 2 nHn; 8 RR)
% Number of literals : 16 ( 0 equ; 9 neg)
% Maximal clause size : 3 ( 2 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 12 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_5,plain,
( ~ is_aligned(X1,X2)
| ~ is_aligned(X1,X3)
| ~ dissimilar(X1,X3,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-vju4jwoq/lgb.p',i_0_5) ).
cnf(i_0_1,negated_conjecture,
dissimilar(esk1_0,esk2_0,esk2_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-vju4jwoq/lgb.p',i_0_1) ).
cnf(i_0_4,plain,
( is_aligned(X1,X2)
| is_aligned(X1,X3)
| ~ dissimilar(X1,X3,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-vju4jwoq/lgb.p',i_0_4) ).
cnf(c_0_9,plain,
( ~ is_aligned(X1,X2)
| ~ is_aligned(X1,X3)
| ~ dissimilar(X1,X3,X2) ),
i_0_5 ).
cnf(c_0_10,negated_conjecture,
dissimilar(esk1_0,esk2_0,esk2_0),
i_0_1 ).
cnf(c_0_11,plain,
( is_aligned(X1,X2)
| is_aligned(X1,X3)
| ~ dissimilar(X1,X3,X2) ),
i_0_4 ).
cnf(c_0_12,negated_conjecture,
~ is_aligned(esk1_0,esk2_0),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_13,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_10]),c_0_12]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : MGT052+1 : TPTP v8.1.0. Released v2.4.0.
% 0.03/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.32 % Computer : n028.cluster.edu
% 0.12/0.32 % Model : x86_64 x86_64
% 0.12/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.32 % Memory : 8042.1875MB
% 0.12/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.32 % CPULimit : 300
% 0.12/0.32 % WCLimit : 600
% 0.12/0.32 % DateTime : Thu Jun 9 11:45:49 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.43 # ENIGMATIC: Selected SinE mode:
% 0.18/0.44 # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.18/0.44 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.18/0.44 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.18/0.44 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 7.09/2.23 # ENIGMATIC: Solved by autoschedule-lgb:
% 7.09/2.23 # No SInE strategy applied
% 7.09/2.23 # Trying AutoSched0 for 150 seconds
% 7.09/2.23 # AutoSched0-Mode selected heuristic G_E___200_B07_F1_AE_CS_SP_PI_S0Y
% 7.09/2.23 # and selection function SelectMaxLComplexAvoidPosPred.
% 7.09/2.23 #
% 7.09/2.23 # Preprocessing time : 0.018 s
% 7.09/2.23
% 7.09/2.23 # Proof found!
% 7.09/2.23 # SZS status Theorem
% 7.09/2.23 # SZS output start CNFRefutation
% See solution above
% 7.09/2.23 # Training examples: 0 positive, 0 negative
% 7.09/2.23
% 7.09/2.23 # -------------------------------------------------
% 7.09/2.23 # User time : 0.022 s
% 7.09/2.23 # System time : 0.000 s
% 7.09/2.23 # Total time : 0.022 s
% 7.09/2.23 # Maximum resident set size: 7124 pages
% 7.09/2.23
%------------------------------------------------------------------------------