TSTP Solution File: GRA002+3 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : GRA002+3 : TPTP v8.1.0. Bugfixed v3.2.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 : Sat Jul 16 07:15:22 EDT 2022
% Result : Theorem 7.35s 2.22s
% Output : CNFRefutation 7.35s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 12
% Syntax : Number of clauses : 40 ( 12 unt; 10 nHn; 38 RR)
% Number of literals : 107 ( 20 equ; 60 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 10 ( 8 usr; 2 prp; 0-3 aty)
% Number of functors : 13 ( 13 usr; 7 con; 0-4 aty)
% Number of variables : 98 ( 44 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_34,plain,
( precedes(X1,X2,X3)
| ~ on_path(X2,X3)
| ~ on_path(X1,X3)
| ~ sequential(X1,X2)
| ~ path(X4,X5,X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ych641cg/lgb.p',i_0_34) ).
cnf(i_0_54,plain,
( path(X1,X2,X3)
| ~ shortest_path(X1,X2,X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ych641cg/lgb.p',i_0_54) ).
cnf(i_0_45,lemma,
( triangle(X1,X2,esk9_4(X3,X4,X1,X2))
| ~ complete
| ~ sequential(X1,X2)
| ~ shortest_path(X3,X4,X5)
| ~ precedes(X1,X2,X5) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ych641cg/lgb.p',i_0_45) ).
cnf(i_0_16,negated_conjecture,
complete,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ych641cg/lgb.p',i_0_16) ).
cnf(i_0_15,negated_conjecture,
shortest_path(esk4_0,esk5_0,esk3_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ych641cg/lgb.p',i_0_15) ).
cnf(i_0_46,plain,
( number_of_in(triangles,X1) = number_of_in(sequential_pairs,X1)
| ~ path(X2,X3,X1)
| ~ triangle(esk10_1(X1),esk11_1(X1),X4) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ych641cg/lgb.p',i_0_46) ).
cnf(i_0_47,plain,
( number_of_in(triangles,X1) = number_of_in(sequential_pairs,X1)
| sequential(esk10_1(X1),esk11_1(X1))
| ~ path(X2,X3,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ych641cg/lgb.p',i_0_47) ).
cnf(i_0_49,plain,
( number_of_in(triangles,X1) = number_of_in(sequential_pairs,X1)
| on_path(esk10_1(X1),X1)
| ~ path(X2,X3,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ych641cg/lgb.p',i_0_49) ).
cnf(i_0_48,plain,
( number_of_in(triangles,X1) = number_of_in(sequential_pairs,X1)
| on_path(esk11_1(X1),X1)
| ~ path(X2,X3,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ych641cg/lgb.p',i_0_48) ).
cnf(i_0_23,plain,
( minus(length_of(X1),n1) = number_of_in(sequential_pairs,X1)
| ~ path(X2,X3,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ych641cg/lgb.p',i_0_23) ).
cnf(i_0_14,negated_conjecture,
~ less_or_equal(minus(length_of(esk3_0),n1),number_of_in(triangles,graph)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ych641cg/lgb.p',i_0_14) ).
cnf(i_0_9,plain,
less_or_equal(number_of_in(X1,X2),number_of_in(X1,graph)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ych641cg/lgb.p',i_0_9) ).
cnf(c_0_67,plain,
( precedes(X1,X2,X3)
| ~ on_path(X2,X3)
| ~ on_path(X1,X3)
| ~ sequential(X1,X2)
| ~ path(X4,X5,X3) ),
i_0_34 ).
cnf(c_0_68,plain,
( path(X1,X2,X3)
| ~ shortest_path(X1,X2,X3) ),
i_0_54 ).
cnf(c_0_69,lemma,
( triangle(X1,X2,esk9_4(X3,X4,X1,X2))
| ~ complete
| ~ sequential(X1,X2)
| ~ shortest_path(X3,X4,X5)
| ~ precedes(X1,X2,X5) ),
i_0_45 ).
cnf(c_0_70,negated_conjecture,
complete,
i_0_16 ).
cnf(c_0_71,plain,
( precedes(X1,X2,X3)
| ~ on_path(X2,X3)
| ~ on_path(X1,X3)
| ~ sequential(X1,X2)
| ~ shortest_path(X4,X5,X3) ),
inference(spm,[status(thm)],[c_0_67,c_0_68]) ).
cnf(c_0_72,negated_conjecture,
shortest_path(esk4_0,esk5_0,esk3_0),
i_0_15 ).
cnf(c_0_73,lemma,
( triangle(X1,X2,esk9_4(X3,X4,X1,X2))
| ~ precedes(X1,X2,X5)
| ~ sequential(X1,X2)
| ~ shortest_path(X3,X4,X5) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_69,c_0_70])]) ).
cnf(c_0_74,negated_conjecture,
( precedes(X1,X2,esk3_0)
| ~ on_path(X2,esk3_0)
| ~ on_path(X1,esk3_0)
| ~ sequential(X1,X2) ),
inference(spm,[status(thm)],[c_0_71,c_0_72]) ).
cnf(c_0_75,plain,
( number_of_in(triangles,X1) = number_of_in(sequential_pairs,X1)
| ~ path(X2,X3,X1)
| ~ triangle(esk10_1(X1),esk11_1(X1),X4) ),
i_0_46 ).
cnf(c_0_76,lemma,
( triangle(X1,X2,esk9_4(X3,X4,X1,X2))
| ~ on_path(X2,esk3_0)
| ~ on_path(X1,esk3_0)
| ~ sequential(X1,X2)
| ~ shortest_path(X3,X4,esk3_0) ),
inference(spm,[status(thm)],[c_0_73,c_0_74]) ).
cnf(c_0_77,plain,
( number_of_in(triangles,X1) = number_of_in(sequential_pairs,X1)
| sequential(esk10_1(X1),esk11_1(X1))
| ~ path(X2,X3,X1) ),
i_0_47 ).
cnf(c_0_78,plain,
( number_of_in(triangles,X1) = number_of_in(sequential_pairs,X1)
| ~ on_path(esk11_1(X1),esk3_0)
| ~ on_path(esk10_1(X1),esk3_0)
| ~ path(X2,X3,X1)
| ~ shortest_path(X4,X5,esk3_0) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_75,c_0_76]),c_0_77]) ).
cnf(c_0_79,plain,
( number_of_in(triangles,X1) = number_of_in(sequential_pairs,X1)
| on_path(esk10_1(X1),X1)
| ~ path(X2,X3,X1) ),
i_0_49 ).
cnf(c_0_80,plain,
( number_of_in(triangles,X1) = number_of_in(sequential_pairs,X1)
| on_path(esk11_1(X1),X1)
| ~ path(X2,X3,X1) ),
i_0_48 ).
cnf(c_0_81,plain,
( minus(length_of(X1),n1) = number_of_in(sequential_pairs,X1)
| ~ path(X2,X3,X1) ),
i_0_23 ).
cnf(c_0_82,negated_conjecture,
( number_of_in(triangles,X1) = number_of_in(sequential_pairs,X1)
| ~ on_path(esk11_1(X1),esk3_0)
| ~ on_path(esk10_1(X1),esk3_0)
| ~ path(X2,X3,X1) ),
inference(spm,[status(thm)],[c_0_78,c_0_72]) ).
cnf(c_0_83,plain,
( number_of_in(triangles,X1) = number_of_in(sequential_pairs,X1)
| on_path(esk10_1(X1),X1)
| ~ shortest_path(X2,X3,X1) ),
inference(spm,[status(thm)],[c_0_79,c_0_68]) ).
cnf(c_0_84,plain,
( number_of_in(triangles,X1) = number_of_in(sequential_pairs,X1)
| on_path(esk11_1(X1),X1)
| ~ shortest_path(X2,X3,X1) ),
inference(spm,[status(thm)],[c_0_80,c_0_68]) ).
cnf(c_0_85,plain,
( minus(length_of(X1),n1) = number_of_in(sequential_pairs,X1)
| ~ shortest_path(X2,X3,X1) ),
inference(spm,[status(thm)],[c_0_81,c_0_68]) ).
cnf(c_0_86,plain,
( number_of_in(triangles,X1) = number_of_in(sequential_pairs,X1)
| ~ on_path(esk11_1(X1),esk3_0)
| ~ on_path(esk10_1(X1),esk3_0)
| ~ shortest_path(X2,X3,X1) ),
inference(spm,[status(thm)],[c_0_82,c_0_68]) ).
cnf(c_0_87,negated_conjecture,
( number_of_in(triangles,esk3_0) = number_of_in(sequential_pairs,esk3_0)
| on_path(esk10_1(esk3_0),esk3_0) ),
inference(spm,[status(thm)],[c_0_83,c_0_72]) ).
cnf(c_0_88,negated_conjecture,
( number_of_in(triangles,esk3_0) = number_of_in(sequential_pairs,esk3_0)
| on_path(esk11_1(esk3_0),esk3_0) ),
inference(spm,[status(thm)],[c_0_84,c_0_72]) ).
cnf(c_0_89,negated_conjecture,
~ less_or_equal(minus(length_of(esk3_0),n1),number_of_in(triangles,graph)),
i_0_14 ).
cnf(c_0_90,negated_conjecture,
minus(length_of(esk3_0),n1) = number_of_in(sequential_pairs,esk3_0),
inference(spm,[status(thm)],[c_0_85,c_0_72]) ).
cnf(c_0_91,plain,
less_or_equal(number_of_in(X1,X2),number_of_in(X1,graph)),
i_0_9 ).
cnf(c_0_92,negated_conjecture,
number_of_in(triangles,esk3_0) = number_of_in(sequential_pairs,esk3_0),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_86,c_0_72]),c_0_87]),c_0_88]) ).
cnf(c_0_93,negated_conjecture,
~ less_or_equal(number_of_in(sequential_pairs,esk3_0),number_of_in(triangles,graph)),
inference(rw,[status(thm)],[c_0_89,c_0_90]) ).
cnf(c_0_94,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_91,c_0_92]),c_0_93]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : GRA002+3 : TPTP v8.1.0. Bugfixed v3.2.0.
% 0.07/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.14/0.33 % Computer : n021.cluster.edu
% 0.14/0.33 % Model : x86_64 x86_64
% 0.14/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.33 % Memory : 8042.1875MB
% 0.14/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.33 % CPULimit : 300
% 0.14/0.33 % WCLimit : 600
% 0.14/0.33 % DateTime : Tue May 31 02:48:16 EDT 2022
% 0.14/0.34 % CPUTime :
% 0.20/0.45 # ENIGMATIC: Selected SinE mode:
% 0.20/0.45 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.45 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.20/0.45 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.20/0.45 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 7.35/2.22 # ENIGMATIC: Solved by autoschedule-lgb:
% 7.35/2.22 # No SInE strategy applied
% 7.35/2.22 # Trying AutoSched0 for 150 seconds
% 7.35/2.22 # AutoSched0-Mode selected heuristic G_E___207_C01_F1_SE_CS_SP_PI_S5PRR_S0Y
% 7.35/2.22 # and selection function SelectMaxLComplexAvoidPosPred.
% 7.35/2.22 #
% 7.35/2.22 # Preprocessing time : 0.023 s
% 7.35/2.22
% 7.35/2.22 # Proof found!
% 7.35/2.22 # SZS status Theorem
% 7.35/2.22 # SZS output start CNFRefutation
% See solution above
% 7.35/2.22 # Training examples: 0 positive, 0 negative
% 7.35/2.22
% 7.35/2.22 # -------------------------------------------------
% 7.35/2.22 # User time : 0.041 s
% 7.35/2.22 # System time : 0.005 s
% 7.35/2.22 # Total time : 0.046 s
% 7.35/2.22 # Maximum resident set size: 7128 pages
% 7.35/2.22
%------------------------------------------------------------------------------