TSTP Solution File: MSC019+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : MSC019+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n020.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:39:51 EDT 2022
% Result : Theorem 7.23s 2.38s
% Output : CNFRefutation 7.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 4
% Syntax : Number of clauses : 10 ( 7 unt; 0 nHn; 10 RR)
% Number of literals : 15 ( 0 equ; 7 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 3 con; 0-0 aty)
% Number of variables : 7 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_1,plain,
( s_contains(X1,X2)
| ~ s_contains(X3,X2)
| ~ s_contains(X1,X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-w3j_9tmx/lgb.p',i_0_1) ).
cnf(i_0_575,plain,
s_contains(s_g013,s_MX),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-w3j_9tmx/lgb.p',i_0_575) ).
cnf(i_0_103,plain,
s_contains(s_g019,s_g013),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-w3j_9tmx/lgb.p',i_0_103) ).
cnf(i_0_604,negated_conjecture,
~ s_contains(s_g019,s_MX),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-w3j_9tmx/lgb.p',i_0_604) ).
cnf(c_0_609,plain,
( s_contains(X1,X2)
| ~ s_contains(X3,X2)
| ~ s_contains(X1,X3) ),
i_0_1 ).
cnf(c_0_610,plain,
s_contains(s_g013,s_MX),
i_0_575 ).
cnf(c_0_611,plain,
( s_contains(X1,s_MX)
| ~ s_contains(X1,s_g013) ),
inference(spm,[status(thm)],[c_0_609,c_0_610]) ).
cnf(c_0_612,plain,
s_contains(s_g019,s_g013),
i_0_103 ).
cnf(c_0_613,negated_conjecture,
~ s_contains(s_g019,s_MX),
i_0_604 ).
cnf(c_0_614,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_611,c_0_612]),c_0_613]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : MSC019+1 : TPTP v8.1.0. Released v4.0.0.
% 0.06/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.34 % Computer : n020.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 : Fri Jul 1 15:51:47 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.19/0.45 # ENIGMATIC: Selected SinE mode:
% 0.19/0.46 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.46 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.19/0.46 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.19/0.46 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 7.23/2.38 # ENIGMATIC: Solved by autoschedule-lgb:
% 7.23/2.38 # No SInE strategy applied
% 7.23/2.38 # Trying AutoSched0 for 150 seconds
% 7.23/2.38 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S064N
% 7.23/2.38 # and selection function SelectComplexG.
% 7.23/2.38 #
% 7.23/2.38 # Preprocessing time : 0.016 s
% 7.23/2.38 # Presaturation interreduction done
% 7.23/2.38
% 7.23/2.38 # Proof found!
% 7.23/2.38 # SZS status Theorem
% 7.23/2.38 # SZS output start CNFRefutation
% See solution above
% 7.23/2.38 # Training examples: 0 positive, 0 negative
% 7.23/2.38
% 7.23/2.38 # -------------------------------------------------
% 7.23/2.38 # User time : 0.034 s
% 7.23/2.38 # System time : 0.005 s
% 7.23/2.38 # Total time : 0.039 s
% 7.23/2.38 # Maximum resident set size: 7128 pages
% 7.23/2.38
%------------------------------------------------------------------------------