TSTP Solution File: HWV090+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : HWV090+1 : TPTP v8.1.0. Released v6.1.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n008.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 : Sat Jul 16 13:53:14 EDT 2022
% Result : Theorem 10.31s 4.09s
% Output : CNFRefutation 10.31s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 11
% Syntax : Number of clauses : 32 ( 15 unt; 4 nHn; 22 RR)
% Number of literals : 51 ( 0 equ; 25 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 10 ( 9 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 4 con; 0-0 aty)
% Number of variables : 29 ( 12 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_2971,plain,
( v30860(X1,bitIndex5)
| ~ v30856(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-1_th43ot/lgb.p',i_0_2971) ).
cnf(i_0_675,plain,
~ v30860(X1,bitIndex5),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-1_th43ot/lgb.p',i_0_675) ).
cnf(i_0_31,plain,
( v30856(X1)
| ~ v30855(X1,bitIndex0) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-1_th43ot/lgb.p',i_0_31) ).
cnf(i_0_2976,plain,
( v30869(X1)
| ~ v30855(X1,bitIndex1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-1_th43ot/lgb.p',i_0_2976) ).
cnf(i_0_29,plain,
v30855(X1,bitIndex1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-1_th43ot/lgb.p',i_0_29) ).
cnf(i_0_2975,plain,
( v30855(X1,bitIndex0)
| ~ v30854(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-1_th43ot/lgb.p',i_0_2975) ).
cnf(i_0_2955,plain,
( v30851(X1)
| ~ v30853(X1)
| ~ v30869(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-1_th43ot/lgb.p',i_0_2955) ).
cnf(i_0_3109,plain,
( v30853(X1)
| v30854(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-1_th43ot/lgb.p',i_0_3109) ).
cnf(i_0_3110,plain,
( ~ v30851(X1)
| ~ v30850(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-1_th43ot/lgb.p',i_0_3110) ).
cnf(i_0_3113,plain,
( v4(X1)
| v30850(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-1_th43ot/lgb.p',i_0_3113) ).
cnf(i_0_15,negated_conjecture,
~ v4(esk1_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-1_th43ot/lgb.p',i_0_15) ).
cnf(c_0_3125,plain,
( v30860(X1,bitIndex5)
| ~ v30856(X1) ),
i_0_2971 ).
cnf(c_0_3126,plain,
~ v30860(X1,bitIndex5),
i_0_675 ).
cnf(c_0_3127,plain,
( v30856(X1)
| ~ v30855(X1,bitIndex0) ),
i_0_31 ).
cnf(c_0_3128,plain,
~ v30856(X1),
inference(sr,[status(thm)],[c_0_3125,c_0_3126]) ).
cnf(c_0_3129,plain,
( v30869(X1)
| ~ v30855(X1,bitIndex1) ),
i_0_2976 ).
cnf(c_0_3130,plain,
v30855(X1,bitIndex1),
i_0_29 ).
cnf(c_0_3131,plain,
( v30855(X1,bitIndex0)
| ~ v30854(X1) ),
i_0_2975 ).
cnf(c_0_3132,plain,
~ v30855(X1,bitIndex0),
inference(sr,[status(thm)],[c_0_3127,c_0_3128]) ).
cnf(c_0_3133,plain,
( v30851(X1)
| ~ v30853(X1)
| ~ v30869(X1) ),
i_0_2955 ).
cnf(c_0_3134,plain,
v30869(X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_3129,c_0_3130])]) ).
cnf(c_0_3135,plain,
( v30853(X1)
| v30854(X1) ),
i_0_3109 ).
cnf(c_0_3136,plain,
~ v30854(X1),
inference(sr,[status(thm)],[c_0_3131,c_0_3132]) ).
cnf(c_0_3137,plain,
( v30851(X1)
| ~ v30853(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_3133,c_0_3134])]) ).
cnf(c_0_3138,plain,
v30853(X1),
inference(sr,[status(thm)],[c_0_3135,c_0_3136]) ).
cnf(c_0_3139,plain,
( ~ v30851(X1)
| ~ v30850(X1) ),
i_0_3110 ).
cnf(c_0_3140,plain,
v30851(X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_3137,c_0_3138])]) ).
cnf(c_0_3141,plain,
( v4(X1)
| v30850(X1) ),
i_0_3113 ).
cnf(c_0_3142,plain,
~ v30850(X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_3139,c_0_3140])]) ).
cnf(c_0_3143,negated_conjecture,
~ v4(esk1_0),
i_0_15 ).
cnf(c_0_3144,plain,
v4(X1),
inference(sr,[status(thm)],[c_0_3141,c_0_3142]) ).
cnf(c_0_3145,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_3143,c_0_3144])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : HWV090+1 : TPTP v8.1.0. Released v6.1.0.
% 0.08/0.15 % Command : enigmatic-eprover.py %s %d 1
% 0.16/0.37 % Computer : n008.cluster.edu
% 0.16/0.37 % Model : x86_64 x86_64
% 0.16/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.37 % Memory : 8042.1875MB
% 0.16/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.37 % CPULimit : 300
% 0.16/0.37 % WCLimit : 600
% 0.16/0.37 % DateTime : Fri Jun 17 01:14:54 EDT 2022
% 0.16/0.37 % CPUTime :
% 0.54/0.69 # ENIGMATIC: Selected SinE mode:
% 1.20/1.38 # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 1.20/1.38 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 1.20/1.38 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 1.20/1.38 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 10.31/4.09 # ENIGMATIC: Solved by autoschedule-lgb:
% 10.31/4.09 # No SInE strategy applied
% 10.31/4.09 # Trying AutoSched0 for 150 seconds
% 10.31/4.09 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S030A
% 10.31/4.09 # and selection function SelectStrongRRNonRROptimalLit.
% 10.31/4.09 #
% 10.31/4.09 # Preprocessing time : 0.025 s
% 10.31/4.09 # Presaturation interreduction done
% 10.31/4.09
% 10.31/4.09 # Proof found!
% 10.31/4.09 # SZS status Theorem
% 10.31/4.09 # SZS output start CNFRefutation
% See solution above
% 10.31/4.09 # Training examples: 0 positive, 0 negative
% 10.31/4.09
% 10.31/4.09 # -------------------------------------------------
% 10.31/4.09 # User time : 0.034 s
% 10.31/4.09 # System time : 0.005 s
% 10.31/4.09 # Total time : 0.039 s
% 10.31/4.09 # Maximum resident set size: 15860 pages
% 10.31/4.09
%------------------------------------------------------------------------------