%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : CSR020+1 : TPTP v8.1.0. Bugfixed v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n026.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 : Fri Jul 15 02:46:34 EDT 2022
% Result : Theorem 7.96s 2.44s
% Output : CNFRefutation 7.96s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 13
% Syntax : Number of clauses : 38 ( 18 unt; 7 nHn; 31 RR)
% Number of literals : 71 ( 30 equ; 31 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-3 aty)
% Number of functors : 7 ( 7 usr; 6 con; 0-2 aty)
% Number of variables : 45 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_156,plain,
( happens(push,X1)
| epred3_3(X1,X2,X3)
| X2 != spinning
| X3 != pull ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-kv7l_17o/lgb.p',i_0_156) ).
cnf(i_0_94,plain,
( terminates(X1,X2,X3)
| ~ epred3_3(X3,X2,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-kv7l_17o/lgb.p',i_0_94) ).
cnf(i_0_29,plain,
( ~ happens(X1,X2)
| ~ terminates(X1,X3,X2)
| ~ holdsAt(X3,plus(X2,n1)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-kv7l_17o/lgb.p',i_0_29) ).
cnf(i_0_7,plain,
( happens(X1,X2)
| X2 != n1
| X1 != pull ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-kv7l_17o/lgb.p',i_0_7) ).
cnf(i_0_74,plain,
plus(n1,n1) = n2,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-kv7l_17o/lgb.p',i_0_74) ).
cnf(i_0_68,negated_conjecture,
holdsAt(spinning,n2),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-kv7l_17o/lgb.p',i_0_68) ).
cnf(i_0_59,plain,
( less_or_equal(X1,X2)
| X1 != X2 ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-kv7l_17o/lgb.p',i_0_59) ).
cnf(i_0_71,plain,
plus(n0,n1) = n1,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-kv7l_17o/lgb.p',i_0_71) ).
cnf(i_0_93,plain,
plus(X1,X2) = plus(X2,X1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-kv7l_17o/lgb.p',i_0_93) ).
cnf(i_0_15,plain,
( X1 = pull
| X2 = n0
| X2 = n2
| ~ happens(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-kv7l_17o/lgb.p',i_0_15) ).
cnf(i_0_80,plain,
pull != push,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-kv7l_17o/lgb.p',i_0_80) ).
cnf(i_0_43,plain,
( less(X1,n2)
| ~ less_or_equal(X1,n1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-kv7l_17o/lgb.p',i_0_43) ).
cnf(i_0_63,plain,
( X1 != X2
| ~ less(X2,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-kv7l_17o/lgb.p',i_0_63) ).
cnf(c_0_170,plain,
( happens(push,X1)
| epred3_3(X1,X2,X3)
| X2 != spinning
| X3 != pull ),
i_0_156 ).
cnf(c_0_171,plain,
( terminates(X1,X2,X3)
| ~ epred3_3(X3,X2,X1) ),
i_0_94 ).
cnf(c_0_172,plain,
( happens(push,X1)
| epred3_3(X1,spinning,pull) ),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_170])]) ).
cnf(c_0_173,plain,
( ~ happens(X1,X2)
| ~ terminates(X1,X3,X2)
| ~ holdsAt(X3,plus(X2,n1)) ),
i_0_29 ).
cnf(c_0_174,plain,
( happens(push,X1)
| terminates(pull,spinning,X1) ),
inference(spm,[status(thm)],[c_0_171,c_0_172]) ).
cnf(c_0_175,plain,
( happens(X1,X2)
| X2 != n1
| X1 != pull ),
i_0_7 ).
cnf(c_0_176,plain,
( happens(push,X1)
| ~ holdsAt(spinning,plus(X1,n1))
| ~ happens(pull,X1) ),
inference(spm,[status(thm)],[c_0_173,c_0_174]) ).
cnf(c_0_177,plain,
happens(pull,n1),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_175])]) ).
cnf(c_0_178,plain,
plus(n1,n1) = n2,
i_0_74 ).
cnf(c_0_179,negated_conjecture,
holdsAt(spinning,n2),
i_0_68 ).
cnf(c_0_180,plain,
( less_or_equal(X1,X2)
| X1 != X2 ),
i_0_59 ).
cnf(c_0_181,plain,
plus(n0,n1) = n1,
i_0_71 ).
cnf(c_0_182,plain,
plus(X1,X2) = plus(X2,X1),
i_0_93 ).
cnf(c_0_183,plain,
( X1 = pull
| X2 = n0
| X2 = n2
| ~ happens(X1,X2) ),
i_0_15 ).
cnf(c_0_184,plain,
happens(push,n1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_176,c_0_177]),c_0_178]),c_0_179])]) ).
cnf(c_0_185,plain,
pull != push,
i_0_80 ).
cnf(c_0_186,plain,
( less(X1,n2)
| ~ less_or_equal(X1,n1) ),
i_0_43 ).
cnf(c_0_187,plain,
less_or_equal(X1,X1),
inference(er,[status(thm)],[c_0_180]) ).
cnf(c_0_188,plain,
plus(n1,n0) = n1,
inference(rw,[status(thm)],[c_0_181,c_0_182]) ).
cnf(c_0_189,plain,
( n2 = n1
| n0 = n1 ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_183,c_0_184]),c_0_185]) ).
cnf(c_0_190,plain,
( X1 != X2
| ~ less(X2,X1) ),
i_0_63 ).
cnf(c_0_191,plain,
less(n1,n2),
inference(spm,[status(thm)],[c_0_186,c_0_187]) ).
cnf(c_0_192,plain,
n2 = n1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_188,c_0_189]),c_0_178])]) ).
cnf(c_0_193,plain,
~ less(X1,X1),
inference(er,[status(thm)],[c_0_190]) ).
cnf(c_0_194,plain,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_191,c_0_192]),c_0_193]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : CSR020+1 : TPTP v8.1.0. Bugfixed v3.1.0.
% 0.07/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.34 % Computer : n026.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 : Fri Jun 10 01:39:34 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.20/0.45 # ENIGMATIC: Selected SinE mode:
% 0.20/0.46 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.46 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.20/0.46 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.20/0.46 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 7.96/2.44 # ENIGMATIC: Solved by autoschedule-lgb:
% 7.96/2.44 # No SInE strategy applied
% 7.96/2.44 # Trying AutoSched0 for 150 seconds
% 7.96/2.44 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_S2m
% 7.96/2.44 # and selection function SelectCQArNTNpEqFirst.
% 7.96/2.44 #
% 7.96/2.44 # Preprocessing time : 0.015 s
% 7.96/2.44 # Presaturation interreduction done
% 7.96/2.44
% 7.96/2.44 # Proof found!
% 7.96/2.44 # SZS status Theorem
% 7.96/2.44 # SZS output start CNFRefutation
% See solution above
% 7.96/2.44 # Training examples: 0 positive, 0 negative
% 7.96/2.44
% 7.96/2.44 # -------------------------------------------------
% 7.96/2.44 # User time : 0.029 s
% 7.96/2.44 # System time : 0.003 s
% 7.96/2.44 # Total time : 0.033 s
% 7.96/2.44 # Maximum resident set size: 7128 pages
% 7.96/2.44
%------------------------------------------------------------------------------