TSTP Solution File: SYN036-3 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SYN036-3 : 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 : art08.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/SYN036-3+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
% 38 [] -n7(0) | -n10(0) | n8(0).
% 39 [] n7(0) | n8(0) | n10(0).
% 40 [] -n7(0) | -n8(0) | n10(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) | q(X).
% 54 [] -q(s4) | n4(0).
% 56 [] -q(X) | -n5(X) | q(Y).
% 57 [] q(s5(X)) | q(X) | n5(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) | p(X).
% 64 [] -p(s8) | n8(0).
% 66 [] -n6(0) | -n9(0) | n10(0) | n2(0).
% 67 [] -n10(0) | -n2(0) | n6(0) | n9(0).
% 69 [] n10(0) | n6(0) | n9(0) | n2(0).
% 72 [] -n10(0) | -n6(0) | -n9(0) | -n2(0).
% 95 [hyper:61,39,binarycut:63] p(s7) | n10(0).
% 106 [hyper:62,95] n7(0) | n10(0).
% 131 [hyper:51,43,binarycut:53] q(s3) | n9(0).
% 145 [hyper:52,131] n3(0) | n9(0).
% 191 [hyper:64,47,binarycut:63] p(s1(s8)) | n1(s8).
% 204 [hyper:62,191] n1(s8) | n7(0).
% 212 [hyper:38,204,95,binarycut:63] n1(s8) | p(s7).
% 214 [hyper:50,204] n7(0) | n2(0).
% 226 [hyper:50,212] p(s7) | n2(0).
% 243 [hyper:67,214,95,binarycut:61] p(s7) | n6(0) | n9(0).
% 267 [hyper:54,57,binarycut:53] q(s5(s4)) | n5(s4).
% 316 [hyper:52,267] n3(0) | n5(s4).
% 334 [hyper:60,316] n3(0) | n6(0).
% 369 [hyper:72,334,95,145,226] n3(0) | p(s7).
% 375 [hyper:66,334,131,binarycut:51] q(s3) | n10(0) | n2(0).
% 587 [hyper:38,69,binarycut:214] n8(0) | n6(0) | n9(0) | n2(0).
% 594 [hyper:42,243,binarycut:369] n4(0) | p(s7) | n6(0).
% 615 [hyper:38,375,binarycut:214] q(s3) | n8(0) | n2(0).
% 641 [hyper:53,594] p(s7) | n6(0) | q(X).
% 663 [hyper:58,641,641] p(s7) | n6(0) | n5(X).
% 683 [hyper:59,663,factor] n5(s6) | p(s7).
% 706 [?] ?
% 708 [hyper:56,683,binarycut:706] p(s7) | q(X).
% 720 [hyper:54,708] n4(0) | p(s7).
% 726 [hyper:58,708,708] p(s7) | n5(X).
% 738 [hyper:62,726] n7(0) | n5(X).
% 750 [hyper:60,738] n7(0) | n6(0).
% 769 [hyper:44,720,binarycut:369] p(s7) | n9(0).
% 807 [hyper:72,769,106,750,214,binarycut:61] p(s7).
% 817 [hyper:45,807,47] p(s1(X)) | p(X).
% 822 [hyper:62,807] n7(0).
% 835 [hyper:46,817,191,factor] p(s1(s8)).
% 854 [hyper:63,615] q(s3) | n2(0) | p(X).
% 865 [hyper:48,854,854] q(s3) | n2(0) | n1(X).
% 880 [hyper:49,865,factor] n1(s2) | q(s3).
% 881 [hyper:50,865] q(s3) | n2(0).
% 894 [hyper:45,880,slowcut:835] q(s3) | p(s2).
% 910 [hyper:52,881] n3(0) | n2(0).
% 923 [hyper:46,894,binarycut:880] q(s3) | p(X).
% 945 [hyper:64,923] q(s3) | n8(0).
% 975 [hyper:40,945,cut:822] q(s3) | n10(0).
% 1004 [hyper:72,975,145,910,334,binarycut:51] q(s3).
% 1013 [hyper:52,1004] n3(0).
% 1046 [hyper:63,587] n6(0) | n9(0) | n2(0) | p(X).
% 1054 [hyper:42,1046,cut:1013] n4(0) | n6(0) | n2(0) | p(X).
% 1075 [hyper:53,1054] n6(0) | n2(0) | q(X) | p(Y).
% 1091 [hyper:48,1075,1075,factor] n6(0) | n2(0) | n1(X) | q(Y).
% 1111 [hyper:49,1091,factor] n1(s2) | n6(0) | q(X).
% 1132 [hyper:45,1111,slowcut:835] p(s2) | n6(0) | q(X).
% 1169 [hyper:46,1132,1111,factor] n6(0) | q(X) | p(Y).
% 1201 [hyper:58,1169,1169,factor] n6(0) | n5(X) | p(Y).
% 1231 [hyper:59,1201,factor] n5(s6) | p(X).
% 1250 [?] ?
% 1252 [hyper:56,1231,binarycut:1250] q(X) | p(Y).
% 1262 [hyper:48,1252,1252,factor] n1(X) | q(Y).
% 1265 [hyper:58,1252,binarycut:1252] n5(X) | p(Y).
% 1269 [hyper:54,1262] n4(0) | n1(X).
% 1275 [hyper:58,1262,1262,factor] n1(X) | n5(Y).
% 1277 [hyper:64,1265] n8(0) | n5(X).
% 1279 [hyper:50,1275] n2(0) | n5(X).
% 1305 [hyper:44,1269,cut:1013] n9(0) | n1(X).
% 1307 [hyper:40,1277,cut:822] n10(0) | n5(X).
% 1311 [hyper:60,1279] n6(0) | n2(0).
% 1340 [hyper:50,1305] n9(0) | n2(0).
% 1346 [hyper:60,1307] n10(0) | n6(0).
% 1366 [hyper:66,1311,binarycut:1340] n10(0) | n2(0).
% 1368 [hyper:67,1311,binarycut:1346] n6(0) | n9(0).
% 1379 [hyper:38,1366,cut:822] n8(0) | n2(0).
% 1382 [hyper:42,1368,cut:1013] n4(0) | n6(0).
% 1388 [hyper:63,1379] n2(0) | p(X).
% 1399 [hyper:48,1388,1388] n2(0) | n1(X).
% 1407 [hyper:49,1399,factor] n1(s2).
% 1408 [hyper:50,1399] n2(0).
% 1412 [?] ?
% 1413 [hyper:46,1407,cut:1412] p(X).
% 1415 [hyper:64,1413] n8(0).
% 1424 [hyper:40,1415,cut:822] n10(0).
% 1429 [hyper:53,1382] n6(0) | q(X).
% 1440 [hyper:58,1429,1429] n6(0) | n5(X).
% 1446 [hyper:59,1440,factor] n5(s6).
% 1447 [hyper:60,1440] n6(0).
% 1450 [?] ?
% 1451 [hyper:56,1446,cut:1450] q(X).
% 1452 [hyper:54,1451] n4(0).
% 1456 [hyper:44,1452,cut:1013] n9(0).
% 1457 [hyper:72,1456,cut:1447,cut:1424,cut:1408] 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: 164
% derived clauses: 4375
% kept clauses: 405
% kept size sum: 2474
% kept mid-nuclei: 756
% kept new demods: 0
% forw unit-subs: 155
% forw double-subs: 1716
% forw overdouble-subs: 796
% backward subs: 349
% fast unit cutoff: 62
% full unit cutoff: 5
% dbl unit cutoff: 59
% real runtime: 0.7
% process. runtime: 0.7
% specific non-discr-tree subsumption statistics:
% tried: 3689
% length fails: 237
% strength fails: 544
% predlist fails: 1892
% aux str. fails: 23
% by-lit fails: 11
% full subs tried: 749
% full subs fail: 150
%
% ; 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/SYN036-3+noeq.in")
%
%------------------------------------------------------------------------------