TSTP Solution File: LCL525+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : LCL525+1 : TPTP v8.1.0. Released v3.3.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 09:26:35 EDT 2022
% Result : Theorem 7.64s 2.30s
% Output : CNFRefutation 7.64s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 10
% Syntax : Number of clauses : 30 ( 15 unt; 4 nHn; 24 RR)
% Number of literals : 50 ( 3 equ; 19 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 5 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 18 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
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-ljdmrjy5/lgb.p',i_0_96) ).
cnf(i_0_68,plain,
modus_ponens,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ljdmrjy5/lgb.p',i_0_68) ).
cnf(i_0_40,plain,
( is_a_theorem(implies(necessarily(X1),X1))
| ~ axiom_M ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ljdmrjy5/lgb.p',i_0_40) ).
cnf(i_0_84,plain,
axiom_M,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ljdmrjy5/lgb.p',i_0_84) ).
cnf(i_0_114,plain,
( necessarily(implies(X1,X2)) = strict_implies(X1,X2)
| ~ op_strict_implies ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ljdmrjy5/lgb.p',i_0_114) ).
cnf(i_0_136,plain,
op_strict_implies,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ljdmrjy5/lgb.p',i_0_136) ).
cnf(i_0_98,plain,
( modus_ponens_strict_implies
| is_a_theorem(strict_implies(esk65_0,esk66_0)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ljdmrjy5/lgb.p',i_0_98) ).
cnf(i_0_131,negated_conjecture,
~ modus_ponens_strict_implies,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ljdmrjy5/lgb.p',i_0_131) ).
cnf(i_0_99,plain,
( modus_ponens_strict_implies
| is_a_theorem(esk65_0) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ljdmrjy5/lgb.p',i_0_99) ).
cnf(i_0_97,plain,
( modus_ponens_strict_implies
| ~ is_a_theorem(esk66_0) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ljdmrjy5/lgb.p',i_0_97) ).
cnf(c_0_147,plain,
( is_a_theorem(X1)
| ~ modus_ponens
| ~ is_a_theorem(X2)
| ~ is_a_theorem(implies(X2,X1)) ),
i_0_96 ).
cnf(c_0_148,plain,
modus_ponens,
i_0_68 ).
cnf(c_0_149,plain,
( is_a_theorem(implies(necessarily(X1),X1))
| ~ axiom_M ),
i_0_40 ).
cnf(c_0_150,plain,
axiom_M,
i_0_84 ).
cnf(c_0_151,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_147,c_0_148])]) ).
cnf(c_0_152,plain,
is_a_theorem(implies(necessarily(X1),X1)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_149,c_0_150])]) ).
cnf(c_0_153,plain,
( necessarily(implies(X1,X2)) = strict_implies(X1,X2)
| ~ op_strict_implies ),
i_0_114 ).
cnf(c_0_154,plain,
op_strict_implies,
i_0_136 ).
cnf(c_0_155,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(necessarily(X1)) ),
inference(spm,[status(thm)],[c_0_151,c_0_152]) ).
cnf(c_0_156,plain,
necessarily(implies(X1,X2)) = strict_implies(X1,X2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_153,c_0_154])]) ).
cnf(c_0_157,plain,
( modus_ponens_strict_implies
| is_a_theorem(strict_implies(esk65_0,esk66_0)) ),
i_0_98 ).
cnf(c_0_158,negated_conjecture,
~ modus_ponens_strict_implies,
i_0_131 ).
cnf(c_0_159,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(strict_implies(X1,X2)) ),
inference(spm,[status(thm)],[c_0_155,c_0_156]) ).
cnf(c_0_160,plain,
is_a_theorem(strict_implies(esk65_0,esk66_0)),
inference(sr,[status(thm)],[c_0_157,c_0_158]) ).
cnf(c_0_161,plain,
( modus_ponens_strict_implies
| is_a_theorem(esk65_0) ),
i_0_99 ).
cnf(c_0_162,plain,
( modus_ponens_strict_implies
| ~ is_a_theorem(esk66_0) ),
i_0_97 ).
cnf(c_0_163,plain,
is_a_theorem(implies(esk65_0,esk66_0)),
inference(spm,[status(thm)],[c_0_159,c_0_160]) ).
cnf(c_0_164,plain,
is_a_theorem(esk65_0),
inference(sr,[status(thm)],[c_0_161,c_0_158]) ).
cnf(c_0_165,plain,
~ is_a_theorem(esk66_0),
inference(sr,[status(thm)],[c_0_162,c_0_158]) ).
cnf(c_0_166,plain,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_151,c_0_163]),c_0_164])]),c_0_165]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.11 % Problem : LCL525+1 : TPTP v8.1.0. Released v3.3.0.
% 0.05/0.11 % Command : enigmatic-eprover.py %s %d 1
% 0.11/0.32 % Computer : n028.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 600
% 0.11/0.32 % DateTime : Mon Jul 4 21:10:07 EDT 2022
% 0.11/0.32 % CPUTime :
% 0.17/0.43 # ENIGMATIC: Selected SinE mode:
% 0.17/0.44 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.17/0.44 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.17/0.44 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.17/0.44 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 7.64/2.30 # ENIGMATIC: Solved by autoschedule-lgb:
% 7.64/2.30 # No SInE strategy applied
% 7.64/2.30 # Trying AutoSched0 for 150 seconds
% 7.64/2.30 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI
% 7.64/2.30 # and selection function SelectComplexExceptUniqMaxHorn.
% 7.64/2.30 #
% 7.64/2.30 # Preprocessing time : 0.014 s
% 7.64/2.30 # Presaturation interreduction done
% 7.64/2.30
% 7.64/2.30 # Proof found!
% 7.64/2.30 # SZS status Theorem
% 7.64/2.30 # SZS output start CNFRefutation
% See solution above
% 7.64/2.31 # Training examples: 0 positive, 0 negative
% 7.64/2.31
% 7.64/2.31 # -------------------------------------------------
% 7.64/2.31 # User time : 0.017 s
% 7.64/2.31 # System time : 0.006 s
% 7.64/2.31 # Total time : 0.023 s
% 7.64/2.31 # Maximum resident set size: 7128 pages
% 7.64/2.31
%------------------------------------------------------------------------------