TSTP Solution File: LCL531+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : LCL531+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n010.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 09:26:38 EDT 2022
% Result : Theorem 6.98s 2.14s
% Output : CNFRefutation 6.98s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 12
% Syntax : Number of clauses : 35 ( 19 unt; 0 nHn; 25 RR)
% Number of literals : 58 ( 3 equ; 27 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 9 ( 7 usr; 7 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 1 con; 0-2 aty)
% Number of variables : 32 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_105,plain,
( is_a_theorem(necessarily(X1))
| ~ necessitation
| ~ is_a_theorem(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-z9cbcjn1/lgb.p',i_0_105) ).
cnf(i_0_85,plain,
necessitation,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-z9cbcjn1/lgb.p',i_0_85) ).
cnf(i_0_114,plain,
( necessarily(implies(X1,X2)) = strict_implies(X1,X2)
| ~ op_strict_implies ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-z9cbcjn1/lgb.p',i_0_114) ).
cnf(i_0_136,plain,
op_strict_implies,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-z9cbcjn1/lgb.p',i_0_136) ).
cnf(i_0_96,plain,
( is_a_theorem(X1)
| ~ modus_ponens
| ~ is_a_theorem(X2)
| ~ is_a_theorem(implies(X2,X1)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-z9cbcjn1/lgb.p',i_0_96) ).
cnf(i_0_68,plain,
modus_ponens,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-z9cbcjn1/lgb.p',i_0_68) ).
cnf(i_0_79,plain,
( is_a_theorem(implies(implies(X1,implies(X1,X2)),implies(X1,X2)))
| ~ implies_2 ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-z9cbcjn1/lgb.p',i_0_79) ).
cnf(i_0_66,plain,
implies_2,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-z9cbcjn1/lgb.p',i_0_66) ).
cnf(i_0_27,plain,
( axiom_m4
| ~ is_a_theorem(strict_implies(esk22_0,and(esk22_0,esk22_0))) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-z9cbcjn1/lgb.p',i_0_27) ).
cnf(i_0_131,negated_conjecture,
~ axiom_m4,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-z9cbcjn1/lgb.p',i_0_131) ).
cnf(i_0_10,plain,
( is_a_theorem(implies(X1,implies(X2,and(X1,X2))))
| ~ and_3 ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-z9cbcjn1/lgb.p',i_0_10) ).
cnf(i_0_61,plain,
and_3,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-z9cbcjn1/lgb.p',i_0_61) ).
cnf(c_0_149,plain,
( is_a_theorem(necessarily(X1))
| ~ necessitation
| ~ is_a_theorem(X1) ),
i_0_105 ).
cnf(c_0_150,plain,
necessitation,
i_0_85 ).
cnf(c_0_151,plain,
( necessarily(implies(X1,X2)) = strict_implies(X1,X2)
| ~ op_strict_implies ),
i_0_114 ).
cnf(c_0_152,plain,
op_strict_implies,
i_0_136 ).
cnf(c_0_153,plain,
( is_a_theorem(X1)
| ~ modus_ponens
| ~ is_a_theorem(X2)
| ~ is_a_theorem(implies(X2,X1)) ),
i_0_96 ).
cnf(c_0_154,plain,
modus_ponens,
i_0_68 ).
cnf(c_0_155,plain,
( is_a_theorem(implies(implies(X1,implies(X1,X2)),implies(X1,X2)))
| ~ implies_2 ),
i_0_79 ).
cnf(c_0_156,plain,
implies_2,
i_0_66 ).
cnf(c_0_157,plain,
( axiom_m4
| ~ is_a_theorem(strict_implies(esk22_0,and(esk22_0,esk22_0))) ),
i_0_27 ).
cnf(c_0_158,negated_conjecture,
~ axiom_m4,
i_0_131 ).
cnf(c_0_159,plain,
( is_a_theorem(necessarily(X1))
| ~ is_a_theorem(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_149,c_0_150])]) ).
cnf(c_0_160,plain,
necessarily(implies(X1,X2)) = strict_implies(X1,X2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_151,c_0_152])]) ).
cnf(c_0_161,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(implies(X2,X1))
| ~ is_a_theorem(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_153,c_0_154])]) ).
cnf(c_0_162,plain,
is_a_theorem(implies(implies(X1,implies(X1,X2)),implies(X1,X2))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_155,c_0_156])]) ).
cnf(c_0_163,plain,
( is_a_theorem(implies(X1,implies(X2,and(X1,X2))))
| ~ and_3 ),
i_0_10 ).
cnf(c_0_164,plain,
and_3,
i_0_61 ).
cnf(c_0_165,plain,
~ is_a_theorem(strict_implies(esk22_0,and(esk22_0,esk22_0))),
inference(sr,[status(thm)],[c_0_157,c_0_158]) ).
cnf(c_0_166,plain,
( is_a_theorem(strict_implies(X1,X2))
| ~ is_a_theorem(implies(X1,X2)) ),
inference(spm,[status(thm)],[c_0_159,c_0_160]) ).
cnf(c_0_167,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(implies(X1,implies(X1,X2))) ),
inference(spm,[status(thm)],[c_0_161,c_0_162]) ).
cnf(c_0_168,plain,
is_a_theorem(implies(X1,implies(X2,and(X1,X2)))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_163,c_0_164])]) ).
cnf(c_0_169,plain,
~ is_a_theorem(implies(esk22_0,and(esk22_0,esk22_0))),
inference(spm,[status(thm)],[c_0_165,c_0_166]) ).
cnf(c_0_170,plain,
is_a_theorem(implies(X1,and(X1,X1))),
inference(spm,[status(thm)],[c_0_167,c_0_168]) ).
cnf(c_0_171,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_169,c_0_170])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : LCL531+1 : TPTP v8.1.0. Released v3.3.0.
% 0.03/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.11/0.31 % Computer : n010.cluster.edu
% 0.11/0.31 % Model : x86_64 x86_64
% 0.11/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.31 % Memory : 8042.1875MB
% 0.11/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.31 % CPULimit : 300
% 0.11/0.31 % WCLimit : 600
% 0.11/0.31 % DateTime : Sun Jul 3 18:12:04 EDT 2022
% 0.11/0.32 % CPUTime :
% 0.17/0.43 # ENIGMATIC: Selected SinE mode:
% 0.17/0.43 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.17/0.43 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.17/0.43 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.17/0.43 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 6.98/2.14 # ENIGMATIC: Solved by autoschedule-lgb:
% 6.98/2.14 # No SInE strategy applied
% 6.98/2.14 # Trying AutoSched0 for 150 seconds
% 6.98/2.14 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI
% 6.98/2.14 # and selection function SelectComplexExceptUniqMaxHorn.
% 6.98/2.14 #
% 6.98/2.14 # Preprocessing time : 0.022 s
% 6.98/2.14 # Presaturation interreduction done
% 6.98/2.14
% 6.98/2.14 # Proof found!
% 6.98/2.14 # SZS status Theorem
% 6.98/2.14 # SZS output start CNFRefutation
% See solution above
% 6.98/2.14 # Training examples: 0 positive, 0 negative
% 6.98/2.14
% 6.98/2.14 # -------------------------------------------------
% 6.98/2.14 # User time : 0.035 s
% 6.98/2.14 # System time : 0.007 s
% 6.98/2.14 # Total time : 0.042 s
% 6.98/2.14 # Maximum resident set size: 7128 pages
% 6.98/2.14
%------------------------------------------------------------------------------