TSTP Solution File: LCL527+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : LCL527+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n007.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:36 EDT 2022
% Result : Theorem 7.71s 2.30s
% Output : CNFRefutation 7.71s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 8
% Syntax : Number of clauses : 24 ( 11 unt; 4 nHn; 20 RR)
% Number of literals : 43 ( 0 equ; 18 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 4 prp; 0-1 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 16 ( 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-t9rzs8z1/lgb.p',i_0_96) ).
cnf(i_0_68,plain,
modus_ponens,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-t9rzs8z1/lgb.p',i_0_68) ).
cnf(i_0_10,plain,
( is_a_theorem(implies(X1,implies(X2,and(X1,X2))))
| ~ and_3 ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-t9rzs8z1/lgb.p',i_0_10) ).
cnf(i_0_61,plain,
and_3,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-t9rzs8z1/lgb.p',i_0_61) ).
cnf(i_0_1,plain,
( adjunction
| ~ is_a_theorem(and(esk1_0,esk2_0)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-t9rzs8z1/lgb.p',i_0_1) ).
cnf(i_0_131,negated_conjecture,
~ adjunction,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-t9rzs8z1/lgb.p',i_0_131) ).
cnf(i_0_2,plain,
( adjunction
| is_a_theorem(esk2_0) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-t9rzs8z1/lgb.p',i_0_2) ).
cnf(i_0_3,plain,
( adjunction
| is_a_theorem(esk1_0) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-t9rzs8z1/lgb.p',i_0_3) ).
cnf(c_0_140,plain,
( is_a_theorem(X1)
| ~ modus_ponens
| ~ is_a_theorem(X2)
| ~ is_a_theorem(implies(X2,X1)) ),
i_0_96 ).
cnf(c_0_141,plain,
modus_ponens,
i_0_68 ).
cnf(c_0_142,plain,
( is_a_theorem(implies(X1,implies(X2,and(X1,X2))))
| ~ and_3 ),
i_0_10 ).
cnf(c_0_143,plain,
and_3,
i_0_61 ).
cnf(c_0_144,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_140,c_0_141])]) ).
cnf(c_0_145,plain,
is_a_theorem(implies(X1,implies(X2,and(X1,X2)))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_142,c_0_143])]) ).
cnf(c_0_146,plain,
( adjunction
| ~ is_a_theorem(and(esk1_0,esk2_0)) ),
i_0_1 ).
cnf(c_0_147,negated_conjecture,
~ adjunction,
i_0_131 ).
cnf(c_0_148,plain,
( is_a_theorem(implies(X1,and(X2,X1)))
| ~ is_a_theorem(X2) ),
inference(spm,[status(thm)],[c_0_144,c_0_145]) ).
cnf(c_0_149,plain,
( adjunction
| is_a_theorem(esk2_0) ),
i_0_2 ).
cnf(c_0_150,plain,
( adjunction
| is_a_theorem(esk1_0) ),
i_0_3 ).
cnf(c_0_151,plain,
~ is_a_theorem(and(esk1_0,esk2_0)),
inference(sr,[status(thm)],[c_0_146,c_0_147]) ).
cnf(c_0_152,plain,
( is_a_theorem(and(X1,X2))
| ~ is_a_theorem(X2)
| ~ is_a_theorem(X1) ),
inference(spm,[status(thm)],[c_0_144,c_0_148]) ).
cnf(c_0_153,plain,
is_a_theorem(esk2_0),
inference(sr,[status(thm)],[c_0_149,c_0_147]) ).
cnf(c_0_154,plain,
is_a_theorem(esk1_0),
inference(sr,[status(thm)],[c_0_150,c_0_147]) ).
cnf(c_0_155,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_151,c_0_152]),c_0_153]),c_0_154])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : LCL527+1 : TPTP v8.1.0. Released v3.3.0.
% 0.03/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.34 % Computer : n007.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Sun Jul 3 14:08:13 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.45 # ENIGMATIC: Selected SinE mode:
% 0.19/0.46 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.46 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.19/0.46 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.19/0.46 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 7.71/2.30 # ENIGMATIC: Solved by autoschedule-lgb:
% 7.71/2.30 # No SInE strategy applied
% 7.71/2.30 # Trying AutoSched0 for 150 seconds
% 7.71/2.30 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI
% 7.71/2.30 # and selection function SelectComplexExceptUniqMaxHorn.
% 7.71/2.30 #
% 7.71/2.30 # Preprocessing time : 0.026 s
% 7.71/2.30 # Presaturation interreduction done
% 7.71/2.30
% 7.71/2.30 # Proof found!
% 7.71/2.30 # SZS status Theorem
% 7.71/2.30 # SZS output start CNFRefutation
% See solution above
% 7.71/2.30 # Training examples: 0 positive, 0 negative
% 7.71/2.30
% 7.71/2.30 # -------------------------------------------------
% 7.71/2.30 # User time : 0.037 s
% 7.71/2.30 # System time : 0.009 s
% 7.71/2.30 # Total time : 0.046 s
% 7.71/2.30 # Maximum resident set size: 7124 pages
% 7.71/2.30
%------------------------------------------------------------------------------