TSTP Solution File: SWV187+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SWV187+1 : TPTP v8.1.0. Bugfixed v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n024.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 : Wed Jul 20 17:46:08 EDT 2022
% Result : Theorem 7.83s 2.34s
% Output : CNFRefutation 7.83s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 6
% Syntax : Number of clauses : 15 ( 10 unt; 0 nHn; 15 RR)
% Number of literals : 27 ( 5 equ; 14 neg)
% Maximal clause size : 5 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 2 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 7 con; 0-2 aty)
% Number of variables : 3 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_178,plain,
( gt(loopcounter,n1)
| ~ epred1_0 ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-sflhp967/lgb.p',i_0_178) ).
cnf(i_0_4,negated_conjecture,
epred1_0,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-sflhp967/lgb.p',i_0_4) ).
cnf(i_0_173,plain,
( a_select2(sigmaold_init,X1) = init
| ~ epred1_0
| ~ leq(X1,n4)
| ~ leq(n0,X1)
| ~ gt(loopcounter,n1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-sflhp967/lgb.p',i_0_173) ).
cnf(i_0_1,negated_conjecture,
a_select2(sigmaold_init,esk1_0) != init,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-sflhp967/lgb.p',i_0_1) ).
cnf(i_0_2,negated_conjecture,
leq(esk1_0,n4),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-sflhp967/lgb.p',i_0_2) ).
cnf(i_0_3,negated_conjecture,
leq(n0,esk1_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-sflhp967/lgb.p',i_0_3) ).
cnf(c_0_185,plain,
( gt(loopcounter,n1)
| ~ epred1_0 ),
i_0_178 ).
cnf(c_0_186,negated_conjecture,
epred1_0,
i_0_4 ).
cnf(c_0_187,plain,
( a_select2(sigmaold_init,X1) = init
| ~ epred1_0
| ~ leq(X1,n4)
| ~ leq(n0,X1)
| ~ gt(loopcounter,n1) ),
i_0_173 ).
cnf(c_0_188,plain,
gt(loopcounter,n1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_185,c_0_186])]) ).
cnf(c_0_189,negated_conjecture,
a_select2(sigmaold_init,esk1_0) != init,
i_0_1 ).
cnf(c_0_190,plain,
( a_select2(sigmaold_init,X1) = init
| ~ leq(X1,n4)
| ~ leq(n0,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_187,c_0_186]),c_0_188])]) ).
cnf(c_0_191,negated_conjecture,
leq(esk1_0,n4),
i_0_2 ).
cnf(c_0_192,negated_conjecture,
leq(n0,esk1_0),
i_0_3 ).
cnf(c_0_193,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_189,c_0_190]),c_0_191]),c_0_192])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SWV187+1 : TPTP v8.1.0. Bugfixed v3.3.0.
% 0.06/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n024.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Wed Jun 15 15:10:50 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.44 # ENIGMATIC: Selected SinE mode:
% 0.18/0.45 # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.18/0.45 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.18/0.45 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.18/0.45 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 7.83/2.34 # ENIGMATIC: Solved by autoschedule-lgb:
% 7.83/2.34 # No SInE strategy applied
% 7.83/2.34 # Trying AutoSched0 for 150 seconds
% 7.83/2.34 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 7.83/2.34 # and selection function SelectComplexExceptUniqMaxHorn.
% 7.83/2.34 #
% 7.83/2.34 # Preprocessing time : 0.025 s
% 7.83/2.34 # Presaturation interreduction done
% 7.83/2.34
% 7.83/2.34 # Proof found!
% 7.83/2.34 # SZS status Theorem
% 7.83/2.34 # SZS output start CNFRefutation
% See solution above
% 7.83/2.34 # Training examples: 0 positive, 0 negative
% 7.83/2.34
% 7.83/2.34 # -------------------------------------------------
% 7.83/2.34 # User time : 0.027 s
% 7.83/2.34 # System time : 0.008 s
% 7.83/2.34 # Total time : 0.034 s
% 7.83/2.34 # Maximum resident set size: 7120 pages
% 7.83/2.34
%------------------------------------------------------------------------------