TSTP Solution File: LCL462+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : LCL462+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n006.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:12 EDT 2022
% Result : Theorem 258.74s 33.79s
% Output : CNFRefutation 258.74s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 10
% Syntax : Number of clauses : 55 ( 33 unt; 0 nHn; 21 RR)
% Number of literals : 82 ( 0 equ; 30 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 7 ( 6 usr; 6 prp; 0-1 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 111 ( 14 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_44,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-44kj01ya/input.p',i_0_44) ).
cnf(i_0_38,plain,
modus_ponens,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-44kj01ya/input.p',i_0_38) ).
cnf(i_0_8,plain,
( is_a_theorem(implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3))))
| ~ cn1 ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-44kj01ya/input.p',i_0_8) ).
cnf(i_0_35,plain,
cn1,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-44kj01ya/input.p',i_0_35) ).
cnf(i_0_10,plain,
( is_a_theorem(implies(X1,implies(not(X1),X2)))
| ~ cn2 ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-44kj01ya/input.p',i_0_10) ).
cnf(i_0_36,plain,
cn2,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-44kj01ya/input.p',i_0_36) ).
cnf(i_0_12,plain,
( is_a_theorem(implies(implies(not(X1),X1),X1))
| ~ cn3 ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-44kj01ya/input.p',i_0_12) ).
cnf(i_0_37,plain,
cn3,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-44kj01ya/input.p',i_0_37) ).
cnf(i_0_45,plain,
( modus_tollens
| ~ is_a_theorem(implies(implies(not(esk35_0),not(esk34_0)),implies(esk34_0,esk35_0))) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-44kj01ya/input.p',i_0_45) ).
cnf(i_0_19,negated_conjecture,
~ modus_tollens,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-44kj01ya/input.p',i_0_19) ).
cnf(c_0_56,plain,
( is_a_theorem(X1)
| ~ modus_ponens
| ~ is_a_theorem(X2)
| ~ is_a_theorem(implies(X2,X1)) ),
i_0_44 ).
cnf(c_0_57,plain,
modus_ponens,
i_0_38 ).
cnf(c_0_58,plain,
( is_a_theorem(implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3))))
| ~ cn1 ),
i_0_8 ).
cnf(c_0_59,plain,
cn1,
i_0_35 ).
cnf(c_0_60,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_56,c_0_57])]) ).
cnf(c_0_61,plain,
is_a_theorem(implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3)))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_58,c_0_59])]) ).
cnf(c_0_62,plain,
( is_a_theorem(implies(X1,implies(not(X1),X2)))
| ~ cn2 ),
i_0_10 ).
cnf(c_0_63,plain,
cn2,
i_0_36 ).
cnf(c_0_64,plain,
( is_a_theorem(implies(implies(not(X1),X1),X1))
| ~ cn3 ),
i_0_12 ).
cnf(c_0_65,plain,
cn3,
i_0_37 ).
cnf(c_0_66,plain,
( is_a_theorem(implies(implies(X1,X2),implies(X3,X2)))
| ~ is_a_theorem(implies(X3,X1)) ),
inference(spm,[status(thm)],[c_0_60,c_0_61]) ).
cnf(c_0_67,plain,
is_a_theorem(implies(X1,implies(not(X1),X2))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_62,c_0_63])]) ).
cnf(c_0_68,plain,
is_a_theorem(implies(implies(not(X1),X1),X1)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_64,c_0_65])]) ).
cnf(c_0_69,plain,
is_a_theorem(implies(implies(implies(implies(X1,X2),implies(X3,X2)),X4),implies(implies(X3,X1),X4))),
inference(spm,[status(thm)],[c_0_66,c_0_61]) ).
cnf(c_0_70,plain,
is_a_theorem(implies(implies(implies(not(X1),X2),X3),implies(X1,X3))),
inference(spm,[status(thm)],[c_0_66,c_0_67]) ).
cnf(c_0_71,plain,
is_a_theorem(implies(implies(X1,X2),implies(implies(not(X1),X1),X2))),
inference(spm,[status(thm)],[c_0_66,c_0_68]) ).
cnf(c_0_72,plain,
( is_a_theorem(implies(implies(X1,X2),X3))
| ~ is_a_theorem(implies(implies(implies(X2,X4),implies(X1,X4)),X3)) ),
inference(spm,[status(thm)],[c_0_60,c_0_69]) ).
cnf(c_0_73,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(implies(implies(not(X1),X3),X2)) ),
inference(spm,[status(thm)],[c_0_60,c_0_70]) ).
cnf(c_0_74,plain,
is_a_theorem(implies(implies(implies(implies(not(X1),X1),X2),X3),implies(implies(X1,X2),X3))),
inference(spm,[status(thm)],[c_0_66,c_0_71]) ).
cnf(c_0_75,plain,
is_a_theorem(implies(implies(X1,not(X2)),implies(X2,implies(X1,X3)))),
inference(spm,[status(thm)],[c_0_72,c_0_70]) ).
cnf(c_0_76,plain,
( is_a_theorem(implies(not(X1),X2))
| ~ is_a_theorem(X1) ),
inference(spm,[status(thm)],[c_0_60,c_0_67]) ).
cnf(c_0_77,plain,
is_a_theorem(implies(X1,X1)),
inference(spm,[status(thm)],[c_0_73,c_0_68]) ).
cnf(c_0_78,plain,
is_a_theorem(implies(implies(X1,implies(not(X2),X2)),implies(implies(X2,X3),implies(X1,X3)))),
inference(spm,[status(thm)],[c_0_72,c_0_74]) ).
cnf(c_0_79,plain,
( is_a_theorem(implies(X1,implies(X2,X3)))
| ~ is_a_theorem(implies(X2,not(X1))) ),
inference(spm,[status(thm)],[c_0_60,c_0_75]) ).
cnf(c_0_80,plain,
is_a_theorem(implies(not(implies(X1,X1)),X2)),
inference(spm,[status(thm)],[c_0_76,c_0_77]) ).
cnf(c_0_81,plain,
( is_a_theorem(implies(implies(X1,X2),implies(X3,X2)))
| ~ is_a_theorem(implies(X3,implies(not(X1),X1))) ),
inference(spm,[status(thm)],[c_0_60,c_0_78]) ).
cnf(c_0_82,plain,
is_a_theorem(implies(X1,implies(not(implies(X2,X2)),X3))),
inference(spm,[status(thm)],[c_0_79,c_0_80]) ).
cnf(c_0_83,plain,
is_a_theorem(implies(implies(implies(X1,X1),X2),implies(X3,X2))),
inference(spm,[status(thm)],[c_0_81,c_0_82]) ).
cnf(c_0_84,plain,
is_a_theorem(implies(implies(X1,implies(X2,X3)),implies(implies(X4,X2),implies(X1,implies(X4,X3))))),
inference(spm,[status(thm)],[c_0_72,c_0_69]) ).
cnf(c_0_85,plain,
is_a_theorem(implies(implies(X1,X2),implies(implies(implies(X3,X3),X1),X2))),
inference(spm,[status(thm)],[c_0_81,c_0_83]) ).
cnf(c_0_86,plain,
( is_a_theorem(implies(implies(X1,X2),implies(X3,implies(X1,X4))))
| ~ is_a_theorem(implies(X3,implies(X2,X4))) ),
inference(spm,[status(thm)],[c_0_60,c_0_84]) ).
cnf(c_0_87,plain,
is_a_theorem(implies(implies(implies(X1,implies(X2,X3)),X4),implies(implies(X2,not(X1)),X4))),
inference(spm,[status(thm)],[c_0_66,c_0_75]) ).
cnf(c_0_88,plain,
( is_a_theorem(implies(implies(implies(X1,X1),X2),X3))
| ~ is_a_theorem(implies(X2,X3)) ),
inference(spm,[status(thm)],[c_0_60,c_0_85]) ).
cnf(c_0_89,plain,
is_a_theorem(implies(implies(X1,implies(implies(X2,X2),X3)),implies(implies(X3,X4),implies(X1,X4)))),
inference(spm,[status(thm)],[c_0_86,c_0_85]) ).
cnf(c_0_90,plain,
( is_a_theorem(implies(implies(X1,not(X2)),X3))
| ~ is_a_theorem(implies(implies(X2,implies(X1,X4)),X3)) ),
inference(spm,[status(thm)],[c_0_60,c_0_87]) ).
cnf(c_0_91,plain,
is_a_theorem(implies(implies(implies(X1,X1),X2),X2)),
inference(spm,[status(thm)],[c_0_88,c_0_77]) ).
cnf(c_0_92,plain,
( is_a_theorem(implies(implies(X1,X2),implies(X3,X2)))
| ~ is_a_theorem(implies(X3,implies(implies(X4,X4),X1))) ),
inference(spm,[status(thm)],[c_0_60,c_0_89]) ).
cnf(c_0_93,plain,
is_a_theorem(implies(implies(not(X1),not(X2)),implies(implies(X1,X3),implies(X2,X3)))),
inference(spm,[status(thm)],[c_0_90,c_0_78]) ).
cnf(c_0_94,plain,
( modus_tollens
| ~ is_a_theorem(implies(implies(not(esk35_0),not(esk34_0)),implies(esk34_0,esk35_0))) ),
i_0_45 ).
cnf(c_0_95,negated_conjecture,
~ modus_tollens,
i_0_19 ).
cnf(c_0_96,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(implies(implies(X2,X2),X1)) ),
inference(spm,[status(thm)],[c_0_60,c_0_91]) ).
cnf(c_0_97,plain,
is_a_theorem(implies(implies(implies(X1,X2),X3),implies(implies(not(X2),not(X1)),X3))),
inference(spm,[status(thm)],[c_0_92,c_0_93]) ).
cnf(c_0_98,plain,
~ is_a_theorem(implies(implies(not(esk35_0),not(esk34_0)),implies(esk34_0,esk35_0))),
inference(sr,[status(thm)],[c_0_94,c_0_95]) ).
cnf(c_0_99,plain,
is_a_theorem(implies(implies(not(X1),not(X2)),implies(X2,X1))),
inference(spm,[status(thm)],[c_0_96,c_0_97]) ).
cnf(c_0_100,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_98,c_0_99])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : LCL462+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 : n006.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 19:23:09 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.44 # ENIGMATIC: Selected SinE mode:
% 0.18/0.45 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.18/0.45 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.18/0.45 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.18/0.45 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 250.65/32.74 eprover: CPU time limit exceeded, terminating
% 250.65/32.81 eprover: CPU time limit exceeded, terminating
% 258.74/33.79 # ENIGMATIC: Solved by Enigma+T5d16l600+G_E___200_B02_F1_SE_CS_SP_PI_S0S+loop07+coop:
% 258.74/33.79 # ENIGMA: LightGBM model '/export/starexec/sandbox/solver/bin/data/Enigma/T5d16l600/G_E___200_B02_F1_SE_CS_SP_PI_S0S/loop07/model.lgb' loaded. (hash_base: 32768; conj_feats: 9; version: 991; iters: 200)
% 258.74/33.79 # Preprocessing time : 0.154 s
% 258.74/33.79
% 258.74/33.79 # Proof found!
% 258.74/33.79 # SZS status Theorem
% 258.74/33.79 # SZS output start CNFRefutation
% See solution above
% 258.74/33.79 # Training examples: 0 positive, 0 negative
% 258.74/33.79
% 258.74/33.79 # -------------------------------------------------
% 258.74/33.79 # User time : 0.349 s
% 258.74/33.79 # System time : 0.020 s
% 258.74/33.79 # Total time : 0.369 s
% 258.74/33.79 # ...preprocessing : 0.154 s
% 258.74/33.79 # ...main loop : 0.215 s
% 258.74/33.79 # Maximum resident set size: 33660 pages
% 258.74/33.79
%------------------------------------------------------------------------------