TSTP Solution File: SYN036-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SYN036-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 : art10.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 60.0s
% Output : Assurance 60.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-1+noeq.in
% Using automatic strategy selection.
% Time limit in seconds: 600
%
% prove-all-passes started
%
% detected problem class: nne
% detected subclass: big
%
% strategies selected:
% (hyper 30 #f 2 15)
% (binary-unit 30 #f 2 15)
% (binary-double 18 #f 2 15)
% (binary 90 #t 2 15)
% (binary-order 30 #f 2 15)
% (binary-posweight-order 54 #f)
% (binary-order-sos 30 #t)
% (binary-unit-uniteq 30 #f)
% (binary-weightorder 30 #f)
% (binary-weightorder-sos 30 #f)
% (binary-order 30 #f)
% (hyper-order 30 #f)
% (binary 168 #t)
%
%
% SOS clause
% -big_p(X) | -big_p(f3(X)) | -big_q(Y) | -big_p(c15) | -big_q(f4(Z)) | -big_q(Z) | -big_p(U) | -big_q(c20).
% was split for some strategies as:
% -big_q(f4(Z)) | -big_q(Z).
% -big_p(X) | -big_p(f3(X)).
% -big_q(Y).
% -big_p(c15).
% -big_p(U).
% -big_q(c20).
%
% ********* EMPTY CLAUSE DERIVED *********
%
% **** EMPTY CLAUSE DERIVED ****
% By given clause simplification.
%
%
% timer checkpoints: c(128,40,1,261,0,1,15440,4,1308,20490,5,1502,20490,1,1502,20490,50,1502,20490,40,1502,20623,0,1502,21446,50,1505,21579,0,1505,22402,50,1509,22535,0,1509,23358,50,1512,23491,0,1513,24314,50,1515,24447,0,1516,25270,50,1519,25403,0,1519,26226,50,1522,26359,0,1523,27182,50,1526,27315,0,1526,28138,50,1529,28271,0,1530,29094,50,1533,29227,0,1533,30050,50,1536,30183,0,1536,31006,50,1540,31139,0,1540,31962,50,1543,32095,0,1544,32918,50,1547,33051,0,1547,33874,50,1551,34007,0,1551,34830,50,1554,34963,0,1555,35786,50,1558,35919,0,1558,36742,50,1562,36875,0,1562,37698,50,1565,37831,0,1566,38654,50,1569,38787,0,1569,39610,50,1573,39610,40,1573,39743,0,1573,40680,50,1578,40813,0,1579,41750,50,1583,41883,0,1584,42820,50,1588,42953,0,1588,43890,50,1593,44023,0,1593,44960,50,1599,45093,0,1599,46030,50,1604,46163,0,1604,47100,50,1609,47233,0,1609,48170,50,1614,48303,0,1614,49240,50,1620,49373,0,1620,50310,50,1625,50443,0,1625,51380,50,1631,51513,0,1631,52450,50,1635,52583,0,1636,53520,50,1641,53653,0,1641,54590,50,1647,54723,0,1647,55660,50,1652,55793,0,1653,56730,50,1658,56863,0,1658,57800,50,1663,57933,0,1664,58870,50,1669,59003,0,1670,59940,50,1675,60073,0,1675,61010,50,1681,61010,40,1681,61143,0,1681,106572,3,3933,107007,4,5057,107451,1,6182,107451,50,6183,107451,40,6183,107584,0,6183)
%
%
% START OF PROOF
% 107456 [?] ?
% 107458 [?] ?
% 107478 [?] ?
% 107491 [?] ?
% 107496 [?] ?
% 107498 [?] ?
% 107507 [?] ?
% 107512 [?] ?
% 107514 [?] ?
% 107530 [?] ?
% 107546 [?] ?
% 107554 [?] ?
% 107572 [?] ?
% 107574 [?] ?
% 107575 [?] ?
% 107580 [] -big_q(c20) | -big_p(c15) | $spltprd0($spltcnst17) | -big_q(f4(X)) | -big_q(X).
% 107581 [] $spltprd0($spltcnst18) | -big_p(f3(X)) | -big_p(X).
% 107582 [] $spltprd0($spltcnst19) | -big_q(X).
% 107583 [] $spltprd0($spltcnst20) | -big_p(X).
% 107584 [] -$spltprd0($spltcnst18) | -$spltprd0($spltcnst17) | -$spltprd0($spltcnst20) | -$spltprd0($spltcnst19).
% 107609 [input:107456,factor:factor:factor:factor:factor] -big_p(f3(c15)) | -big_q(c16) | -big_p(c15) | big_q(X).
% 107618 [input:107458,factor:factor:factor:factor:factor:factor] -big_p(f3(c15)) | -big_p(c15) | big_q(c16) | -big_q(X).
% 107720 [input:107491,factor:factor:factor:factor:factor:factor:factor] -big_q(f4(c20)) | -big_q(c20) | big_p(c11) | -big_p(X).
% 107733 [input:107496,factor:factor:factor:factor] -big_q(c16) | big_p(c11) | -big_p(X) | big_q(Y).
% 107740 [input:107498,factor:factor:factor:factor] big_q(c16) | big_p(c11) | -big_q(X) | -big_p(Y).
% 107767 [input:107507,factor:factor:factor:factor:factor:factor:factor] -big_q(f4(c20)) | -big_q(c20) | -big_p(c11) | big_p(X).
% 107784 [input:107512,factor:factor:factor:factor] -big_q(c16) | -big_p(c11) | big_q(X) | big_p(Y).
% 107792 [input:107514,factor:factor:factor:factor] -big_p(c11) | big_q(c16) | -big_q(X) | big_p(Y).
% 108286 [binary:107733,107740,factor] big_p(c11) | -big_q(X) | -big_p(Y) | big_q(Z).
% 108305 [binary:108286,107784.2,factor:factor] -big_q(c16) | -big_p(X) | big_q(Y) | big_p(Z).
% 108356 [binary:108286,107792,factor:factor] big_q(c16) | -big_q(X) | -big_p(Y) | big_p(Z).
% 108372 [binary:108305,108356,factor:factor] -big_q(X) | -big_p(Y) | big_q(Z) | big_p(U).
% 108447 [binary:108372.4,107609,factor:factor:factor] -big_q(c16) | -big_p(c15) | big_q(X).
% 108458 [binary:107580.4,108447.3,factor] -big_q(c20) | -big_q(c16) | -big_p(c15) | $spltprd0($spltcnst17).
% 108465 [binary:108372.4,108447.2,factor:factor] -big_q(c16) | -big_p(X) | big_q(Y).
% 108480 [binary:108465.3,108458,factor] -big_q(c16) | -big_p(c15) | $spltprd0($spltcnst17).
% 108483 [binary:107584.2,108480.3,binarycut:107583,binarycut:107582] -$spltprd0($spltcnst18) | -big_q(c16) | -big_p(c15).
% 108520 [binary:108372.4,107618,factor:factor:factor] -big_p(c15) | big_q(c16) | -big_q(X).
% 108524 [binary:108372.4,108520,factor:factor] big_q(c16) | -big_q(X) | -big_p(Y).
% 108528 [binary:108483.2,108520.2] -$spltprd0($spltcnst18) | -big_p(c15) | -big_q(X).
% 108532 [binary:108465,108524,factor] -big_q(X) | -big_p(Y) | big_q(Z).
% 108547 [binary:108532.3,107720,factor:factor] -big_q(c20) | big_p(c11) | -big_p(X).
% 108550 [binary:108532.3,108547,factor] big_p(c11) | -big_q(X) | -big_p(Y).
% 108565 [binary:108532.3,107767,factor:factor] -big_q(c20) | -big_p(c11) | big_p(X).
% 108584 [binary:108532.3,108565,factor] -big_p(c11) | -big_q(X) | big_p(Y).
% 108619 [binary:108550,108584,factor] -big_q(X) | -big_p(Y) | big_p(Z).
% 108622 [binary:107581.2,108619.3,factor] $spltprd0($spltcnst18) | -big_q(X) | -big_p(Y).
% 108636 [binary:108528.2,108619.3,factor] -$spltprd0($spltcnst18) | -big_q(X) | -big_p(Y).
% 108650 [binary:108622,108636,factor:factor] -big_q(X) | -big_p(Y).
% 108653 [input:107530,factor:factor:factor:factor:factor:factor:binarycut:108650,binarycut:108650] big_p(c3) | -big_p(X).
% 108654 [binary:108653.2,108653] big_p(c3) | -big_p(X).
% 108657 [input:107546,factor:factor:factor:factor:factor:binarycut:108650,binarycut:108650] -big_p(c3) | big_p(X).
% 108662 [binary:108654,108657] -big_p(X) | big_p(Y).
% 108667 [input:107572,factor:factor:factor:factor:factor:binarycut:108662] -big_q(c8) | big_p(c9) | big_q(X).
% 108670 [binary:108650.2,108667.2,factor] -big_q(c8) | big_q(X).
% 108673 [input:107574,factor:factor:factor:factor:factor:binarycut:108662] big_q(c8) | big_p(c9) | -big_q(X).
% 108679 [binary:108650.2,108673.2,factor:binarydemod:108670] -big_q(X) | big_q(Y).
% 108682 [input:107478,factor:factor:factor:factor:factor:factor:binarycut:108679,binarycut:108662] big_q(c14) | big_p(c19).
% 108687 [binary:108662,108682.2] big_q(c14) | big_p(X).
% 108693 [binary:108679,108687] big_q(X) | big_p(Y).
% 108708 [input:107554,factor:factor:factor:factor:factor:factor:binarycut:108650,binarycut:108650] -big_p(f1(c2)) | -big_p(c2).
% 108710 [binary:108662.2,108708,factor] -big_p(c2).
% 108711 [binary:108662.2,108710] -big_p(X).
% 108713 [binary:108693.2,108710] big_q(X).
% 108716 [input:107575,factor:factor:factor:factor:factor:factor:factor:cut:108713,cut:108711,cut:108713,cut:108711] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using binary resolution
% using term-depth-order strategy
% not using sos 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 15
% clause depth limited to 2
% seconds given: 15
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 7574
% derived clauses: 366237
% kept clauses: 59168
% kept size sum: 7999
% kept mid-nuclei: 12853
% kept new demods: 0
% forw unit-subs: 1640
% forw double-subs: 40873
% forw overdouble-subs: 179371
% backward subs: 17664
% fast unit cutoff: 33
% full unit cutoff: 0
% dbl unit cutoff: 121
% real runtime: 61.93
% process. runtime: 61.91
% specific non-discr-tree subsumption statistics:
% tried: 31796033
% length fails: 1651410
% strength fails: 9836749
% predlist fails: 3979413
% aux str. fails: 2075300
% by-lit fails: 10405602
% full subs tried: 2363736
% full subs fail: 2158044
%
% ; 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-1+noeq.in")
%
%------------------------------------------------------------------------------