TSTP Solution File: GRA002+3 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : GRA002+3 : TPTP v5.0.0. Bugfixed v3.2.0.
% Transfm : none
% Format : tptp
% Command : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s
% Computer : art07.cs.miami.edu
% Model : i686 i686
% CPU : Intel(R) Pentium(R) 4 CPU 2.80GHz @ 2793MHz
% Memory : 2018MB
% OS : Linux 2.6.26.8-57.fc8
% CPULimit : 300s
% DateTime : Wed Dec 29 05:40:17 EST 2010
% Result : Theorem 1.62s
% Output : Solution 1.62s
% Verified :
% SZS Type : None (Parsing solution fails)
% Syntax : Number of formulae : 0
% Comments :
%------------------------------------------------------------------------------
%----ERROR: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% Reading problem from /tmp/SystemOnTPTP31455/GRA002+3.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP31455/GRA002+3.tptp
% SZS output start Solution for /tmp/SystemOnTPTP31455/GRA002+3.tptp
% TreeLimitedRun: ----------------------------------------------------------
% TreeLimitedRun: /home/graph/tptp/Systems/EP---1.2/eproof --print-statistics -xAuto -tAuto --cpu-limit=60 --proof-time-unlimited --memory-limit=Auto --tstp-in --tstp-out /tmp/SRASS.s.p
% TreeLimitedRun: CPU time limit is 60s
% TreeLimitedRun: WC time limit is 120s
% TreeLimitedRun: PID is 31551
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.017 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:![X2]:less_or_equal(number_of_in(X1,X2),number_of_in(X1,graph)),file('/tmp/SRASS.s.p', graph_has_them_all)).
% fof(2, axiom,![X3]:![X4]:![X5]:(shortest_path(X3,X4,X5)<=>((path(X3,X4,X5)&~(X3=X4))&![X6]:(path(X3,X4,X6)=>less_or_equal(length_of(X5),length_of(X6))))),file('/tmp/SRASS.s.p', shortest_path_defn)).
% fof(3, axiom,![X3]:![X4]:![X6]:(path(X3,X4,X6)=>number_of_in(sequential_pairs,X6)=minus(length_of(X6),n1)),file('/tmp/SRASS.s.p', path_length_sequential_pairs)).
% fof(4, axiom,![X3]:![X4]:![X6]:(path(X3,X4,X6)=>length_of(X6)=number_of_in(edges,X6)),file('/tmp/SRASS.s.p', length_defn)).
% fof(5, axiom,(complete=>![X3]:![X4]:![X7]:![X8]:![X6]:(((shortest_path(X3,X4,X6)&precedes(X7,X8,X6))&sequential(X7,X8))=>?[X9]:triangle(X7,X8,X9))),file('/tmp/SRASS.s.p', sequential_is_triangle)).
% fof(7, axiom,![X6]:![X3]:![X4]:((path(X3,X4,X6)&![X7]:![X8]:(((on_path(X7,X6)&on_path(X8,X6))&sequential(X7,X8))=>?[X9]:triangle(X7,X8,X9)))=>number_of_in(sequential_pairs,X6)=number_of_in(triangles,X6)),file('/tmp/SRASS.s.p', sequential_pairs_and_triangles)).
% fof(8, axiom,![X6]:![X3]:![X4]:(path(X3,X4,X6)=>![X7]:![X8]:(precedes(X7,X8,X6)<=((on_path(X7,X6)&on_path(X8,X6))&(sequential(X7,X8)|?[X9]:(sequential(X7,X9)&precedes(X9,X8,X6)))))),file('/tmp/SRASS.s.p', precedes_defn)).
% fof(19, conjecture,(complete=>![X6]:![X3]:![X4]:(shortest_path(X3,X4,X6)=>less_or_equal(minus(length_of(X6),n1),number_of_in(triangles,graph)))),file('/tmp/SRASS.s.p', maximal_path_length)).
% fof(20, negated_conjecture,~((complete=>![X6]:![X3]:![X4]:(shortest_path(X3,X4,X6)=>less_or_equal(minus(length_of(X6),n1),number_of_in(triangles,graph))))),inference(assume_negation,[status(cth)],[19])).
% fof(21, plain,![X6]:![X3]:![X4]:(path(X3,X4,X6)=>![X7]:![X8]:(((on_path(X7,X6)&on_path(X8,X6))&(sequential(X7,X8)|?[X9]:(sequential(X7,X9)&precedes(X9,X8,X6))))=>precedes(X7,X8,X6))),inference(fof_simplification,[status(thm)],[8,theory(equality)])).
% fof(27, plain,![X3]:![X4]:less_or_equal(number_of_in(X3,X4),number_of_in(X3,graph)),inference(variable_rename,[status(thm)],[1])).
% cnf(28,plain,(less_or_equal(number_of_in(X1,X2),number_of_in(X1,graph))),inference(split_conjunct,[status(thm)],[27])).
% fof(29, plain,![X3]:![X4]:![X5]:((~(shortest_path(X3,X4,X5))|((path(X3,X4,X5)&~(X3=X4))&![X6]:(~(path(X3,X4,X6))|less_or_equal(length_of(X5),length_of(X6)))))&(((~(path(X3,X4,X5))|X3=X4)|?[X6]:(path(X3,X4,X6)&~(less_or_equal(length_of(X5),length_of(X6)))))|shortest_path(X3,X4,X5))),inference(fof_nnf,[status(thm)],[2])).
% fof(30, plain,![X7]:![X8]:![X9]:((~(shortest_path(X7,X8,X9))|((path(X7,X8,X9)&~(X7=X8))&![X10]:(~(path(X7,X8,X10))|less_or_equal(length_of(X9),length_of(X10)))))&(((~(path(X7,X8,X9))|X7=X8)|?[X11]:(path(X7,X8,X11)&~(less_or_equal(length_of(X9),length_of(X11)))))|shortest_path(X7,X8,X9))),inference(variable_rename,[status(thm)],[29])).
% fof(31, plain,![X7]:![X8]:![X9]:((~(shortest_path(X7,X8,X9))|((path(X7,X8,X9)&~(X7=X8))&![X10]:(~(path(X7,X8,X10))|less_or_equal(length_of(X9),length_of(X10)))))&(((~(path(X7,X8,X9))|X7=X8)|(path(X7,X8,esk1_3(X7,X8,X9))&~(less_or_equal(length_of(X9),length_of(esk1_3(X7,X8,X9))))))|shortest_path(X7,X8,X9))),inference(skolemize,[status(esa)],[30])).
% fof(32, plain,![X7]:![X8]:![X9]:![X10]:((((~(path(X7,X8,X10))|less_or_equal(length_of(X9),length_of(X10)))&(path(X7,X8,X9)&~(X7=X8)))|~(shortest_path(X7,X8,X9)))&(((~(path(X7,X8,X9))|X7=X8)|(path(X7,X8,esk1_3(X7,X8,X9))&~(less_or_equal(length_of(X9),length_of(esk1_3(X7,X8,X9))))))|shortest_path(X7,X8,X9))),inference(shift_quantors,[status(thm)],[31])).
% fof(33, plain,![X7]:![X8]:![X9]:![X10]:((((~(path(X7,X8,X10))|less_or_equal(length_of(X9),length_of(X10)))|~(shortest_path(X7,X8,X9)))&((path(X7,X8,X9)|~(shortest_path(X7,X8,X9)))&(~(X7=X8)|~(shortest_path(X7,X8,X9)))))&(((path(X7,X8,esk1_3(X7,X8,X9))|(~(path(X7,X8,X9))|X7=X8))|shortest_path(X7,X8,X9))&((~(less_or_equal(length_of(X9),length_of(esk1_3(X7,X8,X9))))|(~(path(X7,X8,X9))|X7=X8))|shortest_path(X7,X8,X9)))),inference(distribute,[status(thm)],[32])).
% cnf(37,plain,(path(X1,X2,X3)|~shortest_path(X1,X2,X3)),inference(split_conjunct,[status(thm)],[33])).
% fof(39, plain,![X3]:![X4]:![X6]:(~(path(X3,X4,X6))|number_of_in(sequential_pairs,X6)=minus(length_of(X6),n1)),inference(fof_nnf,[status(thm)],[3])).
% fof(40, plain,![X7]:![X8]:![X9]:(~(path(X7,X8,X9))|number_of_in(sequential_pairs,X9)=minus(length_of(X9),n1)),inference(variable_rename,[status(thm)],[39])).
% cnf(41,plain,(number_of_in(sequential_pairs,X1)=minus(length_of(X1),n1)|~path(X2,X3,X1)),inference(split_conjunct,[status(thm)],[40])).
% fof(42, plain,![X3]:![X4]:![X6]:(~(path(X3,X4,X6))|length_of(X6)=number_of_in(edges,X6)),inference(fof_nnf,[status(thm)],[4])).
% fof(43, plain,![X7]:![X8]:![X9]:(~(path(X7,X8,X9))|length_of(X9)=number_of_in(edges,X9)),inference(variable_rename,[status(thm)],[42])).
% cnf(44,plain,(length_of(X1)=number_of_in(edges,X1)|~path(X2,X3,X1)),inference(split_conjunct,[status(thm)],[43])).
% fof(45, plain,(~(complete)|![X3]:![X4]:![X7]:![X8]:![X6]:(((~(shortest_path(X3,X4,X6))|~(precedes(X7,X8,X6)))|~(sequential(X7,X8)))|?[X9]:triangle(X7,X8,X9))),inference(fof_nnf,[status(thm)],[5])).
% fof(46, plain,(~(complete)|![X10]:![X11]:![X12]:![X13]:![X14]:(((~(shortest_path(X10,X11,X14))|~(precedes(X12,X13,X14)))|~(sequential(X12,X13)))|?[X15]:triangle(X12,X13,X15))),inference(variable_rename,[status(thm)],[45])).
% fof(47, plain,(~(complete)|![X10]:![X11]:![X12]:![X13]:![X14]:(((~(shortest_path(X10,X11,X14))|~(precedes(X12,X13,X14)))|~(sequential(X12,X13)))|triangle(X12,X13,esk2_5(X10,X11,X12,X13,X14)))),inference(skolemize,[status(esa)],[46])).
% fof(48, plain,![X10]:![X11]:![X12]:![X13]:![X14]:((((~(shortest_path(X10,X11,X14))|~(precedes(X12,X13,X14)))|~(sequential(X12,X13)))|triangle(X12,X13,esk2_5(X10,X11,X12,X13,X14)))|~(complete)),inference(shift_quantors,[status(thm)],[47])).
% cnf(49,plain,(triangle(X1,X2,esk2_5(X3,X4,X1,X2,X5))|~complete|~sequential(X1,X2)|~precedes(X1,X2,X5)|~shortest_path(X3,X4,X5)),inference(split_conjunct,[status(thm)],[48])).
% fof(60, plain,![X6]:![X3]:![X4]:((~(path(X3,X4,X6))|?[X7]:?[X8]:(((on_path(X7,X6)&on_path(X8,X6))&sequential(X7,X8))&![X9]:~(triangle(X7,X8,X9))))|number_of_in(sequential_pairs,X6)=number_of_in(triangles,X6)),inference(fof_nnf,[status(thm)],[7])).
% fof(61, plain,![X10]:![X11]:![X12]:((~(path(X11,X12,X10))|?[X13]:?[X14]:(((on_path(X13,X10)&on_path(X14,X10))&sequential(X13,X14))&![X15]:~(triangle(X13,X14,X15))))|number_of_in(sequential_pairs,X10)=number_of_in(triangles,X10)),inference(variable_rename,[status(thm)],[60])).
% fof(62, plain,![X10]:![X11]:![X12]:((~(path(X11,X12,X10))|(((on_path(esk3_3(X10,X11,X12),X10)&on_path(esk4_3(X10,X11,X12),X10))&sequential(esk3_3(X10,X11,X12),esk4_3(X10,X11,X12)))&![X15]:~(triangle(esk3_3(X10,X11,X12),esk4_3(X10,X11,X12),X15))))|number_of_in(sequential_pairs,X10)=number_of_in(triangles,X10)),inference(skolemize,[status(esa)],[61])).
% fof(63, plain,![X10]:![X11]:![X12]:![X15]:(((~(triangle(esk3_3(X10,X11,X12),esk4_3(X10,X11,X12),X15))&((on_path(esk3_3(X10,X11,X12),X10)&on_path(esk4_3(X10,X11,X12),X10))&sequential(esk3_3(X10,X11,X12),esk4_3(X10,X11,X12))))|~(path(X11,X12,X10)))|number_of_in(sequential_pairs,X10)=number_of_in(triangles,X10)),inference(shift_quantors,[status(thm)],[62])).
% fof(64, plain,![X10]:![X11]:![X12]:![X15]:(((~(triangle(esk3_3(X10,X11,X12),esk4_3(X10,X11,X12),X15))|~(path(X11,X12,X10)))|number_of_in(sequential_pairs,X10)=number_of_in(triangles,X10))&((((on_path(esk3_3(X10,X11,X12),X10)|~(path(X11,X12,X10)))|number_of_in(sequential_pairs,X10)=number_of_in(triangles,X10))&((on_path(esk4_3(X10,X11,X12),X10)|~(path(X11,X12,X10)))|number_of_in(sequential_pairs,X10)=number_of_in(triangles,X10)))&((sequential(esk3_3(X10,X11,X12),esk4_3(X10,X11,X12))|~(path(X11,X12,X10)))|number_of_in(sequential_pairs,X10)=number_of_in(triangles,X10)))),inference(distribute,[status(thm)],[63])).
% cnf(65,plain,(number_of_in(sequential_pairs,X1)=number_of_in(triangles,X1)|sequential(esk3_3(X1,X2,X3),esk4_3(X1,X2,X3))|~path(X2,X3,X1)),inference(split_conjunct,[status(thm)],[64])).
% cnf(66,plain,(number_of_in(sequential_pairs,X1)=number_of_in(triangles,X1)|on_path(esk4_3(X1,X2,X3),X1)|~path(X2,X3,X1)),inference(split_conjunct,[status(thm)],[64])).
% cnf(67,plain,(number_of_in(sequential_pairs,X1)=number_of_in(triangles,X1)|on_path(esk3_3(X1,X2,X3),X1)|~path(X2,X3,X1)),inference(split_conjunct,[status(thm)],[64])).
% cnf(68,plain,(number_of_in(sequential_pairs,X1)=number_of_in(triangles,X1)|~path(X2,X3,X1)|~triangle(esk3_3(X1,X2,X3),esk4_3(X1,X2,X3),X4)),inference(split_conjunct,[status(thm)],[64])).
% fof(69, plain,![X6]:![X3]:![X4]:(~(path(X3,X4,X6))|![X7]:![X8]:(((~(on_path(X7,X6))|~(on_path(X8,X6)))|(~(sequential(X7,X8))&![X9]:(~(sequential(X7,X9))|~(precedes(X9,X8,X6)))))|precedes(X7,X8,X6))),inference(fof_nnf,[status(thm)],[21])).
% fof(70, plain,![X10]:![X11]:![X12]:(~(path(X11,X12,X10))|![X13]:![X14]:(((~(on_path(X13,X10))|~(on_path(X14,X10)))|(~(sequential(X13,X14))&![X15]:(~(sequential(X13,X15))|~(precedes(X15,X14,X10)))))|precedes(X13,X14,X10))),inference(variable_rename,[status(thm)],[69])).
% fof(71, plain,![X10]:![X11]:![X12]:![X13]:![X14]:![X15]:(((((~(sequential(X13,X15))|~(precedes(X15,X14,X10)))&~(sequential(X13,X14)))|(~(on_path(X13,X10))|~(on_path(X14,X10))))|precedes(X13,X14,X10))|~(path(X11,X12,X10))),inference(shift_quantors,[status(thm)],[70])).
% fof(72, plain,![X10]:![X11]:![X12]:![X13]:![X14]:![X15]:(((((~(sequential(X13,X15))|~(precedes(X15,X14,X10)))|(~(on_path(X13,X10))|~(on_path(X14,X10))))|precedes(X13,X14,X10))|~(path(X11,X12,X10)))&(((~(sequential(X13,X14))|(~(on_path(X13,X10))|~(on_path(X14,X10))))|precedes(X13,X14,X10))|~(path(X11,X12,X10)))),inference(distribute,[status(thm)],[71])).
% cnf(73,plain,(precedes(X4,X5,X3)|~path(X1,X2,X3)|~on_path(X5,X3)|~on_path(X4,X3)|~sequential(X4,X5)),inference(split_conjunct,[status(thm)],[72])).
% fof(151, negated_conjecture,(complete&?[X6]:?[X3]:?[X4]:(shortest_path(X3,X4,X6)&~(less_or_equal(minus(length_of(X6),n1),number_of_in(triangles,graph))))),inference(fof_nnf,[status(thm)],[20])).
% fof(152, negated_conjecture,(complete&?[X7]:?[X8]:?[X9]:(shortest_path(X8,X9,X7)&~(less_or_equal(minus(length_of(X7),n1),number_of_in(triangles,graph))))),inference(variable_rename,[status(thm)],[151])).
% fof(153, negated_conjecture,(complete&(shortest_path(esk11_0,esk12_0,esk10_0)&~(less_or_equal(minus(length_of(esk10_0),n1),number_of_in(triangles,graph))))),inference(skolemize,[status(esa)],[152])).
% cnf(154,negated_conjecture,(~less_or_equal(minus(length_of(esk10_0),n1),number_of_in(triangles,graph))),inference(split_conjunct,[status(thm)],[153])).
% cnf(155,negated_conjecture,(shortest_path(esk11_0,esk12_0,esk10_0)),inference(split_conjunct,[status(thm)],[153])).
% cnf(156,negated_conjecture,(complete),inference(split_conjunct,[status(thm)],[153])).
% cnf(169,plain,(triangle(X1,X2,esk2_5(X3,X4,X1,X2,X5))|$false|~sequential(X1,X2)|~shortest_path(X3,X4,X5)|~precedes(X1,X2,X5)),inference(rw,[status(thm)],[49,156,theory(equality)])).
% cnf(170,plain,(triangle(X1,X2,esk2_5(X3,X4,X1,X2,X5))|~sequential(X1,X2)|~shortest_path(X3,X4,X5)|~precedes(X1,X2,X5)),inference(cn,[status(thm)],[169,theory(equality)])).
% cnf(176,negated_conjecture,(path(esk11_0,esk12_0,esk10_0)),inference(spm,[status(thm)],[37,155,theory(equality)])).
% cnf(213,plain,(number_of_in(triangles,X1)=number_of_in(sequential_pairs,X1)|~path(X2,X3,X1)|~sequential(esk3_3(X1,X2,X3),esk4_3(X1,X2,X3))|~precedes(esk3_3(X1,X2,X3),esk4_3(X1,X2,X3),X6)|~shortest_path(X4,X5,X6)),inference(spm,[status(thm)],[68,170,theory(equality)])).
% cnf(264,negated_conjecture,(length_of(esk10_0)=number_of_in(edges,esk10_0)),inference(spm,[status(thm)],[44,176,theory(equality)])).
% cnf(265,negated_conjecture,(minus(length_of(esk10_0),n1)=number_of_in(sequential_pairs,esk10_0)),inference(spm,[status(thm)],[41,176,theory(equality)])).
% cnf(272,negated_conjecture,(precedes(X1,X2,esk10_0)|~on_path(X2,esk10_0)|~on_path(X1,esk10_0)|~sequential(X1,X2)),inference(spm,[status(thm)],[73,176,theory(equality)])).
% cnf(275,negated_conjecture,(~less_or_equal(minus(number_of_in(edges,esk10_0),n1),number_of_in(triangles,graph))),inference(rw,[status(thm)],[154,264,theory(equality)])).
% cnf(284,negated_conjecture,(minus(number_of_in(edges,esk10_0),n1)=number_of_in(sequential_pairs,esk10_0)),inference(rw,[status(thm)],[265,264,theory(equality)])).
% cnf(285,negated_conjecture,(~less_or_equal(number_of_in(sequential_pairs,esk10_0),number_of_in(triangles,graph))),inference(rw,[status(thm)],[275,284,theory(equality)])).
% cnf(344,negated_conjecture,(precedes(X1,esk4_3(esk10_0,X2,X3),esk10_0)|number_of_in(triangles,esk10_0)=number_of_in(sequential_pairs,esk10_0)|~on_path(X1,esk10_0)|~sequential(X1,esk4_3(esk10_0,X2,X3))|~path(X2,X3,esk10_0)),inference(spm,[status(thm)],[272,66,theory(equality)])).
% cnf(759,plain,(number_of_in(triangles,X1)=number_of_in(sequential_pairs,X1)|~precedes(esk3_3(X1,X2,X3),esk4_3(X1,X2,X3),X6)|~path(X2,X3,X1)|~shortest_path(X4,X5,X6)),inference(csr,[status(thm)],[213,65])).
% cnf(1727,negated_conjecture,(number_of_in(triangles,esk10_0)=number_of_in(sequential_pairs,esk10_0)|~path(X1,X2,esk10_0)|~shortest_path(X3,X4,esk10_0)|~on_path(esk3_3(esk10_0,X1,X2),esk10_0)|~sequential(esk3_3(esk10_0,X1,X2),esk4_3(esk10_0,X1,X2))),inference(spm,[status(thm)],[759,344,theory(equality)])).
% cnf(9844,negated_conjecture,(number_of_in(triangles,esk10_0)=number_of_in(sequential_pairs,esk10_0)|~on_path(esk3_3(esk10_0,X1,X2),esk10_0)|~path(X1,X2,esk10_0)|~shortest_path(X3,X4,esk10_0)),inference(csr,[status(thm)],[1727,65])).
% cnf(9845,negated_conjecture,(number_of_in(triangles,esk10_0)=number_of_in(sequential_pairs,esk10_0)|~path(X1,X2,esk10_0)|~shortest_path(X3,X4,esk10_0)),inference(csr,[status(thm)],[9844,67])).
% cnf(9846,negated_conjecture,(number_of_in(triangles,esk10_0)=number_of_in(sequential_pairs,esk10_0)|~shortest_path(X1,X2,esk10_0)),inference(spm,[status(thm)],[9845,176,theory(equality)])).
% cnf(9848,negated_conjecture,(number_of_in(triangles,esk10_0)=number_of_in(sequential_pairs,esk10_0)),inference(spm,[status(thm)],[9846,155,theory(equality)])).
% cnf(9869,negated_conjecture,(less_or_equal(number_of_in(sequential_pairs,esk10_0),number_of_in(triangles,graph))),inference(spm,[status(thm)],[28,9848,theory(equality)])).
% cnf(9901,negated_conjecture,($false),inference(sr,[status(thm)],[9869,285,theory(equality)])).
% cnf(9902,negated_conjecture,($false),9901,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 1436
% # ...of these trivial : 28
% # ...subsumed : 731
% # ...remaining for further processing: 677
% # Other redundant clauses eliminated : 25
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 115
% # Backward-rewritten : 33
% # Generated clauses : 7698
% # ...of the previous two non-trivial : 7250
% # Contextual simplify-reflections : 1695
% # Paramodulations : 7596
% # Factorizations : 52
% # Equation resolutions : 50
% # Current number of processed clauses: 465
% # Positive orientable unit clauses: 10
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 3
% # Non-unit-clauses : 452
% # Current number of unprocessed clauses: 3493
% # ...number of literals in the above : 26899
% # Clause-clause subsumption calls (NU) : 28305
% # Rec. Clause-clause subsumption calls : 4480
% # Unit Clause-clause subsumption calls : 61
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 3
% # Indexed BW rewrite successes : 3
% # Backwards rewriting index: 334 leaves, 2.00+/-3.728 terms/leaf
% # Paramod-from index: 113 leaves, 1.18+/-0.484 terms/leaf
% # Paramod-into index: 251 leaves, 1.60+/-1.696 terms/leaf
% # -------------------------------------------------
% # User time : 0.504 s
% # System time : 0.015 s
% # Total time : 0.519 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.81 CPU 0.89 WC
% FINAL PrfWatch: 0.81 CPU 0.89 WC
% SZS output end Solution for /tmp/SystemOnTPTP31455/GRA002+3.tptp
%
%------------------------------------------------------------------------------