TSTP Solution File: GRA002+4 by leanCoP---2.2
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : leanCoP---2.2
% Problem : GRA002+4 : TPTP v8.1.0. Bugfixed v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : leancop_casc.sh %s %d
% Computer : n024.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:19:04 EDT 2022
% Result : Theorem 46.88s 45.98s
% Output : Proof 46.96s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : GRA002+4 : TPTP v8.1.0. Bugfixed v3.2.0.
% 0.07/0.14 % Command : leancop_casc.sh %s %d
% 0.13/0.35 % Computer : n024.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Tue May 31 02:29:51 EDT 2022
% 0.13/0.35 % CPUTime :
% 46.88/45.98 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 46.96/45.99 % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
% 46.96/46.00
% 46.96/46.00 %-----------------------------------------------------
% 46.96/46.00 fof(shortest_path_defn, axiom, ! [_64425, _64428, _64431] : (shortest_path(_64425, _64428, _64431) <=> path(_64425, _64428, _64431) & (! _64425) = _64428 & ! [_64473] : (path(_64425, _64428, _64473) => less_or_equal(length_of(_64431), length_of(_64473)))), file('/export/starexec/sandbox/benchmark/Axioms/GRA001+0.ax', shortest_path_defn)).
% 46.96/46.00 fof(maximal_path_length, conjecture, complete => ! [_64784, _64787, _64790] : (shortest_path(_64787, _64790, _64784) => less_or_equal(minus(length_of(_64784), n1), number_of_in(triangles, graph))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', maximal_path_length)).
% 46.96/46.00 fof(path_length_sequential_pairs, axiom, ! [_65099, _65102, _65105] : (path(_65099, _65102, _65105) => number_of_in(sequential_pairs, _65105) = minus(length_of(_65105), n1)), file('/export/starexec/sandbox/benchmark/theBenchmark.p', path_length_sequential_pairs)).
% 46.96/46.00 fof(graph_has_them_all, axiom, ! [_65301, _65304] : less_or_equal(number_of_in(_65301, _65304), number_of_in(_65301, graph)), file('/export/starexec/sandbox/benchmark/theBenchmark.p', graph_has_them_all)).
% 46.96/46.00 fof(triangles_and_sequential_pairs, lemma, complete => ! [_65454, _65457, _65460] : (shortest_path(_65457, _65460, _65454) => number_of_in(sequential_pairs, _65454) = number_of_in(triangles, _65454)), file('/export/starexec/sandbox/benchmark/theBenchmark.p', triangles_and_sequential_pairs)).
% 46.96/46.00
% 46.96/46.00 cnf(1, plain, [-(21 ^ [_37571, _37490, _37408]), -(path(_37408, _37490, _37571))], clausify(shortest_path_defn)).
% 46.96/46.00 cnf(2, plain, [-(complete)], clausify(maximal_path_length)).
% 46.96/46.00 cnf(3, plain, [-(shortest_path(30 ^ [], 31 ^ [], 29 ^ []))], clausify(maximal_path_length)).
% 46.96/46.00 cnf(4, plain, [less_or_equal(minus(length_of(29 ^ []), n1), number_of_in(triangles, graph))], clausify(maximal_path_length)).
% 46.96/46.00 cnf(5, plain, [-(minus(_25737, _25870) = minus(_25804, _25935)), _25737 = _25804, _25870 = _25935], theory(equality)).
% 46.96/46.00 cnf(6, plain, [-(_16777 = _16777)], theory(equality)).
% 46.96/46.00 cnf(7, plain, [_16930 = _16975, -(_16975 = _16930)], theory(equality)).
% 46.96/46.00 cnf(8, plain, [-(_17209 = _17320), _17209 = _17265, _17265 = _17320], theory(equality)).
% 46.96/46.00 cnf(9, plain, [-(less_or_equal(_18705, _18836)), less_or_equal(_18638, _18771), _18638 = _18705, _18771 = _18836], theory(equality)).
% 46.96/46.00 cnf(10, plain, [path(_41016, _41075, _41133), -(number_of_in(sequential_pairs, _41133) = minus(length_of(_41133), n1))], clausify(path_length_sequential_pairs)).
% 46.96/46.00 cnf(11, plain, [-(less_or_equal(number_of_in(_42740, _42785), number_of_in(_42740, graph)))], clausify(graph_has_them_all)).
% 46.96/46.00 cnf(12, plain, [complete, shortest_path(_43119, _43175, _43062), -(number_of_in(sequential_pairs, _43062) = number_of_in(triangles, _43062))], clausify(triangles_and_sequential_pairs)).
% 46.96/46.00 cnf(13, plain, [shortest_path(_37408, _37490, _37571), 21 ^ [_37571, _37490, _37408]], clausify(shortest_path_defn)).
% 46.96/46.00
% 46.96/46.00 cnf('1',plain,[-(complete)],start(2)).
% 46.96/46.00 cnf('1.1',plain,[complete, shortest_path(30 ^ [], 31 ^ [], 29 ^ []), -(number_of_in(sequential_pairs, 29 ^ []) = number_of_in(triangles, 29 ^ []))],extension(12,bind([[_43119, _43175, _43062], [30 ^ [], 31 ^ [], 29 ^ []]]))).
% 46.96/46.00 cnf('1.1.1',plain,[-(shortest_path(30 ^ [], 31 ^ [], 29 ^ []))],extension(3)).
% 46.96/46.00 cnf('1.1.2',plain,[number_of_in(sequential_pairs, 29 ^ []) = number_of_in(triangles, 29 ^ []), -(number_of_in(triangles, 29 ^ []) = number_of_in(sequential_pairs, 29 ^ []))],extension(7,bind([[_16975, _16930], [number_of_in(triangles, 29 ^ []), number_of_in(sequential_pairs, 29 ^ [])]]))).
% 46.96/46.00 cnf('1.1.2.1',plain,[number_of_in(triangles, 29 ^ []) = number_of_in(sequential_pairs, 29 ^ []), -(number_of_in(triangles, 29 ^ []) = minus(length_of(29 ^ []), n1)), number_of_in(sequential_pairs, 29 ^ []) = minus(length_of(29 ^ []), n1)],extension(8,bind([[_17209, _17265, _17320], [number_of_in(triangles, 29 ^ []), number_of_in(sequential_pairs, 29 ^ []), minus(length_of(29 ^ []), n1)]]))).
% 46.96/46.00 cnf('1.1.2.1.1',plain,[number_of_in(triangles, 29 ^ []) = minus(length_of(29 ^ []), n1), -(number_of_in(triangles, 29 ^ []) = minus(length_of(29 ^ []), n1)), minus(length_of(29 ^ []), n1) = minus(length_of(29 ^ []), n1)],extension(8,bind([[_17209, _17265, _17320], [number_of_in(triangles, 29 ^ []), minus(length_of(29 ^ []), n1), minus(length_of(29 ^ []), n1)]]))).
% 46.96/46.00 cnf('1.1.2.1.1.1',plain,[number_of_in(triangles, 29 ^ []) = minus(length_of(29 ^ []), n1), -(less_or_equal(minus(length_of(29 ^ []), n1), number_of_in(triangles, graph))), less_or_equal(number_of_in(triangles, 29 ^ []), number_of_in(triangles, graph)), number_of_in(triangles, graph) = number_of_in(triangles, graph)],extension(9,bind([[_18705, _18638, _18771, _18836], [minus(length_of(29 ^ []), n1), number_of_in(triangles, 29 ^ []), number_of_in(triangles, graph), number_of_in(triangles, graph)]]))).
% 46.96/46.00 cnf('1.1.2.1.1.1.1',plain,[less_or_equal(minus(length_of(29 ^ []), n1), number_of_in(triangles, graph))],extension(4)).
% 46.96/46.00 cnf('1.1.2.1.1.1.2',plain,[-(less_or_equal(number_of_in(triangles, 29 ^ []), number_of_in(triangles, graph)))],extension(11,bind([[_42785, _42740], [29 ^ [], triangles]]))).
% 46.96/46.00 cnf('1.1.2.1.1.1.3',plain,[-(number_of_in(triangles, graph) = number_of_in(triangles, graph))],extension(6,bind([[_16777], [number_of_in(triangles, graph)]]))).
% 46.96/46.00 cnf('1.1.2.1.1.2',plain,[-(minus(length_of(29 ^ []), n1) = minus(length_of(29 ^ []), n1)), length_of(29 ^ []) = length_of(29 ^ []), n1 = n1],extension(5,bind([[_25737, _25804, _25870, _25935], [length_of(29 ^ []), length_of(29 ^ []), n1, n1]]))).
% 46.96/46.00 cnf('1.1.2.1.1.2.1',plain,[-(length_of(29 ^ []) = length_of(29 ^ []))],extension(6,bind([[_16777], [length_of(29 ^ [])]]))).
% 46.96/46.00 cnf('1.1.2.1.1.2.2',plain,[-(n1 = n1)],extension(6,bind([[_16777], [n1]]))).
% 46.96/46.00 cnf('1.1.2.1.2',plain,[-(number_of_in(sequential_pairs, 29 ^ []) = minus(length_of(29 ^ []), n1)), path(30 ^ [], 31 ^ [], 29 ^ [])],extension(10,bind([[_41016, _41075, _41133], [30 ^ [], 31 ^ [], 29 ^ []]]))).
% 46.96/46.00 cnf('1.1.2.1.2.1',plain,[-(path(30 ^ [], 31 ^ [], 29 ^ [])), -(21 ^ [29 ^ [], 31 ^ [], 30 ^ []])],extension(1,bind([[_37571, _37490, _37408], [29 ^ [], 31 ^ [], 30 ^ []]]))).
% 46.96/46.00 cnf('1.1.2.1.2.1.1',plain,[21 ^ [29 ^ [], 31 ^ [], 30 ^ []], shortest_path(30 ^ [], 31 ^ [], 29 ^ [])],extension(13,bind([[_37408, _37490, _37571], [30 ^ [], 31 ^ [], 29 ^ []]]))).
% 46.96/46.00 cnf('1.1.2.1.2.1.1.1',plain,[-(shortest_path(30 ^ [], 31 ^ [], 29 ^ []))],extension(3)).
% 46.96/46.00 %-----------------------------------------------------
% 46.96/46.00
% 46.96/46.00 % SZS output end Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
%------------------------------------------------------------------------------