TSTP Solution File: CSR015+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : CSR015+1 : TPTP v8.1.0. Bugfixed v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n019.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 7.53s 2.47s
% Output : CNFRefutation 7.53s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 9
% Syntax : Number of clauses : 29 ( 12 unt; 5 nHn; 22 RR)
% Number of literals : 59 ( 17 equ; 28 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-3 aty)
% Number of functors : 6 ( 6 usr; 5 con; 0-2 aty)
% Number of variables : 43 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_128,plain,
( happens(pull,X1)
| epred2_3(X1,X2,X3)
| X2 != backwards
| X3 != push ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-0yly0wuo/lgb.p',i_0_128) ).
cnf(i_0_158,plain,
( epred3_3(X1,X2,X3)
| X2 != backwards
| X3 != pull
| ~ happens(push,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-0yly0wuo/lgb.p',i_0_158) ).
cnf(i_0_8,plain,
( happens(X1,X2)
| X2 != n0
| X1 != push ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-0yly0wuo/lgb.p',i_0_8) ).
cnf(i_0_159,plain,
( epred3_3(X1,X2,X3)
| ~ epred2_3(X1,X2,X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-0yly0wuo/lgb.p',i_0_159) ).
cnf(i_0_94,plain,
( terminates(X1,X2,X3)
| ~ epred3_3(X3,X2,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-0yly0wuo/lgb.p',i_0_94) ).
cnf(i_0_71,plain,
plus(n0,n1) = n1,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-0yly0wuo/lgb.p',i_0_71) ).
cnf(i_0_93,plain,
plus(X1,X2) = plus(X2,X1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-0yly0wuo/lgb.p',i_0_93) ).
cnf(i_0_29,plain,
( ~ happens(X1,X2)
| ~ terminates(X1,X3,X2)
| ~ holdsAt(X3,plus(X2,n1)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-0yly0wuo/lgb.p',i_0_29) ).
cnf(i_0_66,negated_conjecture,
holdsAt(backwards,n1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-0yly0wuo/lgb.p',i_0_66) ).
cnf(c_0_169,plain,
( happens(pull,X1)
| epred2_3(X1,X2,X3)
| X2 != backwards
| X3 != push ),
i_0_128 ).
cnf(c_0_170,plain,
( epred3_3(X1,X2,X3)
| X2 != backwards
| X3 != pull
| ~ happens(push,X1) ),
i_0_158 ).
cnf(c_0_171,plain,
( happens(X1,X2)
| X2 != n0
| X1 != push ),
i_0_8 ).
cnf(c_0_172,plain,
( epred3_3(X1,X2,X3)
| ~ epred2_3(X1,X2,X3) ),
i_0_159 ).
cnf(c_0_173,plain,
( epred2_3(X1,backwards,push)
| happens(pull,X1) ),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_169])]) ).
cnf(c_0_174,plain,
( epred3_3(X1,backwards,pull)
| ~ happens(push,X1) ),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_170])]) ).
cnf(c_0_175,plain,
happens(push,n0),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_171])]) ).
cnf(c_0_176,plain,
( terminates(X1,X2,X3)
| ~ epred3_3(X3,X2,X1) ),
i_0_94 ).
cnf(c_0_177,plain,
( happens(pull,X1)
| epred3_3(X1,backwards,push) ),
inference(spm,[status(thm)],[c_0_172,c_0_173]) ).
cnf(c_0_178,plain,
epred3_3(n0,backwards,pull),
inference(spm,[status(thm)],[c_0_174,c_0_175]) ).
cnf(c_0_179,plain,
plus(n0,n1) = n1,
i_0_71 ).
cnf(c_0_180,plain,
plus(X1,X2) = plus(X2,X1),
i_0_93 ).
cnf(c_0_181,plain,
( ~ happens(X1,X2)
| ~ terminates(X1,X3,X2)
| ~ holdsAt(X3,plus(X2,n1)) ),
i_0_29 ).
cnf(c_0_182,plain,
( happens(pull,X1)
| terminates(push,backwards,X1) ),
inference(spm,[status(thm)],[c_0_176,c_0_177]) ).
cnf(c_0_183,plain,
terminates(pull,backwards,n0),
inference(spm,[status(thm)],[c_0_176,c_0_178]) ).
cnf(c_0_184,plain,
plus(n1,n0) = n1,
inference(rw,[status(thm)],[c_0_179,c_0_180]) ).
cnf(c_0_185,negated_conjecture,
holdsAt(backwards,n1),
i_0_66 ).
cnf(c_0_186,plain,
( happens(pull,X1)
| ~ holdsAt(backwards,plus(X1,n1))
| ~ happens(push,X1) ),
inference(spm,[status(thm)],[c_0_181,c_0_182]) ).
cnf(c_0_187,plain,
~ happens(pull,n0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_181,c_0_183]),c_0_180]),c_0_184]),c_0_185])]) ).
cnf(c_0_188,plain,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_186,c_0_175]),c_0_180]),c_0_184]),c_0_185])]),c_0_187]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : CSR015+1 : TPTP v8.1.0. Bugfixed v3.1.0.
% 0.07/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.35 % Computer : n019.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Thu Jun 9 17:39:56 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.19/0.46 # ENIGMATIC: Selected SinE mode:
% 0.19/0.47 # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.47 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.19/0.47 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.19/0.47 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 7.53/2.47 # ENIGMATIC: Solved by autoschedule-lgb:
% 7.53/2.47 # No SInE strategy applied
% 7.53/2.47 # Trying AutoSched0 for 150 seconds
% 7.53/2.47 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_S2m
% 7.53/2.47 # and selection function SelectCQArNTNpEqFirst.
% 7.53/2.47 #
% 7.53/2.47 # Preprocessing time : 0.014 s
% 7.53/2.47 # Presaturation interreduction done
% 7.53/2.47
% 7.53/2.47 # Proof found!
% 7.53/2.47 # SZS status Theorem
% 7.53/2.47 # SZS output start CNFRefutation
% See solution above
% 7.53/2.47 # Training examples: 0 positive, 0 negative
% 7.53/2.47
% 7.53/2.47 # -------------------------------------------------
% 7.53/2.47 # User time : 0.024 s
% 7.53/2.47 # System time : 0.005 s
% 7.53/2.47 # Total time : 0.029 s
% 7.53/2.47 # Maximum resident set size: 7124 pages
% 7.53/2.47
%------------------------------------------------------------------------------