TSTP Solution File: HWV096+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : HWV096+1 : TPTP v8.2.0. Released v6.1.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n010.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 : 300s
% DateTime : Tue May 14 08:23:09 EDT 2024
% Result : Theorem 12.89s 6.45s
% Output : CNFRefutation 12.89s
% 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_5225,plain,
( v133786(X1,bitIndex5)
| ~ v133780(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-do7ttszo/lgb.p',i_0_5225) ).
cnf(i_0_4080,plain,
~ v133786(X1,bitIndex5),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-do7ttszo/lgb.p',i_0_4080) ).
cnf(i_0_2989,plain,
( v133780(X1)
| ~ v133779(X1,bitIndex0) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-do7ttszo/lgb.p',i_0_2989) ).
cnf(i_0_5230,plain,
( v133789(X1)
| ~ v133779(X1,bitIndex1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-do7ttszo/lgb.p',i_0_5230) ).
cnf(i_0_2987,plain,
v133779(X1,bitIndex1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-do7ttszo/lgb.p',i_0_2987) ).
cnf(i_0_5229,plain,
( v133779(X1,bitIndex0)
| ~ v133778(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-do7ttszo/lgb.p',i_0_5229) ).
cnf(i_0_5101,plain,
( v133775(X1)
| ~ v133777(X1)
| ~ v133789(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-do7ttszo/lgb.p',i_0_5101) ).
cnf(i_0_5327,plain,
( v133777(X1)
| v133778(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-do7ttszo/lgb.p',i_0_5327) ).
cnf(i_0_5328,plain,
( ~ v133775(X1)
| ~ v133774(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-do7ttszo/lgb.p',i_0_5328) ).
cnf(i_0_5331,plain,
( v4(X1)
| v133774(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-do7ttszo/lgb.p',i_0_5331) ).
cnf(i_0_13,negated_conjecture,
~ v4(esk1_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-do7ttszo/lgb.p',i_0_13) ).
cnf(c_0_5343,plain,
( v133786(X1,bitIndex5)
| ~ v133780(X1) ),
i_0_5225 ).
cnf(c_0_5344,plain,
~ v133786(X1,bitIndex5),
i_0_4080 ).
cnf(c_0_5345,plain,
( v133780(X1)
| ~ v133779(X1,bitIndex0) ),
i_0_2989 ).
cnf(c_0_5346,plain,
~ v133780(X1),
inference(sr,[status(thm)],[c_0_5343,c_0_5344]) ).
cnf(c_0_5347,plain,
( v133789(X1)
| ~ v133779(X1,bitIndex1) ),
i_0_5230 ).
cnf(c_0_5348,plain,
v133779(X1,bitIndex1),
i_0_2987 ).
cnf(c_0_5349,plain,
( v133779(X1,bitIndex0)
| ~ v133778(X1) ),
i_0_5229 ).
cnf(c_0_5350,plain,
~ v133779(X1,bitIndex0),
inference(sr,[status(thm)],[c_0_5345,c_0_5346]) ).
cnf(c_0_5351,plain,
( v133775(X1)
| ~ v133777(X1)
| ~ v133789(X1) ),
i_0_5101 ).
cnf(c_0_5352,plain,
v133789(X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_5347,c_0_5348])]) ).
cnf(c_0_5353,plain,
( v133777(X1)
| v133778(X1) ),
i_0_5327 ).
cnf(c_0_5354,plain,
~ v133778(X1),
inference(sr,[status(thm)],[c_0_5349,c_0_5350]) ).
cnf(c_0_5355,plain,
( v133775(X1)
| ~ v133777(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_5351,c_0_5352])]) ).
cnf(c_0_5356,plain,
v133777(X1),
inference(sr,[status(thm)],[c_0_5353,c_0_5354]) ).
cnf(c_0_5357,plain,
( ~ v133775(X1)
| ~ v133774(X1) ),
i_0_5328 ).
cnf(c_0_5358,plain,
v133775(X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_5355,c_0_5356])]) ).
cnf(c_0_5359,plain,
( v4(X1)
| v133774(X1) ),
i_0_5331 ).
cnf(c_0_5360,plain,
~ v133774(X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_5357,c_0_5358])]) ).
cnf(c_0_5361,negated_conjecture,
~ v4(esk1_0),
i_0_13 ).
cnf(c_0_5362,plain,
v4(X1),
inference(sr,[status(thm)],[c_0_5359,c_0_5360]) ).
cnf(c_0_5363,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_5361,c_0_5362])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : HWV096+1 : TPTP v8.2.0. Released v6.1.0.
% 0.11/0.17 % Command : enigmatic-eprover.py %s %d 1
% 0.17/0.38 % Computer : n010.cluster.edu
% 0.17/0.38 % Model : x86_64 x86_64
% 0.17/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.38 % Memory : 8042.1875MB
% 0.17/0.38 % OS : Linux 3.10.0-693.el7.x86_64
% 0.17/0.38 % CPULimit : 300
% 0.17/0.38 % WCLimit : 300
% 0.17/0.38 % DateTime : Mon May 13 12:41:55 EDT 2024
% 0.17/0.38 % CPUTime :
% 1.08/1.23 # ENIGMATIC: Selected SinE mode:
% 3.14/3.36 # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.14/3.36 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 3.14/3.36 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 3.14/3.36 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 12.89/6.45 # ENIGMATIC: Solved by autoschedule-lgb:
% 12.89/6.45 # No SInE strategy applied
% 12.89/6.45 # Trying AutoSched0 for 148 seconds
% 12.89/6.45 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S030A
% 12.89/6.45 # and selection function SelectStrongRRNonRROptimalLit.
% 12.89/6.45 #
% 12.89/6.45 # Preprocessing time : 0.025 s
% 12.89/6.45 # Presaturation interreduction done
% 12.89/6.45
% 12.89/6.45 # Proof found!
% 12.89/6.45 # SZS status Theorem
% 12.89/6.45 # SZS output start CNFRefutation
% See solution above
% 12.89/6.45 # Training examples: 0 positive, 0 negative
% 12.89/6.45
% 12.89/6.45 # -------------------------------------------------
% 12.89/6.45 # User time : 0.031 s
% 12.89/6.45 # System time : 0.009 s
% 12.89/6.45 # Total time : 0.040 s
% 12.89/6.45 # Maximum resident set size: 37672 pages
% 12.89/6.45
%------------------------------------------------------------------------------