TSTP Solution File: GRA010+2 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : GRA010+2 : TPTP v8.1.0. Bugfixed v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n028.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.91s 2.44s
% Output : CNFRefutation 7.91s
% 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_47,plain,
( number_of_in(triangles,X1) = number_of_in(sequential_pairs,X1)
| ~ path(X2,X3,X1)
| ~ triangle(esk11_1(X1),esk12_1(X1),X4) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-dzhjxtop/input.p',i_0_47) ).
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-dzhjxtop/input.p',i_0_2) ).
cnf(i_0_48,plain,
( number_of_in(triangles,X1) = number_of_in(sequential_pairs,X1)
| sequential(esk11_1(X1),esk12_1(X1))
| ~ path(X2,X3,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-dzhjxtop/input.p',i_0_48) ).
cnf(i_0_49,plain,
( number_of_in(triangles,X1) = number_of_in(sequential_pairs,X1)
| on_path(esk12_1(X1),X1)
| ~ path(X2,X3,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-dzhjxtop/input.p',i_0_49) ).
cnf(i_0_3,negated_conjecture,
path(esk2_0,esk3_0,esk1_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-dzhjxtop/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-dzhjxtop/input.p',i_0_1) ).
cnf(i_0_50,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-dzhjxtop/input.p',i_0_50) ).
cnf(c_0_58,plain,
( number_of_in(triangles,X1) = number_of_in(sequential_pairs,X1)
| ~ path(X2,X3,X1)
| ~ triangle(esk11_1(X1),esk12_1(X1),X4) ),
i_0_47 ).
cnf(c_0_59,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_60,plain,
( number_of_in(triangles,X1) = number_of_in(sequential_pairs,X1)
| sequential(esk11_1(X1),esk12_1(X1))
| ~ path(X2,X3,X1) ),
i_0_48 ).
cnf(c_0_61,plain,
( number_of_in(triangles,X1) = number_of_in(sequential_pairs,X1)
| on_path(esk12_1(X1),X1)
| ~ path(X2,X3,X1) ),
i_0_49 ).
cnf(c_0_62,negated_conjecture,
path(esk2_0,esk3_0,esk1_0),
i_0_3 ).
cnf(c_0_63,negated_conjecture,
number_of_in(triangles,esk1_0) != number_of_in(sequential_pairs,esk1_0),
i_0_1 ).
cnf(c_0_64,plain,
( number_of_in(triangles,X1) = number_of_in(sequential_pairs,X1)
| on_path(esk11_1(X1),X1)
| ~ path(X2,X3,X1) ),
i_0_50 ).
cnf(c_0_65,negated_conjecture,
( number_of_in(triangles,X1) = number_of_in(sequential_pairs,X1)
| ~ on_path(esk12_1(X1),esk1_0)
| ~ on_path(esk11_1(X1),esk1_0)
| ~ path(X2,X3,X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_59]),c_0_60]) ).
cnf(c_0_66,negated_conjecture,
on_path(esk12_1(esk1_0),esk1_0),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_61,c_0_62]),c_0_63]) ).
cnf(c_0_67,negated_conjecture,
on_path(esk11_1(esk1_0),esk1_0),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_64,c_0_62]),c_0_63]) ).
cnf(c_0_68,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_65,c_0_66]),c_0_67])]),c_0_63]) ).
cnf(c_0_69,negated_conjecture,
$false,
inference(sr,[status(thm)],[c_0_62,c_0_68]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : GRA010+2 : TPTP v8.1.0. Bugfixed v3.2.0.
% 0.06/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n028.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 22:48:22 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.44 # ENIGMATIC: Selected SinE mode:
% 0.18/0.44 # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.18/0.44 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.18/0.44 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.18/0.44 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 7.91/2.44 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S0Y:
% 7.91/2.44 # Version: 2.1pre011
% 7.91/2.44 # Preprocessing time : 0.018 s
% 7.91/2.44
% 7.91/2.44 # Proof found!
% 7.91/2.44 # SZS status Theorem
% 7.91/2.44 # SZS output start CNFRefutation
% See solution above
% 7.91/2.44 # Proof object total steps : 19
% 7.91/2.44 # Proof object clause steps : 12
% 7.91/2.44 # Proof object formula steps : 7
% 7.91/2.44 # Proof object conjectures : 11
% 7.91/2.44 # Proof object clause conjectures : 8
% 7.91/2.44 # Proof object formula conjectures : 3
% 7.91/2.44 # Proof object initial clauses used : 7
% 7.91/2.44 # Proof object initial formulas used : 7
% 7.91/2.44 # Proof object generating inferences : 4
% 7.91/2.44 # Proof object simplifying inferences : 7
% 7.91/2.44 # Training examples: 0 positive, 0 negative
% 7.91/2.44 # Parsed axioms : 63
% 7.91/2.44 # Removed by relevancy pruning/SinE : 0
% 7.91/2.44 # Initial clauses : 63
% 7.91/2.44 # Removed in clause preprocessing : 0
% 7.91/2.44 # Initial clauses in saturation : 63
% 7.91/2.44 # Processed clauses : 102
% 7.91/2.44 # ...of these trivial : 2
% 7.91/2.44 # ...subsumed : 3
% 7.91/2.44 # ...remaining for further processing : 97
% 7.91/2.44 # Other redundant clauses eliminated : 2
% 7.91/2.44 # Clauses deleted for lack of memory : 0
% 7.91/2.44 # Backward-subsumed : 0
% 7.91/2.44 # Backward-rewritten : 1
% 7.91/2.44 # Generated clauses : 169
% 7.91/2.44 # ...of the previous two non-trivial : 154
% 7.91/2.44 # Contextual simplify-reflections : 13
% 7.91/2.44 # Paramodulations : 165
% 7.91/2.44 # Factorizations : 0
% 7.91/2.44 # Equation resolutions : 3
% 7.91/2.44 # Propositional unsat checks : 0
% 7.91/2.44 # Propositional unsat check successes : 0
% 7.91/2.44 # Current number of processed clauses : 93
% 7.91/2.44 # Positive orientable unit clauses : 15
% 7.91/2.44 # Positive unorientable unit clauses: 0
% 7.91/2.44 # Negative unit clauses : 5
% 7.91/2.44 # Non-unit-clauses : 73
% 7.91/2.44 # Current number of unprocessed clauses: 111
% 7.91/2.44 # ...number of literals in the above : 541
% 7.91/2.44 # Current number of archived formulas : 0
% 7.91/2.44 # Current number of archived clauses : 2
% 7.91/2.44 # Clause-clause subsumption calls (NU) : 1535
% 7.91/2.44 # Rec. Clause-clause subsumption calls : 760
% 7.91/2.44 # Non-unit clause-clause subsumptions : 16
% 7.91/2.44 # Unit Clause-clause subsumption calls : 192
% 7.91/2.44 # Rewrite failures with RHS unbound : 0
% 7.91/2.44 # BW rewrite match attempts : 1
% 7.91/2.44 # BW rewrite match successes : 1
% 7.91/2.44 # Condensation attempts : 0
% 7.91/2.44 # Condensation successes : 0
% 7.91/2.44 # Termbank termtop insertions : 4432
% 7.91/2.44
% 7.91/2.44 # -------------------------------------------------
% 7.91/2.44 # User time : 0.022 s
% 7.91/2.44 # System time : 0.004 s
% 7.91/2.44 # Total time : 0.026 s
% 7.91/2.44 # ...preprocessing : 0.018 s
% 7.91/2.44 # ...main loop : 0.008 s
% 7.91/2.44 # Maximum resident set size: 7136 pages
% 7.91/2.44
%------------------------------------------------------------------------------