TSTP Solution File: GRA002+4 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : GRA002+4 : 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:22 EDT 2022
% Result : Theorem 4.38s 2.29s
% Output : CNFRefutation 4.38s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 8
% Syntax : Number of clauses : 24 ( 15 unt; 0 nHn; 22 RR)
% Number of literals : 35 ( 10 equ; 14 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 2 prp; 0-3 aty)
% Number of functors : 11 ( 11 usr; 8 con; 0-2 aty)
% Number of variables : 31 ( 16 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_53,plain,
( path(X1,X2,X3)
| ~ shortest_path(X1,X2,X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-gn3plool/input.p',i_0_53) ).
cnf(i_0_15,negated_conjecture,
shortest_path(esk4_0,esk5_0,esk3_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-gn3plool/input.p',i_0_15) ).
cnf(i_0_63,lemma,
( number_of_in(triangles,X1) = number_of_in(sequential_pairs,X1)
| ~ complete
| ~ shortest_path(X2,X3,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-gn3plool/input.p',i_0_63) ).
cnf(i_0_16,negated_conjecture,
complete,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-gn3plool/input.p',i_0_16) ).
cnf(i_0_13,plain,
( number_of_in(edges,X1) = length_of(X1)
| ~ path(X2,X3,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-gn3plool/input.p',i_0_13) ).
cnf(i_0_14,negated_conjecture,
~ less_or_equal(minus(length_of(esk3_0),n1),number_of_in(triangles,graph)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-gn3plool/input.p',i_0_14) ).
cnf(i_0_23,plain,
( minus(length_of(X1),n1) = number_of_in(sequential_pairs,X1)
| ~ path(X2,X3,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-gn3plool/input.p',i_0_23) ).
cnf(i_0_9,plain,
less_or_equal(number_of_in(X1,X2),number_of_in(X1,graph)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-gn3plool/input.p',i_0_9) ).
cnf(c_0_72,plain,
( path(X1,X2,X3)
| ~ shortest_path(X1,X2,X3) ),
i_0_53 ).
cnf(c_0_73,negated_conjecture,
shortest_path(esk4_0,esk5_0,esk3_0),
i_0_15 ).
cnf(c_0_74,lemma,
( number_of_in(triangles,X1) = number_of_in(sequential_pairs,X1)
| ~ complete
| ~ shortest_path(X2,X3,X1) ),
i_0_63 ).
cnf(c_0_75,negated_conjecture,
complete,
i_0_16 ).
cnf(c_0_76,plain,
( number_of_in(edges,X1) = length_of(X1)
| ~ path(X2,X3,X1) ),
i_0_13 ).
cnf(c_0_77,negated_conjecture,
path(esk4_0,esk5_0,esk3_0),
inference(spm,[status(thm)],[c_0_72,c_0_73]) ).
cnf(c_0_78,lemma,
( number_of_in(triangles,X1) = number_of_in(sequential_pairs,X1)
| ~ shortest_path(X2,X3,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_74,c_0_75])]) ).
cnf(c_0_79,negated_conjecture,
~ less_or_equal(minus(length_of(esk3_0),n1),number_of_in(triangles,graph)),
i_0_14 ).
cnf(c_0_80,plain,
length_of(esk3_0) = number_of_in(edges,esk3_0),
inference(spm,[status(thm)],[c_0_76,c_0_77]) ).
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,plain,
less_or_equal(number_of_in(X1,X2),number_of_in(X1,graph)),
i_0_9 ).
cnf(c_0_83,negated_conjecture,
number_of_in(triangles,esk3_0) = number_of_in(sequential_pairs,esk3_0),
inference(spm,[status(thm)],[c_0_78,c_0_73]) ).
cnf(c_0_84,negated_conjecture,
~ less_or_equal(minus(number_of_in(edges,esk3_0),n1),number_of_in(triangles,graph)),
inference(rw,[status(thm)],[c_0_79,c_0_80]) ).
cnf(c_0_85,plain,
minus(number_of_in(edges,esk3_0),n1) = number_of_in(sequential_pairs,esk3_0),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_81,c_0_77]),c_0_80]) ).
cnf(c_0_86,plain,
less_or_equal(number_of_in(sequential_pairs,esk3_0),number_of_in(triangles,graph)),
inference(spm,[status(thm)],[c_0_82,c_0_83]) ).
cnf(c_0_87,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_84,c_0_85]),c_0_86])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : GRA002+4 : TPTP v8.1.0. Bugfixed v3.2.0.
% 0.11/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 : Tue May 31 02:31: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
% 4.38/2.29 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S04BN:
% 4.38/2.29 # Version: 2.1pre011
% 4.38/2.29 # Preprocessing time : 0.010 s
% 4.38/2.29
% 4.38/2.29 # Proof found!
% 4.38/2.29 # SZS status Theorem
% 4.38/2.29 # SZS output start CNFRefutation
% See solution above
% 4.38/2.29 # Proof object total steps : 24
% 4.38/2.29 # Proof object clause steps : 16
% 4.38/2.29 # Proof object formula steps : 8
% 4.38/2.29 # Proof object conjectures : 10
% 4.38/2.29 # Proof object clause conjectures : 7
% 4.38/2.29 # Proof object formula conjectures : 3
% 4.38/2.29 # Proof object initial clauses used : 8
% 4.38/2.29 # Proof object initial formulas used : 8
% 4.38/2.29 # Proof object generating inferences : 5
% 4.38/2.29 # Proof object simplifying inferences : 7
% 4.38/2.29 # Training examples: 0 positive, 0 negative
% 4.38/2.29 # Parsed axioms : 62
% 4.38/2.29 # Removed by relevancy pruning/SinE : 0
% 4.38/2.29 # Initial clauses : 62
% 4.38/2.29 # Removed in clause preprocessing : 0
% 4.38/2.29 # Initial clauses in saturation : 62
% 4.38/2.29 # Processed clauses : 80
% 4.38/2.29 # ...of these trivial : 0
% 4.38/2.29 # ...subsumed : 0
% 4.38/2.29 # ...remaining for further processing : 80
% 4.38/2.29 # Other redundant clauses eliminated : 2
% 4.38/2.29 # Clauses deleted for lack of memory : 0
% 4.38/2.29 # Backward-subsumed : 0
% 4.38/2.29 # Backward-rewritten : 3
% 4.38/2.29 # Generated clauses : 75
% 4.38/2.29 # ...of the previous two non-trivial : 64
% 4.38/2.29 # Contextual simplify-reflections : 6
% 4.38/2.29 # Paramodulations : 66
% 4.38/2.29 # Factorizations : 6
% 4.38/2.29 # Equation resolutions : 3
% 4.38/2.29 # Propositional unsat checks : 0
% 4.38/2.29 # Propositional unsat check successes : 0
% 4.38/2.29 # Current number of processed clauses : 75
% 4.38/2.29 # Positive orientable unit clauses : 10
% 4.38/2.29 # Positive unorientable unit clauses: 0
% 4.38/2.29 # Negative unit clauses : 2
% 4.38/2.29 # Non-unit-clauses : 63
% 4.38/2.29 # Current number of unprocessed clauses: 46
% 4.38/2.29 # ...number of literals in the above : 177
% 4.38/2.29 # Current number of archived formulas : 0
% 4.38/2.29 # Current number of archived clauses : 3
% 4.38/2.29 # Clause-clause subsumption calls (NU) : 1039
% 4.38/2.29 # Rec. Clause-clause subsumption calls : 434
% 4.38/2.29 # Non-unit clause-clause subsumptions : 6
% 4.38/2.29 # Unit Clause-clause subsumption calls : 127
% 4.38/2.29 # Rewrite failures with RHS unbound : 0
% 4.38/2.29 # BW rewrite match attempts : 2
% 4.38/2.29 # BW rewrite match successes : 2
% 4.38/2.29 # Condensation attempts : 0
% 4.38/2.29 # Condensation successes : 0
% 4.38/2.29 # Termbank termtop insertions : 2738
% 4.38/2.29
% 4.38/2.29 # -------------------------------------------------
% 4.38/2.29 # User time : 0.011 s
% 4.38/2.29 # System time : 0.001 s
% 4.38/2.29 # Total time : 0.012 s
% 4.38/2.29 # ...preprocessing : 0.010 s
% 4.38/2.29 # ...main loop : 0.003 s
% 4.38/2.29 # Maximum resident set size: 7136 pages
% 4.38/2.29
%------------------------------------------------------------------------------