TSTP Solution File: CSR018+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : CSR018+1 : TPTP v8.1.0. Bugfixed v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n014.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.53s 2.45s
% Output : CNFRefutation 8.53s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 12
% Syntax : Number of clauses : 35 ( 15 unt; 8 nHn; 30 RR)
% Number of literals : 68 ( 27 equ; 30 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 : 41 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_97,plain,
( happens(push,X1)
| epred1_3(X1,X2,X3)
| X2 != backwards
| X3 != pull ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-uqiz5ao2/lgb.p',i_0_97) ).
cnf(i_0_31,plain,
( initiates(X1,X2,X3)
| ~ epred1_3(X3,X2,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-uqiz5ao2/lgb.p',i_0_31) ).
cnf(i_0_26,plain,
( holdsAt(X1,plus(X2,n1))
| ~ happens(X3,X2)
| ~ initiates(X3,X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-uqiz5ao2/lgb.p',i_0_26) ).
cnf(i_0_8,plain,
( happens(X1,X2)
| X2 != n1
| X1 != pull ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-uqiz5ao2/lgb.p',i_0_8) ).
cnf(i_0_74,plain,
plus(n1,n1) = n2,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-uqiz5ao2/lgb.p',i_0_74) ).
cnf(i_0_2,negated_conjecture,
~ holdsAt(backwards,n2),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-uqiz5ao2/lgb.p',i_0_2) ).
cnf(i_0_60,plain,
( less_or_equal(X1,X2)
| X1 != X2 ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-uqiz5ao2/lgb.p',i_0_60) ).
cnf(i_0_16,plain,
( X1 = pull
| X2 = n0
| X2 = n2
| ~ happens(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-uqiz5ao2/lgb.p',i_0_16) ).
cnf(i_0_80,plain,
pull != push,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-uqiz5ao2/lgb.p',i_0_80) ).
cnf(i_0_44,plain,
( less(X1,n2)
| ~ less_or_equal(X1,n1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-uqiz5ao2/lgb.p',i_0_44) ).
cnf(i_0_70,plain,
plus(n0,n0) = n0,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-uqiz5ao2/lgb.p',i_0_70) ).
cnf(i_0_64,plain,
( X1 != X2
| ~ less(X2,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-uqiz5ao2/lgb.p',i_0_64) ).
cnf(c_0_110,plain,
( happens(push,X1)
| epred1_3(X1,X2,X3)
| X2 != backwards
| X3 != pull ),
i_0_97 ).
cnf(c_0_111,plain,
( initiates(X1,X2,X3)
| ~ epred1_3(X3,X2,X1) ),
i_0_31 ).
cnf(c_0_112,plain,
( epred1_3(X1,backwards,pull)
| happens(push,X1) ),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_110])]) ).
cnf(c_0_113,plain,
( holdsAt(X1,plus(X2,n1))
| ~ happens(X3,X2)
| ~ initiates(X3,X1,X2) ),
i_0_26 ).
cnf(c_0_114,plain,
( initiates(pull,backwards,X1)
| happens(push,X1) ),
inference(spm,[status(thm)],[c_0_111,c_0_112]) ).
cnf(c_0_115,plain,
( happens(X1,X2)
| X2 != n1
| X1 != pull ),
i_0_8 ).
cnf(c_0_116,plain,
( happens(push,X1)
| holdsAt(backwards,plus(X1,n1))
| ~ happens(pull,X1) ),
inference(spm,[status(thm)],[c_0_113,c_0_114]) ).
cnf(c_0_117,plain,
happens(pull,n1),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_115])]) ).
cnf(c_0_118,plain,
plus(n1,n1) = n2,
i_0_74 ).
cnf(c_0_119,negated_conjecture,
~ holdsAt(backwards,n2),
i_0_2 ).
cnf(c_0_120,plain,
( less_or_equal(X1,X2)
| X1 != X2 ),
i_0_60 ).
cnf(c_0_121,plain,
( X1 = pull
| X2 = n0
| X2 = n2
| ~ happens(X1,X2) ),
i_0_16 ).
cnf(c_0_122,plain,
happens(push,n1),
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_116,c_0_117]),c_0_118]),c_0_119]) ).
cnf(c_0_123,plain,
pull != push,
i_0_80 ).
cnf(c_0_124,plain,
( less(X1,n2)
| ~ less_or_equal(X1,n1) ),
i_0_44 ).
cnf(c_0_125,plain,
less_or_equal(X1,X1),
inference(er,[status(thm)],[c_0_120]) ).
cnf(c_0_126,plain,
plus(n0,n0) = n0,
i_0_70 ).
cnf(c_0_127,plain,
( n2 = n1
| n0 = n1 ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_121,c_0_122]),c_0_123]) ).
cnf(c_0_128,plain,
( X1 != X2
| ~ less(X2,X1) ),
i_0_64 ).
cnf(c_0_129,plain,
less(n1,n2),
inference(spm,[status(thm)],[c_0_124,c_0_125]) ).
cnf(c_0_130,plain,
n2 = n1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_126,c_0_127]),c_0_118])]) ).
cnf(c_0_131,plain,
~ less(X1,X1),
inference(er,[status(thm)],[c_0_128]) ).
cnf(c_0_132,plain,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_129,c_0_130]),c_0_131]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.11 % Problem : CSR018+1 : TPTP v8.1.0. Bugfixed v3.1.0.
% 0.09/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.33 % Computer : n014.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Sat Jun 11 05:28:25 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.19/0.43 # ENIGMATIC: Selected SinE mode:
% 0.19/0.44 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.44 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.19/0.44 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.19/0.44 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 8.53/2.45 # ENIGMATIC: Solved by autoschedule-lgb:
% 8.53/2.45 # No SInE strategy applied
% 8.53/2.45 # Trying AutoSched0 for 150 seconds
% 8.53/2.45 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_S2mI
% 8.53/2.45 # and selection function SelectCQArNTNpEqFirst.
% 8.53/2.45 #
% 8.53/2.45 # Preprocessing time : 0.015 s
% 8.53/2.45 # Presaturation interreduction done
% 8.53/2.45
% 8.53/2.45 # Proof found!
% 8.53/2.45 # SZS status Theorem
% 8.53/2.45 # SZS output start CNFRefutation
% See solution above
% 8.53/2.45 # Training examples: 0 positive, 0 negative
% 8.53/2.45
% 8.53/2.45 # -------------------------------------------------
% 8.53/2.45 # User time : 0.052 s
% 8.53/2.45 # System time : 0.007 s
% 8.53/2.45 # Total time : 0.059 s
% 8.53/2.45 # Maximum resident set size: 7124 pages
% 8.53/2.45
%------------------------------------------------------------------------------