TSTP Solution File: CSR016+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : CSR016+1 : TPTP v8.1.0. Bugfixed v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n021.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 9.15s 2.62s
% Output : CNFRefutation 9.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 14
% Syntax : Number of clauses : 42 ( 18 unt; 8 nHn; 35 RR)
% Number of literals : 79 ( 28 equ; 37 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 : 51 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_98,plain,
( happens(pull,X1)
| epred1_3(X1,X2,X3)
| X2 != forwards
| X3 != push ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-zcy7u_eu/lgb.p',i_0_98) ).
cnf(i_0_31,plain,
( initiates(X1,X2,X3)
| ~ epred1_3(X3,X2,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-zcy7u_eu/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/sandbox2/tmp/enigma-theBenchmark.p-zcy7u_eu/lgb.p',i_0_26) ).
cnf(i_0_9,plain,
( happens(X1,X2)
| X2 != n0
| X1 != push ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-zcy7u_eu/lgb.p',i_0_9) ).
cnf(i_0_71,plain,
plus(n0,n1) = n1,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-zcy7u_eu/lgb.p',i_0_71) ).
cnf(i_0_93,plain,
plus(X1,X2) = plus(X2,X1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-zcy7u_eu/lgb.p',i_0_93) ).
cnf(i_0_60,plain,
( less_or_equal(X1,X2)
| X1 != X2 ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-zcy7u_eu/lgb.p',i_0_60) ).
cnf(i_0_3,negated_conjecture,
~ holdsAt(forwards,n1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-zcy7u_eu/lgb.p',i_0_3) ).
cnf(i_0_44,plain,
( less(X1,n2)
| ~ less_or_equal(X1,n1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-zcy7u_eu/lgb.p',i_0_44) ).
cnf(i_0_42,plain,
( less(X1,n1)
| ~ less_or_equal(X1,n0) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-zcy7u_eu/lgb.p',i_0_42) ).
cnf(i_0_18,plain,
( X1 = push
| X2 = n1
| X2 = n2
| ~ happens(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-zcy7u_eu/lgb.p',i_0_18) ).
cnf(i_0_80,plain,
pull != push,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-zcy7u_eu/lgb.p',i_0_80) ).
cnf(i_0_65,plain,
( ~ less(X1,X2)
| ~ less(X2,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-zcy7u_eu/lgb.p',i_0_65) ).
cnf(i_0_64,plain,
( X1 != X2
| ~ less(X2,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-zcy7u_eu/lgb.p',i_0_64) ).
cnf(c_0_113,plain,
( happens(pull,X1)
| epred1_3(X1,X2,X3)
| X2 != forwards
| X3 != push ),
i_0_98 ).
cnf(c_0_114,plain,
( initiates(X1,X2,X3)
| ~ epred1_3(X3,X2,X1) ),
i_0_31 ).
cnf(c_0_115,plain,
( epred1_3(X1,forwards,push)
| happens(pull,X1) ),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_113])]) ).
cnf(c_0_116,plain,
( holdsAt(X1,plus(X2,n1))
| ~ happens(X3,X2)
| ~ initiates(X3,X1,X2) ),
i_0_26 ).
cnf(c_0_117,plain,
( initiates(push,forwards,X1)
| happens(pull,X1) ),
inference(spm,[status(thm)],[c_0_114,c_0_115]) ).
cnf(c_0_118,plain,
( happens(X1,X2)
| X2 != n0
| X1 != push ),
i_0_9 ).
cnf(c_0_119,plain,
plus(n0,n1) = n1,
i_0_71 ).
cnf(c_0_120,plain,
plus(X1,X2) = plus(X2,X1),
i_0_93 ).
cnf(c_0_121,plain,
( less_or_equal(X1,X2)
| X1 != X2 ),
i_0_60 ).
cnf(c_0_122,plain,
( happens(pull,X1)
| holdsAt(forwards,plus(X1,n1))
| ~ happens(push,X1) ),
inference(spm,[status(thm)],[c_0_116,c_0_117]) ).
cnf(c_0_123,plain,
happens(push,n0),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_118])]) ).
cnf(c_0_124,plain,
plus(n1,n0) = n1,
inference(rw,[status(thm)],[c_0_119,c_0_120]) ).
cnf(c_0_125,negated_conjecture,
~ holdsAt(forwards,n1),
i_0_3 ).
cnf(c_0_126,plain,
( less(X1,n2)
| ~ less_or_equal(X1,n1) ),
i_0_44 ).
cnf(c_0_127,plain,
less_or_equal(X1,X1),
inference(er,[status(thm)],[c_0_121]) ).
cnf(c_0_128,plain,
( less(X1,n1)
| ~ less_or_equal(X1,n0) ),
i_0_42 ).
cnf(c_0_129,plain,
( X1 = push
| X2 = n1
| X2 = n2
| ~ happens(X1,X2) ),
i_0_18 ).
cnf(c_0_130,plain,
happens(pull,n0),
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_122,c_0_123]),c_0_120]),c_0_124]),c_0_125]) ).
cnf(c_0_131,plain,
pull != push,
i_0_80 ).
cnf(c_0_132,plain,
( ~ less(X1,X2)
| ~ less(X2,X1) ),
i_0_65 ).
cnf(c_0_133,plain,
less(n1,n2),
inference(spm,[status(thm)],[c_0_126,c_0_127]) ).
cnf(c_0_134,plain,
less(n0,n1),
inference(spm,[status(thm)],[c_0_128,c_0_127]) ).
cnf(c_0_135,plain,
( n0 = n2
| n0 = n1 ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_129,c_0_130]),c_0_131]) ).
cnf(c_0_136,plain,
~ less(n2,n1),
inference(spm,[status(thm)],[c_0_132,c_0_133]) ).
cnf(c_0_137,plain,
( X1 != X2
| ~ less(X2,X1) ),
i_0_64 ).
cnf(c_0_138,plain,
n0 = n1,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_134,c_0_135]),c_0_136]) ).
cnf(c_0_139,plain,
~ less(X1,X1),
inference(er,[status(thm)],[c_0_137]) ).
cnf(c_0_140,plain,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_134,c_0_138]),c_0_139]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : CSR016+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 : n021.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 03:21:40 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.20/0.45 # ENIGMATIC: Selected SinE mode:
% 0.20/0.46 # Parsing /export/starexec/sandbox2/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
% 9.15/2.62 # ENIGMATIC: Solved by autoschedule-lgb:
% 9.15/2.62 # No SInE strategy applied
% 9.15/2.62 # Trying AutoSched0 for 150 seconds
% 9.15/2.62 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_S2mI
% 9.15/2.62 # and selection function SelectCQArNTNpEqFirst.
% 9.15/2.62 #
% 9.15/2.62 # Preprocessing time : 0.025 s
% 9.15/2.62 # Presaturation interreduction done
% 9.15/2.62
% 9.15/2.62 # Proof found!
% 9.15/2.62 # SZS status Theorem
% 9.15/2.62 # SZS output start CNFRefutation
% See solution above
% 9.15/2.62 # Training examples: 0 positive, 0 negative
% 9.15/2.62
% 9.15/2.62 # -------------------------------------------------
% 9.15/2.62 # User time : 0.045 s
% 9.15/2.62 # System time : 0.004 s
% 9.15/2.62 # Total time : 0.049 s
% 9.15/2.62 # Maximum resident set size: 7124 pages
% 9.15/2.62
%------------------------------------------------------------------------------