TSTP Solution File: LCL542+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : LCL542+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n021.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:41 EDT 2022
% Result : Theorem 7.54s 2.46s
% Output : CNFRefutation 7.54s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 8
% Syntax : Number of clauses : 23 ( 13 unt; 0 nHn; 17 RR)
% Number of literals : 35 ( 3 equ; 16 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 3 ( 2 avg)
% Number of predicates : 7 ( 5 usr; 5 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 2 con; 0-2 aty)
% Number of variables : 17 ( 3 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_106,plain,
( is_a_theorem(necessarily(X1))
| ~ necessitation
| ~ is_a_theorem(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-qhuog_s0/lgb.p',i_0_106) ).
cnf(i_0_86,plain,
necessitation,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-qhuog_s0/lgb.p',i_0_86) ).
cnf(i_0_115,plain,
( necessarily(implies(X1,X2)) = strict_implies(X1,X2)
| ~ op_strict_implies ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-qhuog_s0/lgb.p',i_0_115) ).
cnf(i_0_137,plain,
op_strict_implies,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-qhuog_s0/lgb.p',i_0_137) ).
cnf(i_0_23,plain,
( axiom_m2
| ~ is_a_theorem(strict_implies(and(esk17_0,esk18_0),esk17_0)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-qhuog_s0/lgb.p',i_0_23) ).
cnf(i_0_132,negated_conjecture,
~ axiom_m2,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-qhuog_s0/lgb.p',i_0_132) ).
cnf(i_0_6,plain,
( is_a_theorem(implies(and(X1,X2),X1))
| ~ and_1 ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-qhuog_s0/lgb.p',i_0_6) ).
cnf(i_0_59,plain,
and_1,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-qhuog_s0/lgb.p',i_0_59) ).
cnf(c_0_146,plain,
( is_a_theorem(necessarily(X1))
| ~ necessitation
| ~ is_a_theorem(X1) ),
i_0_106 ).
cnf(c_0_147,plain,
necessitation,
i_0_86 ).
cnf(c_0_148,plain,
( necessarily(implies(X1,X2)) = strict_implies(X1,X2)
| ~ op_strict_implies ),
i_0_115 ).
cnf(c_0_149,plain,
op_strict_implies,
i_0_137 ).
cnf(c_0_150,plain,
( axiom_m2
| ~ is_a_theorem(strict_implies(and(esk17_0,esk18_0),esk17_0)) ),
i_0_23 ).
cnf(c_0_151,negated_conjecture,
~ axiom_m2,
i_0_132 ).
cnf(c_0_152,plain,
( is_a_theorem(necessarily(X1))
| ~ is_a_theorem(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_146,c_0_147])]) ).
cnf(c_0_153,plain,
necessarily(implies(X1,X2)) = strict_implies(X1,X2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_148,c_0_149])]) ).
cnf(c_0_154,plain,
~ is_a_theorem(strict_implies(and(esk17_0,esk18_0),esk17_0)),
inference(sr,[status(thm)],[c_0_150,c_0_151]) ).
cnf(c_0_155,plain,
( is_a_theorem(strict_implies(X1,X2))
| ~ is_a_theorem(implies(X1,X2)) ),
inference(spm,[status(thm)],[c_0_152,c_0_153]) ).
cnf(c_0_156,plain,
( is_a_theorem(implies(and(X1,X2),X1))
| ~ and_1 ),
i_0_6 ).
cnf(c_0_157,plain,
and_1,
i_0_59 ).
cnf(c_0_158,plain,
~ is_a_theorem(implies(and(esk17_0,esk18_0),esk17_0)),
inference(spm,[status(thm)],[c_0_154,c_0_155]) ).
cnf(c_0_159,plain,
is_a_theorem(implies(and(X1,X2),X1)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_156,c_0_157])]) ).
cnf(c_0_160,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_158,c_0_159])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : LCL542+1 : TPTP v8.1.0. Released v3.3.0.
% 0.00/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n021.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 : Sat Jul 2 16:35:16 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.19/0.44 # 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.54/2.46 # ENIGMATIC: Solved by autoschedule-lgb:
% 7.54/2.46 # No SInE strategy applied
% 7.54/2.46 # Trying AutoSched0 for 150 seconds
% 7.54/2.46 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI
% 7.54/2.46 # and selection function SelectComplexExceptUniqMaxHorn.
% 7.54/2.46 #
% 7.54/2.46 # Preprocessing time : 0.014 s
% 7.54/2.46 # Presaturation interreduction done
% 7.54/2.46
% 7.54/2.46 # Proof found!
% 7.54/2.46 # SZS status Theorem
% 7.54/2.46 # SZS output start CNFRefutation
% See solution above
% 7.54/2.46 # Training examples: 0 positive, 0 negative
% 7.54/2.46
% 7.54/2.46 # -------------------------------------------------
% 7.54/2.46 # User time : 0.018 s
% 7.54/2.46 # System time : 0.008 s
% 7.54/2.46 # Total time : 0.026 s
% 7.54/2.46 # Maximum resident set size: 7124 pages
% 7.54/2.46
%------------------------------------------------------------------------------