TSTP Solution File: SWC080-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SWC080-1 : TPTP v3.4.2. Released v2.4.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 368.8s
% Output : Assurance 368.8s
% 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/SWC/SWC080-1+eq_r.in
% Using automatic strategy selection.
% Time limit in seconds: 600
%
% prove-all-passes started
%
% detected problem class: neq
% detected subclass: big
%
% strategies selected:
% (hyper 28 #f 5 19)
% (binary-unit 28 #f 5 19)
% (binary-double 11 #f 5 19)
% (binary-double 17 #f)
% (binary-double 17 #t)
% (binary 87 #t 5 19)
% (binary-order 28 #f 5 19)
% (binary-posweight-order 58 #f)
% (binary-posweight-lex-big-order 28 #f)
% (binary-posweight-lex-small-order 11 #f)
% (binary-order-sos 28 #t)
% (binary-unit-uniteq 28 #f)
% (binary-weightorder 28 #f)
% (binary-weightorder-sos 17 #f)
% (binary-order 28 #f)
% (hyper-order 17 #f)
% (binary 141 #t)
%
%
% ********* EMPTY CLAUSE DERIVED *********
%
%
% timer checkpoints: c(204,40,0,408,0,1,55069,4,2205,56925,5,2803,56926,1,2803,56926,50,2805,56926,40,2805,57130,0,2805,138904,3,4238,169726,4,4907,195658,5,5608,195658,5,5610,195659,1,5610,195659,50,5614,195659,40,5614,195863,0,5614,234505,3,6165,251640,4,6440,267843,5,6715,267843,5,6717,267843,1,6717,267843,50,6719,267843,40,6719,268047,0,6719,327356,3,7572,345018,4,7996,358138,5,8420,358140,5,8421,358140,1,8421,358140,50,8423,358140,40,8423,358344,0,8424,429773,3,9276,453142,4,9701,471693,5,10125,471694,5,10127,471695,1,10127,471695,50,10130,471695,40,10130,471899,0,10130,780037,3,14489,871754,4,16662,960864,5,18831,960865,5,18834,960866,1,18834,960866,50,18837,960866,40,18837,961070,0,18837,1001718,3,20238,1005994,4,20938,1012995,5,21638,1012996,1,21638,1012996,50,21640,1012996,40,21640,1013200,0,21640,1256602,3,24542,1373222,4,25992,1439821,5,27442,1439822,1,27442,1439822,50,27448,1439822,40,27448,1440026,0,27479,1598132,3,28881,1647324,4,29580,1696948,5,30280,1696949,1,30280,1696949,50,30286,1696949,40,30286,1697153,0,30321,1750098,3,30886,1765922,4,31147,1814348,5,31422,1814349,1,31422,1814349,50,31427,1814349,40,31427,1814553,0,31427,1856016,3,32828,1859369,4,33528,1867302,5,34228,1867303,1,34228,1867303,50,34230,1867303,40,34230,1867507,0,34230,1946251,3,35631,1950263,4,36332,1965838,5,37031,1965839,5,37032,1965839,1,37032,1965839,50,37035,1965839,40,37035,1966043,0,37035)
%
%
% START OF PROOF
% 1965848 [] ss^list(nil).
% 1965891 [] ss^list(skaf45(X,Y)).
% 1965897 [] segment^p(X,X) | -ss^list(X).
% 1965914 [] equal(app(nil,X),X) | -ss^list(X).
% 1965972 [] equal(app(X,skaf45(Y,X)),Y) | -frontseg^p(Y,X) | -ss^list(Y) | -ss^list(X).
% 1966012 [] segment^p(app(app(X,Y),Z),U) | -segment^p(Y,U) | -ss^list(Y) | -ss^list(U) | -ss^list(Z) | -ss^list(X).
% 1966026 [] ss^list(sk1).
% 1966027 [] ss^list(sk2).
% 1966030 [] equal(sk2,sk4).
% 1966031 [] equal(sk1,sk3).
% 1966032 [] neq(sk2,nil).
% 1966039 [] -neq(sk4,nil) | -neq(X,nil) | -segment^p(sk1,X) | -segment^p(sk2,X) | -ss^list(X).
% 1966040 [] -neq(sk4,nil) | ss^list(sk5).
% 1966041 [] -neq(sk4,nil) | neq(sk5,nil).
% 1966042 [] -neq(sk4,nil) | frontseg^p(sk4,sk5).
% 1966043 [] -neq(sk4,nil) | frontseg^p(sk3,sk5).
% 1966812 [para:1966030.1.2,1966040.1.1,cut:1966032] ss^list(sk5).
% 1966814 [para:1966030.1.2,1966039.1.1,cut:1966032] -neq(X,nil) | -segment^p(sk2,X) | -segment^p(sk1,X) | -ss^list(X).
% 1966816 [para:1966030.1.2,1966041.1.1,cut:1966032] neq(sk5,nil).
% 1966818 [para:1966030.1.2,1966042.1.1,cut:1966032] frontseg^p(sk4,sk5).
% 1966820 [para:1966030.1.2,1966043.1.1,cut:1966032] frontseg^p(sk3,sk5).
% 1966821 [para:1966030.1.2,1966818.1.1] frontseg^p(sk2,sk5).
% 1966822 [para:1966031.1.2,1966820.1.1] frontseg^p(sk1,sk5).
% 1966825 [binary:1966816,1966814,cut:1966812] -segment^p(sk2,sk5) | -segment^p(sk1,sk5).
% 1969132 [para:1965914.1.1,1966012.1.1.1,cut:1965848,factor:factor:binarycut:1965897] segment^p(app(X,Y),X) | -ss^list(Y) | -ss^list(X).
% 1972158 [para:1965972.1.1,1969132.1.1,cut:1965891] -frontseg^p(X,Y) | segment^p(X,Y) | -ss^list(X) | -ss^list(Y).
% 1974261 [binary:1966821,1972158,cut:1966027,cut:1966812] segment^p(sk2,sk5).
% 1974262 [binary:1966822,1972158,cut:1966026,cut:1966812] segment^p(sk1,sk5).
% 1974406 [binary:1966825,1974261,cut:1974262] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using binary resolution
% using weight-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
% seconds given: 28
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 26777
% derived clauses: 2837704
% kept clauses: 766826
% kept size sum: 145605
% kept mid-nuclei: 338098
% kept new demods: 67112
% forw unit-subs: 228352
% forw double-subs: 73983
% forw overdouble-subs: 68840
% backward subs: 628
% fast unit cutoff: 266534
% full unit cutoff: 122
% dbl unit cutoff: 9983
% real runtime : 373.3
% process. runtime: 371.48
% specific non-discr-tree subsumption statistics:
% tried: 11268271
% length fails: 381173
% strength fails: 2074718
% predlist fails: 5374072
% aux str. fails: 246774
% by-lit fails: 345328
% full subs tried: 2677666
% full subs fail: 2590722
%
% ; 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/SWC/SWC080-1+eq_r.in")
%
%------------------------------------------------------------------------------