TSTP Solution File: SWC052-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SWC052-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 : art01.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 367.9s
% Output : Assurance 367.9s
% 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/SWC052-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(201,40,1,402,0,1,54358,4,2216,56274,5,2803,56275,1,2805,56275,50,2807,56275,40,2807,56476,0,2807,149955,3,4210,173546,4,4910,194751,5,5608,194751,5,5610,194752,1,5610,194752,50,5614,194752,40,5614,194953,0,5614,242309,3,6165,258762,4,6441,270065,5,6715,270066,5,6716,270066,1,6716,270066,50,6719,270066,40,6719,270267,0,6719,337658,3,7573,358426,4,7996,373744,5,8420,373745,5,8422,373745,1,8422,373745,50,8425,373745,40,8425,373946,0,8425,452715,3,9280,481417,4,9703,498399,62,10126,498399,5,10128,498400,1,10128,498400,50,10131,498400,40,10131,498601,0,10131,818090,3,14483,914793,4,16657,992489,5,18834,992490,1,18834,992490,50,18837,992490,40,18837,992691,0,18837,1032404,3,20238,1036094,4,20938,1043620,5,21638,1043621,1,21638,1043621,50,21640,1043621,40,21640,1043822,0,21640,1294481,3,24541,1421322,4,25991,1481240,1,27441,1481240,50,27447,1481240,40,27447,1481441,0,27477,1635310,3,28878,1685370,4,29578,1733538,5,30279,1733539,1,30279,1733539,50,30285,1733539,40,30285,1733740,0,30320,1782124,3,30872,1797333,4,31147,1841493,5,31421,1841493,1,31421,1841493,50,31426,1841493,40,31426,1841694,0,31426,1881548,3,32827,1884373,4,33527,1893073,5,34227,1893074,1,34227,1893074,50,34229,1893074,40,34229,1893275,0,34229,1971191,3,35630,1975175,4,36330,1989981,5,37030,1989982,5,37031,1989982,1,37031,1989982,50,37034,1989982,40,37034,1990183,0,37034)
%
%
% START OF PROOF
% 1989983 [] equal(X,X).
% 1989991 [] ss^list(nil).
% 1990034 [] ss^list(skaf45(X,Y)).
% 1990040 [] segment^p(X,X) | -ss^list(X).
% 1990057 [] equal(app(nil,X),X) | -ss^list(X).
% 1990083 [] neq(X,Y) | equal(X,Y) | -ss^list(Y) | -ss^list(X).
% 1990098 [] -neq(X,Y) | -equal(X,Y) | -ss^list(Y) | -ss^list(X).
% 1990115 [] equal(app(X,skaf45(Y,X)),Y) | -frontseg^p(Y,X) | -ss^list(Y) | -ss^list(X).
% 1990155 [] segment^p(app(app(X,Y),Z),U) | -segment^p(Y,U) | -ss^list(Y) | -ss^list(U) | -ss^list(Z) | -ss^list(X).
% 1990169 [] ss^list(sk1).
% 1990170 [] ss^list(sk2).
% 1990173 [] equal(sk2,sk4).
% 1990174 [] equal(sk1,sk3).
% 1990175 [] -equal(nil,sk4) | equal(nil,sk3).
% 1990176 [] -neq(sk4,nil) | ss^list(sk5).
% 1990177 [] -neq(sk4,nil) | neq(sk5,nil).
% 1990178 [] -neq(sk4,nil) | frontseg^p(sk4,sk5).
% 1990179 [] -neq(sk4,nil) | frontseg^p(sk3,sk5).
% 1990180 [] neq(sk2,nil) | equal(nil,sk2).
% 1990181 [] equal(nil,sk2) | -neq(X,nil) | -segment^p(sk2,X) | -segment^p(sk1,X) | -ss^list(X).
% 1990182 [] -equal(nil,sk1) | neq(sk2,nil).
% 1990183 [] -equal(nil,sk1) | -neq(X,nil) | -segment^p(sk2,X) | -segment^p(sk1,X) | -ss^list(X).
% 1990951 [para:1990173.1.2,1990175.1.2] -equal(nil,sk2) | equal(nil,sk3).
% 1990953 [para:1990173.1.2,1990176.1.1] -neq(sk2,nil) | ss^list(sk5).
% 1990956 [para:1990173.1.2,1990177.1.1] -neq(sk2,nil) | neq(sk5,nil).
% 1990958 [para:1990173.1.2,1990178.1.1] -neq(sk2,nil) | frontseg^p(sk4,sk5).
% 1990960 [para:1990173.1.2,1990179.1.1] -neq(sk2,nil) | frontseg^p(sk3,sk5).
% 1990962 [binary:1990953,1990180] equal(nil,sk2) | ss^list(sk5).
% 1990972 [para:1990181.1.2,1990951.1.2,cut:1989983] equal(nil,sk3) | -neq(X,nil) | -segment^p(sk1,X) | -segment^p(sk2,X) | -ss^list(X).
% 1990973 [para:1990962.1.2,1990951.1.2,cut:1989983] equal(nil,sk3) | ss^list(sk5).
% 1990976 [para:1990973.1.2,1990174.1.2] equal(sk1,nil) | ss^list(sk5).
% 1990990 [para:1990976.1.1,1990182.1.2,cut:1989983,binarycut:1990953] ss^list(sk5).
% 1991043 [binary:1990180,1990956] neq(sk5,nil) | equal(nil,sk2).
% 1991056 [binary:1990180,1990958] frontseg^p(sk4,sk5) | equal(nil,sk2).
% 1991071 [binary:1990180,1990960] frontseg^p(sk3,sk5) | equal(nil,sk2).
% 1991083 [para:1990173.1.2,1991056.1.1] frontseg^p(sk2,sk5) | equal(nil,sk2).
% 1991085 [para:1990174.1.2,1991071.1.1] frontseg^p(sk1,sk5) | equal(nil,sk2).
% 1991098 [para:1990972.1.2,1990174.1.2] equal(sk1,nil) | -neq(X,nil) | -segment^p(sk2,X) | -segment^p(sk1,X) | -ss^list(X).
% 1991117 [para:1991098.1.1,1990183.1.2,cut:1989983,factor] -neq(X,nil) | -segment^p(sk2,X) | -segment^p(sk1,X) | -ss^list(X).
% 1991147 [binary:1990956,1990083,cut:1989991,cut:1990170] neq(sk5,nil) | equal(sk2,nil).
% 1991148 [binary:1990958,1990083,cut:1989991,cut:1990170] frontseg^p(sk4,sk5) | equal(sk2,nil).
% 1991149 [binary:1990960,1990083,cut:1989991,cut:1990170] frontseg^p(sk3,sk5) | equal(sk2,nil).
% 1991184 [para:1990173.1.2,1991148.1.1] frontseg^p(sk2,sk5) | equal(sk2,nil).
% 1991186 [para:1990174.1.2,1991149.1.1] frontseg^p(sk1,sk5) | equal(sk2,nil).
% 1993344 [para:1990057.1.1,1990155.1.1.1,cut:1989991,factor:factor:binarycut:1990040] segment^p(app(X,Y),X) | -ss^list(Y) | -ss^list(X).
% 1994378 [para:1990115.1.1,1993344.1.1,cut:1990034] -frontseg^p(X,Y) | segment^p(X,Y) | -ss^list(X) | -ss^list(Y).
% 1996473 [binary:1991083,1994378,cut:1990170,cut:1990990] segment^p(sk2,sk5) | equal(nil,sk2).
% 1996474 [binary:1991085,1994378,cut:1990169,cut:1990990] segment^p(sk1,sk5) | equal(nil,sk2).
% 1996481 [binary:1991184,1994378,cut:1990170,cut:1990990] segment^p(sk2,sk5) | equal(sk2,nil).
% 1996482 [binary:1991186,1994378,cut:1990169,cut:1990990] segment^p(sk1,sk5) | equal(sk2,nil).
% 2012627 [binary:1991043,1991117,cut:1990990,binarycut:1996474,binarycut:1996473] equal(nil,sk2).
% 2012632 [binary:1991147,1991117,cut:1990990,binarycut:1996482,binarycut:1996481] equal(sk2,nil).
% 2012633 [para:2012627.1.2,1990951.1.2,cut:1989983] equal(nil,sk3).
% 2012908 [para:2012633.1.2,1990174.1.2] equal(sk1,nil).
% 2014473 [para:2012908.1.1,1990182.1.2,cut:1989983] neq(sk2,nil).
% 2014615 [binary:1990098,2014473,cut:2012632,cut:1989991,cut:1990170] 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: 27136
% derived clauses: 2759506
% kept clauses: 790190
% kept size sum: 471245
% kept mid-nuclei: 312679
% kept new demods: 68201
% forw unit-subs: 207632
% forw double-subs: 76210
% forw overdouble-subs: 65095
% backward subs: 1467
% fast unit cutoff: 245073
% full unit cutoff: 93
% dbl unit cutoff: 12260
% real runtime : 379.13
% process. runtime: 376.59
% specific non-discr-tree subsumption statistics:
% tried: 10951821
% length fails: 378118
% strength fails: 2232524
% predlist fails: 4993290
% aux str. fails: 228460
% by-lit fails: 400025
% full subs tried: 2534714
% full subs fail: 2450420
%
% ; 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/SWC052-1+eq_r.in")
%
%------------------------------------------------------------------------------