TSTP Solution File: LCL459+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : LCL459+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n019.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:11 EDT 2022
% Result : Theorem 7.89s 2.25s
% Output : CNFRefutation 7.89s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 8
% Syntax : Number of clauses : 23 ( 13 unt; 0 nHn; 16 RR)
% Number of literals : 38 ( 0 equ; 18 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 6 ( 5 usr; 5 prp; 0-1 aty)
% Number of functors : 3 ( 3 usr; 1 con; 0-2 aty)
% Number of variables : 21 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_51,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-2bgh6_b6/lgb.p',i_0_51) ).
cnf(i_0_28,plain,
modus_ponens,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-2bgh6_b6/lgb.p',i_0_28) ).
cnf(i_0_39,plain,
( is_a_theorem(implies(implies(X1,implies(X1,X2)),implies(X1,X2)))
| ~ implies_2 ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-2bgh6_b6/lgb.p',i_0_39) ).
cnf(i_0_26,plain,
implies_2,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-2bgh6_b6/lgb.p',i_0_26) ).
cnf(i_0_6,plain,
( is_a_theorem(implies(X1,implies(X2,and(X1,X2))))
| ~ and_3 ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-2bgh6_b6/lgb.p',i_0_6) ).
cnf(i_0_21,plain,
and_3,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-2bgh6_b6/lgb.p',i_0_21) ).
cnf(i_0_42,plain,
( kn1
| ~ is_a_theorem(implies(esk26_0,and(esk26_0,esk26_0))) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-2bgh6_b6/lgb.p',i_0_42) ).
cnf(i_0_75,negated_conjecture,
~ kn1,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-2bgh6_b6/lgb.p',i_0_75) ).
cnf(c_0_84,plain,
( is_a_theorem(X1)
| ~ modus_ponens
| ~ is_a_theorem(X2)
| ~ is_a_theorem(implies(X2,X1)) ),
i_0_51 ).
cnf(c_0_85,plain,
modus_ponens,
i_0_28 ).
cnf(c_0_86,plain,
( is_a_theorem(implies(implies(X1,implies(X1,X2)),implies(X1,X2)))
| ~ implies_2 ),
i_0_39 ).
cnf(c_0_87,plain,
implies_2,
i_0_26 ).
cnf(c_0_88,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_84,c_0_85])]) ).
cnf(c_0_89,plain,
is_a_theorem(implies(implies(X1,implies(X1,X2)),implies(X1,X2))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_86,c_0_87])]) ).
cnf(c_0_90,plain,
( is_a_theorem(implies(X1,implies(X2,and(X1,X2))))
| ~ and_3 ),
i_0_6 ).
cnf(c_0_91,plain,
and_3,
i_0_21 ).
cnf(c_0_92,plain,
( kn1
| ~ is_a_theorem(implies(esk26_0,and(esk26_0,esk26_0))) ),
i_0_42 ).
cnf(c_0_93,negated_conjecture,
~ kn1,
i_0_75 ).
cnf(c_0_94,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(implies(X1,implies(X1,X2))) ),
inference(spm,[status(thm)],[c_0_88,c_0_89]) ).
cnf(c_0_95,plain,
is_a_theorem(implies(X1,implies(X2,and(X1,X2)))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_90,c_0_91])]) ).
cnf(c_0_96,plain,
~ is_a_theorem(implies(esk26_0,and(esk26_0,esk26_0))),
inference(sr,[status(thm)],[c_0_92,c_0_93]) ).
cnf(c_0_97,plain,
is_a_theorem(implies(X1,and(X1,X1))),
inference(spm,[status(thm)],[c_0_94,c_0_95]) ).
cnf(c_0_98,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_96,c_0_97])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : LCL459+1 : TPTP v8.1.0. Released v3.3.0.
% 0.06/0.11 % Command : enigmatic-eprover.py %s %d 1
% 0.11/0.32 % Computer : n019.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 : Sat Jul 2 16:43:40 EDT 2022
% 0.11/0.33 % CPUTime :
% 0.18/0.44 # ENIGMATIC: Selected SinE mode:
% 0.18/0.44 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.18/0.44 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.18/0.44 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.18/0.44 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 7.89/2.25 # ENIGMATIC: Solved by autoschedule-lgb:
% 7.89/2.25 # No SInE strategy applied
% 7.89/2.25 # Trying AutoSched0 for 150 seconds
% 7.89/2.25 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI
% 7.89/2.25 # and selection function SelectComplexExceptUniqMaxHorn.
% 7.89/2.25 #
% 7.89/2.25 # Preprocessing time : 0.024 s
% 7.89/2.25 # Presaturation interreduction done
% 7.89/2.25
% 7.89/2.25 # Proof found!
% 7.89/2.25 # SZS status Theorem
% 7.89/2.25 # SZS output start CNFRefutation
% See solution above
% 7.89/2.25 # Training examples: 0 positive, 0 negative
% 7.89/2.25
% 7.89/2.25 # -------------------------------------------------
% 7.89/2.25 # User time : 0.034 s
% 7.89/2.25 # System time : 0.004 s
% 7.89/2.25 # Total time : 0.038 s
% 7.89/2.25 # Maximum resident set size: 7124 pages
% 7.89/2.25
%------------------------------------------------------------------------------