TSTP Solution File: GRA010+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : GRA010+1 : TPTP v8.1.0. Bugfixed v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n026.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:24 EDT 2022
% Result : Theorem 7.71s 2.40s
% Output : CNFRefutation 7.71s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 7
% Syntax : Number of clauses : 19 ( 8 unt; 6 nHn; 19 RR)
% Number of literals : 44 ( 11 equ; 22 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-3 aty)
% Number of functors : 9 ( 9 usr; 5 con; 0-2 aty)
% Number of variables : 35 ( 22 sgn)
% Comments :
%------------------------------------------------------------------------------
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/sandbox2/tmp/enigma-theBenchmark.p-wzljtvji/input.p',i_0_46) ).
cnf(i_0_2,negated_conjecture,
( triangle(X1,X2,esk4_2(X1,X2))
| ~ sequential(X1,X2)
| ~ on_path(X2,esk1_0)
| ~ on_path(X1,esk1_0) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-wzljtvji/input.p',i_0_2) ).
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/sandbox2/tmp/enigma-theBenchmark.p-wzljtvji/input.p',i_0_47) ).
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/sandbox2/tmp/enigma-theBenchmark.p-wzljtvji/input.p',i_0_48) ).
cnf(i_0_3,negated_conjecture,
path(esk2_0,esk3_0,esk1_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-wzljtvji/input.p',i_0_3) ).
cnf(i_0_1,negated_conjecture,
number_of_in(triangles,esk1_0) != number_of_in(sequential_pairs,esk1_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-wzljtvji/input.p',i_0_1) ).
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/sandbox2/tmp/enigma-theBenchmark.p-wzljtvji/input.p',i_0_49) ).
cnf(c_0_57,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_58,negated_conjecture,
( triangle(X1,X2,esk4_2(X1,X2))
| ~ sequential(X1,X2)
| ~ on_path(X2,esk1_0)
| ~ on_path(X1,esk1_0) ),
i_0_2 ).
cnf(c_0_59,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_60,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_61,negated_conjecture,
path(esk2_0,esk3_0,esk1_0),
i_0_3 ).
cnf(c_0_62,negated_conjecture,
number_of_in(triangles,esk1_0) != number_of_in(sequential_pairs,esk1_0),
i_0_1 ).
cnf(c_0_63,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_64,negated_conjecture,
( number_of_in(triangles,X1) = number_of_in(sequential_pairs,X1)
| ~ on_path(esk11_1(X1),esk1_0)
| ~ on_path(esk10_1(X1),esk1_0)
| ~ path(X2,X3,X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_58]),c_0_59]) ).
cnf(c_0_65,negated_conjecture,
on_path(esk11_1(esk1_0),esk1_0),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_61]),c_0_62]) ).
cnf(c_0_66,negated_conjecture,
on_path(esk10_1(esk1_0),esk1_0),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_63,c_0_61]),c_0_62]) ).
cnf(c_0_67,negated_conjecture,
~ path(X1,X2,esk1_0),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_64,c_0_65]),c_0_66])]),c_0_62]) ).
cnf(c_0_68,negated_conjecture,
$false,
inference(sr,[status(thm)],[c_0_61,c_0_67]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : GRA010+1 : TPTP v8.1.0. Bugfixed v3.2.0.
% 0.11/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n026.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 : Mon May 30 23:16:42 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.44 # ENIGMATIC: Selected SinE mode:
% 0.18/0.45 # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.18/0.45 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.18/0.45 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.18/0.45 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 7.71/2.40 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_S0Y:
% 7.71/2.40 # Version: 2.1pre011
% 7.71/2.40 # Preprocessing time : 0.018 s
% 7.71/2.40
% 7.71/2.40 # Proof found!
% 7.71/2.40 # SZS status Theorem
% 7.71/2.40 # SZS output start CNFRefutation
% See solution above
% 7.71/2.40 # Proof object total steps : 19
% 7.71/2.40 # Proof object clause steps : 12
% 7.71/2.40 # Proof object formula steps : 7
% 7.71/2.40 # Proof object conjectures : 11
% 7.71/2.40 # Proof object clause conjectures : 8
% 7.71/2.40 # Proof object formula conjectures : 3
% 7.71/2.40 # Proof object initial clauses used : 7
% 7.71/2.40 # Proof object initial formulas used : 7
% 7.71/2.40 # Proof object generating inferences : 4
% 7.71/2.40 # Proof object simplifying inferences : 7
% 7.71/2.40 # Training examples: 0 positive, 0 negative
% 7.71/2.40 # Parsed axioms : 62
% 7.71/2.40 # Removed by relevancy pruning/SinE : 0
% 7.71/2.40 # Initial clauses : 62
% 7.71/2.40 # Removed in clause preprocessing : 0
% 7.71/2.40 # Initial clauses in saturation : 62
% 7.71/2.40 # Processed clauses : 90
% 7.71/2.40 # ...of these trivial : 1
% 7.71/2.40 # ...subsumed : 1
% 7.71/2.40 # ...remaining for further processing : 88
% 7.71/2.40 # Other redundant clauses eliminated : 2
% 7.71/2.40 # Clauses deleted for lack of memory : 0
% 7.71/2.40 # Backward-subsumed : 0
% 7.71/2.40 # Backward-rewritten : 1
% 7.71/2.40 # Generated clauses : 139
% 7.71/2.40 # ...of the previous two non-trivial : 121
% 7.71/2.40 # Contextual simplify-reflections : 9
% 7.71/2.40 # Paramodulations : 135
% 7.71/2.40 # Factorizations : 0
% 7.71/2.40 # Equation resolutions : 3
% 7.71/2.40 # Propositional unsat checks : 0
% 7.71/2.40 # Propositional unsat check successes : 0
% 7.71/2.40 # Current number of processed clauses : 84
% 7.71/2.40 # Positive orientable unit clauses : 13
% 7.71/2.40 # Positive unorientable unit clauses: 0
% 7.71/2.40 # Negative unit clauses : 5
% 7.71/2.40 # Non-unit-clauses : 66
% 7.71/2.40 # Current number of unprocessed clauses: 87
% 7.71/2.40 # ...number of literals in the above : 402
% 7.71/2.40 # Current number of archived formulas : 0
% 7.71/2.40 # Current number of archived clauses : 2
% 7.71/2.40 # Clause-clause subsumption calls (NU) : 1240
% 7.71/2.40 # Rec. Clause-clause subsumption calls : 560
% 7.71/2.40 # Non-unit clause-clause subsumptions : 10
% 7.71/2.40 # Unit Clause-clause subsumption calls : 151
% 7.71/2.40 # Rewrite failures with RHS unbound : 0
% 7.71/2.40 # BW rewrite match attempts : 1
% 7.71/2.40 # BW rewrite match successes : 1
% 7.71/2.40 # Condensation attempts : 0
% 7.71/2.40 # Condensation successes : 0
% 7.71/2.40 # Termbank termtop insertions : 3768
% 7.71/2.40
% 7.71/2.40 # -------------------------------------------------
% 7.71/2.40 # User time : 0.019 s
% 7.71/2.40 # System time : 0.006 s
% 7.71/2.40 # Total time : 0.025 s
% 7.71/2.40 # ...preprocessing : 0.018 s
% 7.71/2.40 # ...main loop : 0.007 s
% 7.71/2.40 # Maximum resident set size: 7128 pages
% 7.71/2.40
%------------------------------------------------------------------------------