TSTP Solution File: CSR017+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : CSR017+1 : TPTP v8.1.0. Bugfixed v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n027.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:33 EDT 2022
% Result : Theorem 8.57s 2.43s
% Output : CNFRefutation 8.57s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 17
% Syntax : Number of clauses : 54 ( 26 unt; 16 nHn; 51 RR)
% Number of literals : 103 ( 30 equ; 40 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 1 prp; 0-3 aty)
% Number of functors : 9 ( 9 usr; 7 con; 0-2 aty)
% Number of variables : 60 ( 6 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_34,plain,
( holdsAt(X1,X2)
| releasedAt(X1,plus(X2,n1))
| initiates(esk2_2(X1,X2),X1,X2)
| ~ holdsAt(X1,plus(X2,n1)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-hx8zcanc/lgb.p',i_0_34) ).
cnf(i_0_67,hypothesis,
~ releasedAt(X1,X2),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-hx8zcanc/lgb.p',i_0_67) ).
cnf(i_0_35,plain,
( holdsAt(X1,X2)
| happens(esk2_2(X1,X2),X2)
| releasedAt(X1,plus(X2,n1))
| ~ holdsAt(X1,plus(X2,n1)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-hx8zcanc/lgb.p',i_0_35) ).
cnf(i_0_93,plain,
plus(X1,X2) = plus(X2,X1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-hx8zcanc/lgb.p',i_0_93) ).
cnf(i_0_71,plain,
plus(n0,n1) = n1,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-hx8zcanc/lgb.p',i_0_71) ).
cnf(i_0_68,negated_conjecture,
holdsAt(spinning,n1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-hx8zcanc/lgb.p',i_0_68) ).
cnf(i_0_69,hypothesis,
~ holdsAt(spinning,n0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-hx8zcanc/lgb.p',i_0_69) ).
cnf(i_0_31,plain,
( epred1_3(X1,X2,X3)
| ~ initiates(X3,X2,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-hx8zcanc/lgb.p',i_0_31) ).
cnf(i_0_59,plain,
( less_or_equal(X1,X2)
| X1 != X2 ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-hx8zcanc/lgb.p',i_0_59) ).
cnf(i_0_18,plain,
( X1 = n1
| X1 = n2
| X2 = push
| ~ happens(X2,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-hx8zcanc/lgb.p',i_0_18) ).
cnf(i_0_116,plain,
( X1 = forwards
| X2 = pull
| ~ epred1_3(X3,X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-hx8zcanc/lgb.p',i_0_116) ).
cnf(i_0_4,plain,
forwards != spinning,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-hx8zcanc/lgb.p',i_0_4) ).
cnf(i_0_43,plain,
( less(X1,n2)
| ~ less_or_equal(X1,n1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-hx8zcanc/lgb.p',i_0_43) ).
cnf(i_0_41,plain,
( less(X1,n1)
| ~ less_or_equal(X1,n0) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-hx8zcanc/lgb.p',i_0_41) ).
cnf(i_0_80,plain,
pull != push,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-hx8zcanc/lgb.p',i_0_80) ).
cnf(i_0_64,plain,
( ~ less(X1,X2)
| ~ less(X2,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-hx8zcanc/lgb.p',i_0_64) ).
cnf(i_0_63,plain,
( X1 != X2
| ~ less(X2,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-hx8zcanc/lgb.p',i_0_63) ).
cnf(c_0_134,plain,
( holdsAt(X1,X2)
| releasedAt(X1,plus(X2,n1))
| initiates(esk2_2(X1,X2),X1,X2)
| ~ holdsAt(X1,plus(X2,n1)) ),
i_0_34 ).
cnf(c_0_135,hypothesis,
~ releasedAt(X1,X2),
i_0_67 ).
cnf(c_0_136,plain,
( holdsAt(X1,X2)
| happens(esk2_2(X1,X2),X2)
| releasedAt(X1,plus(X2,n1))
| ~ holdsAt(X1,plus(X2,n1)) ),
i_0_35 ).
cnf(c_0_137,plain,
( holdsAt(X1,X2)
| initiates(esk2_2(X1,X2),X1,X2)
| ~ holdsAt(X1,plus(X2,n1)) ),
inference(sr,[status(thm)],[c_0_134,c_0_135]) ).
cnf(c_0_138,plain,
plus(X1,X2) = plus(X2,X1),
i_0_93 ).
cnf(c_0_139,plain,
plus(n0,n1) = n1,
i_0_71 ).
cnf(c_0_140,plain,
( holdsAt(X1,X2)
| happens(esk2_2(X1,X2),X2)
| ~ holdsAt(X1,plus(X2,n1)) ),
inference(sr,[status(thm)],[c_0_136,c_0_135]) ).
cnf(c_0_141,plain,
( holdsAt(X1,X2)
| initiates(esk2_2(X1,X2),X1,X2)
| ~ holdsAt(X1,plus(n1,X2)) ),
inference(spm,[status(thm)],[c_0_137,c_0_138]) ).
cnf(c_0_142,plain,
plus(n1,n0) = n1,
inference(rw,[status(thm)],[c_0_139,c_0_138]) ).
cnf(c_0_143,plain,
( holdsAt(X1,X2)
| happens(esk2_2(X1,X2),X2)
| ~ holdsAt(X1,plus(n1,X2)) ),
inference(spm,[status(thm)],[c_0_140,c_0_138]) ).
cnf(c_0_144,plain,
( holdsAt(X1,n0)
| initiates(esk2_2(X1,n0),X1,n0)
| ~ holdsAt(X1,n1) ),
inference(spm,[status(thm)],[c_0_141,c_0_142]) ).
cnf(c_0_145,negated_conjecture,
holdsAt(spinning,n1),
i_0_68 ).
cnf(c_0_146,hypothesis,
~ holdsAt(spinning,n0),
i_0_69 ).
cnf(c_0_147,plain,
( holdsAt(X1,n0)
| happens(esk2_2(X1,n0),n0)
| ~ holdsAt(X1,n1) ),
inference(spm,[status(thm)],[c_0_143,c_0_142]) ).
cnf(c_0_148,plain,
( epred1_3(X1,X2,X3)
| ~ initiates(X3,X2,X1) ),
i_0_31 ).
cnf(c_0_149,negated_conjecture,
initiates(esk2_2(spinning,n0),spinning,n0),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_144,c_0_145]),c_0_146]) ).
cnf(c_0_150,plain,
( less_or_equal(X1,X2)
| X1 != X2 ),
i_0_59 ).
cnf(c_0_151,plain,
( X1 = n1
| X1 = n2
| X2 = push
| ~ happens(X2,X1) ),
i_0_18 ).
cnf(c_0_152,negated_conjecture,
happens(esk2_2(spinning,n0),n0),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_147,c_0_145]),c_0_146]) ).
cnf(c_0_153,plain,
( X1 = forwards
| X2 = pull
| ~ epred1_3(X3,X1,X2) ),
i_0_116 ).
cnf(c_0_154,plain,
epred1_3(n0,spinning,esk2_2(spinning,n0)),
inference(spm,[status(thm)],[c_0_148,c_0_149]) ).
cnf(c_0_155,plain,
forwards != spinning,
i_0_4 ).
cnf(c_0_156,plain,
( less(X1,n2)
| ~ less_or_equal(X1,n1) ),
i_0_43 ).
cnf(c_0_157,plain,
less_or_equal(X1,X1),
inference(er,[status(thm)],[c_0_150]) ).
cnf(c_0_158,plain,
( less(X1,n1)
| ~ less_or_equal(X1,n0) ),
i_0_41 ).
cnf(c_0_159,plain,
( esk2_2(spinning,n0) = push
| n0 = n2
| n0 = n1 ),
inference(spm,[status(thm)],[c_0_151,c_0_152]) ).
cnf(c_0_160,plain,
esk2_2(spinning,n0) = pull,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_153,c_0_154]),c_0_155]) ).
cnf(c_0_161,plain,
pull != push,
i_0_80 ).
cnf(c_0_162,plain,
( ~ less(X1,X2)
| ~ less(X2,X1) ),
i_0_64 ).
cnf(c_0_163,plain,
less(n1,n2),
inference(spm,[status(thm)],[c_0_156,c_0_157]) ).
cnf(c_0_164,plain,
less(n0,n1),
inference(spm,[status(thm)],[c_0_158,c_0_157]) ).
cnf(c_0_165,plain,
( n0 = n1
| n0 = n2 ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_159,c_0_160]),c_0_161]) ).
cnf(c_0_166,plain,
~ less(n2,n1),
inference(spm,[status(thm)],[c_0_162,c_0_163]) ).
cnf(c_0_167,plain,
( X1 != X2
| ~ less(X2,X1) ),
i_0_63 ).
cnf(c_0_168,plain,
n0 = n1,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_164,c_0_165]),c_0_166]) ).
cnf(c_0_169,plain,
~ less(X1,X1),
inference(er,[status(thm)],[c_0_167]) ).
cnf(c_0_170,plain,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_164,c_0_168]),c_0_169]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : CSR017+1 : TPTP v8.1.0. Bugfixed v3.1.0.
% 0.11/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n027.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 : Fri Jun 10 05:16:15 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.44 # ENIGMATIC: Selected SinE mode:
% 0.18/0.44 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.18/0.44 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.18/0.44 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.18/0.44 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 8.57/2.43 # ENIGMATIC: Solved by autoschedule-lgb:
% 8.57/2.43 # No SInE strategy applied
% 8.57/2.43 # Trying AutoSched0 for 150 seconds
% 8.57/2.43 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_S2m
% 8.57/2.43 # and selection function SelectCQArNTNpEqFirst.
% 8.57/2.43 #
% 8.57/2.43 # Preprocessing time : 0.026 s
% 8.57/2.43 # Presaturation interreduction done
% 8.57/2.43
% 8.57/2.43 # Proof found!
% 8.57/2.43 # SZS status Theorem
% 8.57/2.43 # SZS output start CNFRefutation
% See solution above
% 8.57/2.43 # Training examples: 0 positive, 0 negative
% 8.57/2.43
% 8.57/2.43 # -------------------------------------------------
% 8.57/2.43 # User time : 0.048 s
% 8.57/2.43 # System time : 0.005 s
% 8.57/2.43 # Total time : 0.053 s
% 8.57/2.43 # Maximum resident set size: 7128 pages
% 8.57/2.43
%------------------------------------------------------------------------------