TSTP Solution File: LCL486+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : LCL486+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:21 EDT 2022
% Result : Theorem 15.64s 3.31s
% Output : CNFRefutation 15.64s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 10
% Syntax : Number of clauses : 31 ( 17 unt; 0 nHn; 20 RR)
% Number of literals : 50 ( 3 equ; 22 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 8 ( 6 usr; 6 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 45 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_38,plain,
( is_a_theorem(X1)
| ~ modus_ponens
| ~ is_a_theorem(X2)
| ~ is_a_theorem(implies(X2,X1)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-k9ffv7ei/input.p',i_0_38) ).
cnf(i_0_52,plain,
modus_ponens,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-k9ffv7ei/input.p',i_0_52) ).
cnf(i_0_68,plain,
( is_a_theorem(implies(or(X1,or(X2,X3)),or(X2,or(X1,X3))))
| ~ r4 ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-k9ffv7ei/input.p',i_0_68) ).
cnf(i_0_59,plain,
r4,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-k9ffv7ei/input.p',i_0_59) ).
cnf(i_0_44,plain,
( or(not(X1),X2) = implies(X1,X2)
| ~ op_implies_or ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-k9ffv7ei/input.p',i_0_44) ).
cnf(i_0_55,plain,
op_implies_or,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-k9ffv7ei/input.p',i_0_55) ).
cnf(i_0_70,plain,
( is_a_theorem(implies(implies(X1,X2),implies(or(X3,X1),or(X3,X2))))
| ~ r5 ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-k9ffv7ei/input.p',i_0_70) ).
cnf(i_0_60,plain,
r5,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-k9ffv7ei/input.p',i_0_60) ).
cnf(i_0_27,plain,
( implies_3
| ~ is_a_theorem(implies(implies(esk23_0,esk24_0),implies(implies(esk24_0,esk25_0),implies(esk23_0,esk25_0)))) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-k9ffv7ei/input.p',i_0_27) ).
cnf(i_0_19,negated_conjecture,
~ implies_3,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-k9ffv7ei/input.p',i_0_19) ).
cnf(c_0_81,plain,
( is_a_theorem(X1)
| ~ modus_ponens
| ~ is_a_theorem(X2)
| ~ is_a_theorem(implies(X2,X1)) ),
i_0_38 ).
cnf(c_0_82,plain,
modus_ponens,
i_0_52 ).
cnf(c_0_83,plain,
( is_a_theorem(implies(or(X1,or(X2,X3)),or(X2,or(X1,X3))))
| ~ r4 ),
i_0_68 ).
cnf(c_0_84,plain,
r4,
i_0_59 ).
cnf(c_0_85,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_81,c_0_82])]) ).
cnf(c_0_86,plain,
is_a_theorem(implies(or(X1,or(X2,X3)),or(X2,or(X1,X3)))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_83,c_0_84])]) ).
cnf(c_0_87,plain,
( or(not(X1),X2) = implies(X1,X2)
| ~ op_implies_or ),
i_0_44 ).
cnf(c_0_88,plain,
op_implies_or,
i_0_55 ).
cnf(c_0_89,plain,
( is_a_theorem(or(X1,or(X2,X3)))
| ~ is_a_theorem(or(X2,or(X1,X3))) ),
inference(spm,[status(thm)],[c_0_85,c_0_86]) ).
cnf(c_0_90,plain,
or(not(X1),X2) = implies(X1,X2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_87,c_0_88])]) ).
cnf(c_0_91,plain,
( is_a_theorem(implies(implies(X1,X2),implies(or(X3,X1),or(X3,X2))))
| ~ r5 ),
i_0_70 ).
cnf(c_0_92,plain,
r5,
i_0_60 ).
cnf(c_0_93,plain,
( is_a_theorem(implies(X1,or(X2,X3)))
| ~ is_a_theorem(or(X2,implies(X1,X3))) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_89,c_0_90]),c_0_90]) ).
cnf(c_0_94,plain,
is_a_theorem(implies(implies(X1,X2),implies(or(X3,X1),or(X3,X2)))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_91,c_0_92])]) ).
cnf(c_0_95,plain,
( implies_3
| ~ is_a_theorem(implies(implies(esk23_0,esk24_0),implies(implies(esk24_0,esk25_0),implies(esk23_0,esk25_0)))) ),
i_0_27 ).
cnf(c_0_96,negated_conjecture,
~ implies_3,
i_0_19 ).
cnf(c_0_97,plain,
( is_a_theorem(implies(X1,implies(X2,X3)))
| ~ is_a_theorem(implies(X2,implies(X1,X3))) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_93,c_0_90]),c_0_90]) ).
cnf(c_0_98,plain,
is_a_theorem(implies(implies(X1,X2),implies(implies(X3,X1),implies(X3,X2)))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_94,c_0_90]),c_0_90]) ).
cnf(c_0_99,plain,
~ is_a_theorem(implies(implies(esk23_0,esk24_0),implies(implies(esk24_0,esk25_0),implies(esk23_0,esk25_0)))),
inference(sr,[status(thm)],[c_0_95,c_0_96]) ).
cnf(c_0_100,plain,
is_a_theorem(implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3)))),
inference(spm,[status(thm)],[c_0_97,c_0_98]) ).
cnf(c_0_101,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_99,c_0_100])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : LCL486+1 : TPTP v8.1.0. Released v3.3.0.
% 0.07/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.34 % Computer : n021.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 : Sat Jul 2 18:16:32 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.20/0.46 # ENIGMATIC: Selected SinE mode:
% 0.20/0.46 # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.46 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.20/0.46 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.20/0.46 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 15.64/3.31 # ENIGMATIC: Solved by Enigma+tptp-cade20-model03-h2e15+lgb-t150-d30-l6400-e0.15+coop-eprover66:
% 15.64/3.31 # ENIGMA: LightGBM model '/export/starexec/sandbox2/solver/bin/data/Enigma/tptp-cade20-model03-h2e15/lgb-t150-d30-l6400-e0.15/model.lgb' loaded. (hash_base: 32768; conj_feats: 9; version: 991; iters: 150)
% 15.64/3.31 # Preprocessing time : 0.859 s
% 15.64/3.31 # Presaturation interreduction done
% 15.64/3.31
% 15.64/3.31 # Proof found!
% 15.64/3.31 # SZS status Theorem
% 15.64/3.31 # SZS output start CNFRefutation
% See solution above
% 15.64/3.31 # Training examples: 0 positive, 0 negative
% 15.64/3.31
% 15.64/3.31 # -------------------------------------------------
% 15.64/3.31 # User time : 0.845 s
% 15.64/3.31 # System time : 0.108 s
% 15.64/3.31 # Total time : 0.953 s
% 15.64/3.31 # ...preprocessing : 0.859 s
% 15.64/3.31 # ...main loop : 0.094 s
% 15.64/3.31 # Maximum resident set size: 166904 pages
% 15.64/3.31
%------------------------------------------------------------------------------