%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SYN037-1 : 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 : art05.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/SYN037-1+noeq.in
% Using automatic strategy selection.
% Time limit in seconds: 600
%
% prove-all-passes started
%
% detected problem class: nne
% detected subclass: medium
%
% strategies selected:
% (hyper 27 #f 2 7)
% (binary-unit 10 #f 2 7)
% (binary-double 16 #f 2 7)
% (binary 54 #t 2 7)
% (binary-order 27 #f 2 7)
% (binary-posweight-order 125 #f)
% (binary-order-sos 54 #t)
% (binary-unit-uniteq 27 #f)
% (binary-weightorder 54 #f)
% (binary-order 54 #f)
% (hyper-order 43 #f)
% (binary 109 #t)
%
%
% SOS clause
% -n2(0) | -n9(0) | -n6(0) | -n10(0).
% was split for some strategies as:
% -n2(0).
% -n9(0).
% -n6(0).
% -n10(0).
%
% ********* EMPTY CLAUSE DERIVED *********
%
%
% timer checkpoints: c(36,40,0,72,0,0)
%
%
% START OF PROOF
% 37 [] -n8(0) | -n10(0) | n7(0).
% 38 [] -n7(0) | -n10(0) | n8(0).
% 39 [] n7(0) | n8(0) | n10(0).
% 40 [] -n7(0) | -n8(0) | n10(0).
% 41 [] -n4(0) | -n9(0) | n3(0).
% 42 [] -n3(0) | -n9(0) | n4(0).
% 43 [] n3(0) | n4(0) | n9(0).
% 44 [] -n3(0) | -n4(0) | n9(0).
% 45 [] -n1(X) | -p(Y) | p(X).
% 46 [] -n1(X) | -p(X) | p(Y).
% 47 [] p(s1(X)) | n1(X) | p(X).
% 48 [] -p(s1(X)) | -p(X) | n1(X).
% 49 [] -n2(0) | n1(s2).
% 50 [] n2(0) | -n1(X).
% 51 [] -n3(0) | q(s3).
% 52 [] n3(0) | -q(X).
% 53 [] -n4(0) | p(X).
% 54 [] -p(s4) | n4(0).
% 55 [] -n5(X) | -q(X) | q(Y).
% 56 [] -n5(X) | -q(Y) | q(X).
% 57 [] q(s5(X)) | n5(X) | q(X).
% 58 [] -q(s5(X)) | -q(X) | n5(X).
% 59 [] -n6(0) | n5(s6).
% 60 [] n6(0) | -n5(X).
% 61 [] -n7(0) | p(s7).
% 62 [] n7(0) | -p(X).
% 63 [] -n8(0) | q(X).
% 64 [] -q(s8) | n8(0).
% 66 [] -n6(0) | -n9(0) | n10(0) | n2(0).
% 67 [] -n10(0) | -n2(0) | n6(0) | n9(0).
% 68 [] -n6(0) | -n2(0) | n10(0) | n9(0).
% 69 [] n10(0) | n6(0) | n9(0) | n2(0).
% 70 [] -n10(0) | -n6(0) | n9(0) | n2(0).
% 71 [] -n9(0) | -n2(0) | n10(0) | n6(0).
% 72 [] -n10(0) | -n6(0) | -n9(0) | -n2(0).
% 95 [hyper:63,39] n7(0) | n10(0) | q(X).
% 102 [hyper:52,95] n3(0) | n7(0) | n10(0).
% 104 [hyper:58,95,95] n7(0) | n10(0) | n5(X).
% 114 [hyper:60,104] n7(0) | n10(0) | n6(0).
% 159 [hyper:53,43] n3(0) | n9(0) | p(X).
% 186 [hyper:48,159,159] n3(0) | n9(0) | n1(X).
% 187 [hyper:51,159] q(s3) | n9(0) | p(X).
% 211 [hyper:50,186] n3(0) | n9(0) | n2(0).
% 323 [hyper:54,47,binarycut:53] p(s1(s4)) | n1(s4).
% 338 [hyper:62,323] n1(s4) | n7(0).
% 351 [hyper:50,338] n7(0) | n2(0).
% 372 [hyper:61,351] p(s7) | n2(0).
% 422 [hyper:64,57,binarycut:63] q(s5(s8)) | n5(s8).
% 506 [hyper:52,422] n3(0) | n5(s8).
% 528 [hyper:60,506] n3(0) | n6(0).
% 625 [hyper:72,528,372,187,39,binarycut:51,binarycut:61,binarycut:63,factor] p(s7) | q(s3).
% 645 [hyper:72,528,372,159,102,binarycut:61,factor] n3(0) | p(s7).
% 735 [hyper:62,625] n7(0) | q(s3).
% 749 [hyper:62,645] n3(0) | n7(0).
% 1014 [hyper:38,69,binarycut:351] n8(0) | n6(0) | n9(0) | n2(0).
% 1025 [hyper:67,114,351] n7(0) | n6(0) | n9(0).
% 1027 [hyper:68,114,351] n7(0) | n10(0) | n9(0).
% 1062 [hyper:66,211,528] n3(0) | n10(0) | n2(0).
% 1064 [hyper:68,211,528] n3(0) | n10(0) | n9(0).
% 1086 [hyper:42,1025,binarycut:749] n4(0) | n7(0) | n6(0).
% 1124 [hyper:38,1062,binarycut:351] n3(0) | n8(0) | n2(0).
% 1133 [hyper:38,1064,735,binarycut:51,binarycut:63] q(s3) | n9(0).
% 1182 [hyper:53,1086] n7(0) | n6(0) | p(X).
% 1212 [hyper:61,1182,factor] p(s7) | n6(0).
% 1236 [hyper:59,1212] n5(s6) | p(s7).
% 1279 [hyper:56,1236,625] p(s7) | q(s6).
% 1304 [hyper:55,1279,binarycut:1236] p(s7) | q(X).
% 1321 [hyper:64,1304] p(s7) | n8(0).
% 1348 [hyper:37,1321,1027,binarycut:61] p(s7) | n9(0).
% 1387 [hyper:42,1348,binarycut:645,binarycut:53] p(s7).
% 1389 [hyper:45,1387,47] p(s1(X)) | p(X).
% 1396 [hyper:62,1387] n7(0).
% 1416 [hyper:46,1389,323,factor] p(s1(s4)).
% 1432 [hyper:63,1124] n3(0) | n2(0) | q(X).
% 1444 [hyper:51,1432,factor] q(s3) | n2(0).
% 1451 [hyper:49,1444] n1(s2) | q(s3).
% 1471 [?] ?
% 1473 [hyper:46,1451,binarycut:1471] q(s3) | p(X).
% 1489 [hyper:54,1473] n4(0) | q(s3).
% 1520 [hyper:41,1489,1133,binarycut:51] q(s3).
% 1529 [hyper:52,1520] n3(0).
% 1563 [hyper:63,1014] n6(0) | n9(0) | n2(0) | q(X).
% 1571 [hyper:42,1563,cut:1529] n4(0) | n6(0) | n2(0) | q(X).
% 1587 [hyper:53,1571] n6(0) | n2(0) | p(X) | q(Y).
% 1608 [hyper:48,1587,1587,factor] n6(0) | n2(0) | n1(X) | q(Y).
% 1628 [hyper:49,1608,factor] n1(s2) | n6(0) | q(X).
% 1650 [hyper:45,1628,slowcut:1416] p(s2) | n6(0) | q(X).
% 1687 [hyper:46,1650,1628,factor] n6(0) | p(X) | q(Y).
% 1719 [hyper:58,1687,1687,factor] n6(0) | n5(X) | p(Y).
% 1750 [hyper:59,1719,factor] n5(s6) | p(X).
% 1772 [?] ?
% 1774 [hyper:55,1750,binarycut:1772] p(X) | q(Y).
% 1777 [hyper:48,1774,binarycut:1774] n1(X) | q(Y).
% 1784 [hyper:58,1774,1774,factor] n5(X) | p(Y).
% 1793 [hyper:58,1777,1777,factor] n1(X) | n5(Y).
% 1794 [hyper:64,1777] n8(0) | n1(X).
% 1796 [hyper:54,1784] n4(0) | n5(X).
% 1798 [hyper:50,1793] n2(0) | n5(X).
% 1824 [hyper:40,1794,cut:1396] n10(0) | n1(X).
% 1826 [hyper:44,1796,cut:1529] n9(0) | n5(X).
% 1830 [hyper:60,1798] n6(0) | n2(0).
% 1859 [hyper:50,1824] n10(0) | n2(0).
% 1865 [hyper:60,1826] n6(0) | n9(0).
% 1885 [hyper:70,1830,binarycut:1859] n9(0) | n2(0).
% 1908 [hyper:71,1865,1830] n10(0) | n6(0).
% 1910 [hyper:42,1885,cut:1529] n4(0) | n2(0).
% 1914 [hyper:38,1908,cut:1396] n8(0) | n6(0).
% 1935 [hyper:53,1910] n2(0) | p(X).
% 1962 [hyper:48,1935,1935] n2(0) | n1(X).
% 1970 [hyper:49,1962,factor] n1(s2).
% 1971 [hyper:50,1962] n2(0).
% 1975 [?] ?
% 1976 [hyper:46,1970,cut:1975] p(X).
% 1978 [hyper:54,1976] n4(0).
% 1981 [hyper:44,1978,cut:1529] n9(0).
% 1987 [hyper:63,1914] n6(0) | q(X).
% 1997 [hyper:58,1987,1987] n6(0) | n5(X).
% 2003 [hyper:59,1997,factor] n5(s6).
% 2004 [hyper:60,1997] n6(0).
% 2010 [?] ?
% 2011 [hyper:55,2003,cut:2010] q(X).
% 2013 [hyper:64,2011] n8(0).
% 2016 [hyper:40,2013,cut:1396] n10(0).
% 2017 [hyper:72,2016,cut:2004,cut:1981,cut:1971] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using hyperresolution
% not using sos strategy
% using positive unit paramodulation strategy
% using dynamic demodulation
% using ordered paramodulation
% using kb ordering for equality
% preferring bigger arities for lex ordering
% clause length limited to 7
% clause depth limited to 2
% seconds given: 9
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 179
% derived clauses: 7271
% kept clauses: 533
% kept size sum: 3530
% kept mid-nuclei: 1145
% kept new demods: 0
% forw unit-subs: 88
% forw double-subs: 2824
% forw overdouble-subs: 1983
% backward subs: 438
% fast unit cutoff: 75
% full unit cutoff: 5
% dbl unit cutoff: 86
% real runtime: 0.15
% process. runtime: 0.13
% specific non-discr-tree subsumption statistics:
% tried: 13737
% length fails: 554
% strength fails: 1989
% predlist fails: 8778
% aux str. fails: 28
% by-lit fails: 59
% full subs tried: 1629
% full subs fail: 288
%
% ; 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/SYN037-1+noeq.in")
%
%------------------------------------------------------------------------------