TSTP Solution File: SYN010-1.005.005 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SYN010-1.005.005 : TPTP v3.4.2. Released v1.0.0.
% Transfm : add_equality:r
% Format : otter:hypothesis:set(auto),clear(print_given)
% Command : gandalf-wrapper -time %d %s
% Computer : art09.cs.miami.edu
% Model : i686 unknown
% CPU : Intel(R) Pentium(R) 4 CPU 2.80GHz @ 2793MHz
% Memory : 1000MB
% OS : Linux 2.4.22-21mdk-i686-up-4GB
% CPULimit : 600s
% Result : Unsatisfiable 0.0s
% Output : Assurance 0.0s
% Verified :
% SZS Type : None (Parsing solution fails)
% Syntax : Number of formulae : 0
% Comments :
%------------------------------------------------------------------------------
%----NO SOLUTION OUTPUT BY SYSTEM
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
%
% Gandalf c-2.6 r1 starting to prove: /home/graph/tptp/TSTP/PreparedTPTP/otter:hypothesis:set(auto),clear(print_given)---add_equality:r/SYN/SYN010-1.005.005+noeq.in
% Using automatic strategy selection.
% Time limit in seconds: 600
%
% prove-all-passes started
%
% detected problem class: hne
% detected subclass: medium
% detected subclass: short
%
% strategies selected:
% (hyper 12 #t 1 11)
% (binary-unit 30 #f 1 11)
% (binary-posweight-order 90 #f 1 11)
% (binary-double 30 #f)
% (binary 48 #t 1 11)
% (hyper 30 #f)
% (binary-posweight-order 180 #f)
% (binary-weightorder 42 #f)
% (binary-order 30 #f)
% (binary-unit 48 #f)
% (binary 60 #t)
%
%
% ********* EMPTY CLAUSE DERIVED *********
%
%
% timer checkpoints: c(27,40,2,54,0,2,54,50,2,81,0,2,81,50,2,108,0,2,108,50,2,135,0,2,135,50,2,162,0,2,162,50,2,189,0,2,189,50,2,216,0,2,216,50,2,243,0,2,243,50,2,270,0,2,270,50,2,297,0,2,297,50,2,324,0,3,324,50,3,351,0,3,351,50,3,378,0,3,378,50,3,405,0,3,405,50,3,432,0,3,432,50,3,459,0,3,459,50,3,486,0,3,486,50,3,513,0,3,513,50,3,540,0,3,540,50,3,567,0,3,567,50,3,594,0,3,594,50,3,594,40,3,621,0,3)
%
%
% START OF PROOF
% 595 [] p_5_5(0).
% 596 [] p_5_4(0).
% 597 [] p_5_3(0).
% 598 [] p_5_2(0).
% 599 [] p_5_1(0).
% 600 [?] ?
% 601 [?] ?
% 602 [?] ?
% 603 [?] ?
% 604 [?] ?
% 605 [] -p_4_5(0) | -p_4_4(0) | -p_4_3(0) | -p_4_2(0) | -p_4_1(0) | p_3_5(0).
% 606 [] -p_4_5(0) | -p_4_4(0) | -p_4_3(0) | -p_4_2(0) | -p_4_1(0) | p_3_4(0).
% 607 [] -p_4_5(0) | -p_4_4(0) | -p_4_3(0) | -p_4_2(0) | -p_4_1(0) | p_3_3(0).
% 608 [] -p_4_5(0) | -p_4_4(0) | -p_4_3(0) | -p_4_2(0) | -p_4_1(0) | p_3_2(0).
% 609 [] -p_4_5(0) | -p_4_4(0) | -p_4_3(0) | -p_4_2(0) | -p_4_1(0) | p_3_1(0).
% 610 [?] ?
% 611 [?] ?
% 612 [?] ?
% 613 [?] ?
% 614 [?] ?
% 615 [] -p_2_5(0) | -p_2_4(0) | -p_2_3(0) | -p_2_2(0) | -p_2_1(0) | p_1_5(0).
% 616 [] -p_2_5(0) | -p_2_4(0) | -p_2_3(0) | -p_2_2(0) | -p_2_1(0) | p_1_4(0).
% 617 [] -p_2_5(0) | -p_2_4(0) | -p_2_3(0) | -p_2_2(0) | -p_2_1(0) | p_1_3(0).
% 618 [] -p_2_5(0) | -p_2_4(0) | -p_2_3(0) | -p_2_2(0) | -p_2_1(0) | p_1_2(0).
% 619 [] -p_2_5(0) | -p_2_4(0) | -p_2_3(0) | -p_2_2(0) | -p_2_1(0) | p_1_1(0).
% 620 [?] ?
% 621 [] -p_0(0).
% 622 [input:600,cut:595,cut:596,cut:597,cut:598,cut:599] p_4_5(0).
% 623 [input:601,cut:595,cut:596,cut:597,cut:598,cut:599] p_4_4(0).
% 624 [input:602,cut:595,cut:596,cut:597,cut:598,cut:599] p_4_3(0).
% 625 [input:603,cut:595,cut:596,cut:597,cut:598,cut:599] p_4_2(0).
% 626 [input:604,cut:595,cut:596,cut:597,cut:598,cut:599] p_4_1(0).
% 628 [binary:622,605] -p_4_4(0) | -p_4_3(0) | -p_4_2(0) | -p_4_1(0) | p_3_5(0).
% 634 [binary:623,628] -p_4_3(0) | -p_4_2(0) | -p_4_1(0) | p_3_5(0).
% 639 [binary:624,634] -p_4_2(0) | -p_4_1(0) | p_3_5(0).
% 643 [binary:625,639] -p_4_1(0) | p_3_5(0).
% 646 [binary:626,643] p_3_5(0).
% 648 [binary:622,606] -p_4_4(0) | -p_4_3(0) | -p_4_2(0) | -p_4_1(0) | p_3_4(0).
% 654 [binary:622,607] -p_4_4(0) | -p_4_3(0) | -p_4_2(0) | -p_4_1(0) | p_3_3(0).
% 660 [binary:622,608] -p_4_4(0) | -p_4_3(0) | -p_4_2(0) | -p_4_1(0) | p_3_2(0).
% 666 [binary:623,648] -p_4_3(0) | -p_4_2(0) | -p_4_1(0) | p_3_4(0).
% 671 [binary:624,666] -p_4_2(0) | -p_4_1(0) | p_3_4(0).
% 675 [binary:625,671] -p_4_1(0) | p_3_4(0).
% 678 [binary:626,675] p_3_4(0).
% 680 [binary:622,609] -p_4_4(0) | -p_4_3(0) | -p_4_2(0) | -p_4_1(0) | p_3_1(0).
% 685 [input:610,cut:646,cut:678] -p_3_3(0) | -p_3_2(0) | -p_3_1(0) | p_2_5(0).
% 686 [input:611,cut:646,cut:678] -p_3_3(0) | -p_3_2(0) | -p_3_1(0) | p_2_4(0).
% 687 [input:612,cut:646,cut:678] -p_3_3(0) | -p_3_2(0) | -p_3_1(0) | p_2_3(0).
% 689 [binary:623,654] -p_4_3(0) | -p_4_2(0) | -p_4_1(0) | p_3_3(0).
% 694 [binary:624,689] -p_4_2(0) | -p_4_1(0) | p_3_3(0).
% 698 [binary:625,694] -p_4_1(0) | p_3_3(0).
% 701 [binary:626,698] p_3_3(0).
% 702 [input:613,cut:646,cut:678,cut:701] -p_3_2(0) | -p_3_1(0) | p_2_2(0).
% 703 [binary:685,701] -p_3_2(0) | -p_3_1(0) | p_2_5(0).
% 704 [binary:686,701] -p_3_2(0) | -p_3_1(0) | p_2_4(0).
% 705 [binary:687,701] -p_3_2(0) | -p_3_1(0) | p_2_3(0).
% 707 [input:614,cut:646,cut:678,cut:701] -p_3_2(0) | -p_3_1(0) | p_2_1(0).
% 712 [binary:623,660] -p_4_3(0) | -p_4_2(0) | -p_4_1(0) | p_3_2(0).
% 718 [binary:624,712] -p_4_2(0) | -p_4_1(0) | p_3_2(0).
% 722 [binary:625,718] -p_4_1(0) | p_3_2(0).
% 725 [binary:626,722] p_3_2(0).
% 726 [binary:702,725] -p_3_1(0) | p_2_2(0).
% 727 [binary:703,725] -p_3_1(0) | p_2_5(0).
% 728 [binary:707,725] -p_3_1(0) | p_2_1(0).
% 729 [binary:704,725] -p_3_1(0) | p_2_4(0).
% 730 [binary:705,725] -p_3_1(0) | p_2_3(0).
% 739 [input:620,cut:621] -p_1_5(0) | -p_1_4(0) | -p_1_3(0) | -p_1_2(0) | -p_1_1(0).
% 741 [binary:623,680] -p_4_3(0) | -p_4_2(0) | -p_4_1(0) | p_3_1(0).
% 746 [binary:624,741] -p_4_2(0) | -p_4_1(0) | p_3_1(0).
% 750 [binary:625,746] -p_4_1(0) | p_3_1(0).
% 753 [binary:626,750] p_3_1(0).
% 754 [binary:726,753] p_2_2(0).
% 755 [binary:727,753] p_2_5(0).
% 756 [binary:728,753] p_2_1(0).
% 757 [binary:729,753] p_2_4(0).
% 758 [binary:730,753] p_2_3(0).
% 759 [binary:615.4,754,cut:758,cut:757,cut:755,cut:756] p_1_5(0).
% 760 [binary:616.4,754,cut:758,cut:757,cut:755,cut:756] p_1_4(0).
% 761 [binary:617.4,754,cut:758,cut:757,cut:755,cut:756] p_1_3(0).
% 762 [binary:618.4,754,cut:758,cut:757,cut:755,cut:756] p_1_2(0).
% 763 [binary:619.4,754,cut:758,cut:757,cut:755,cut:756] p_1_1(0).
% 764 [binary:739,759,cut:760,cut:761,cut:762,cut:763] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using binary resolution
% not using sos strategy
% using unit strategy
% using dynamic demodulation
% using ordered paramodulation
% using kb ordering for equality
% preferring bigger arities for lex ordering
% using clause demodulation
% clause length limited to 11
% clause depth limited to 1
% seconds given: 30
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 87
% derived clauses: 143
% kept clauses: 93
% kept size sum: 608
% kept mid-nuclei: 0
% kept new demods: 0
% forw unit-subs: 0
% forw double-subs: 0
% forw overdouble-subs: 0
% backward subs: 99
% fast unit cutoff: 17
% full unit cutoff: 0
% dbl unit cutoff: 0
% real runtime: 0.2
% process. runtime: 0.1
% specific non-discr-tree subsumption statistics:
% tried: 917
% length fails: 0
% strength fails: 40
% predlist fails: 786
% aux str. fails: 0
% by-lit fails: 24
% full subs tried: 0
% full subs fail: 0
%
% ; program args: ("/home/graph/tptp/Systems/Gandalf---c-2.6/gandalf" "-time" "600" "/home/graph/tptp/TSTP/PreparedTPTP/otter:hypothesis:set(auto),clear(print_given)---add_equality:r/SYN/SYN010-1.005.005+noeq.in")
%
%------------------------------------------------------------------------------