TSTP Solution File: SWC054-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SWC054-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 : 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 208.5s
% Output : Assurance 208.5s
% 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/SWC054-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,2247,56259,5,2802,56260,1,2803,56260,50,2806,56260,40,2806,56461,0,2806,147071,3,4209,171512,4,4907,191676,5,5607,191676,5,5609,191677,1,5609,191677,50,5613,191677,40,5613,191878,0,5613,239200,3,6164,255698,4,6447,266967,5,6714,266968,5,6715,266968,1,6715,266968,50,6718,266968,40,6718,267169,0,6718,333678,3,7573,354123,4,7996,369427,5,8419,369428,5,8421,369428,1,8421,369428,50,8424,369428,40,8424,369629,0,8425,447067,3,9280,472450,4,9704,489690,5,10126,489690,5,10128,489691,1,10128,489691,50,10132,489691,40,10132,489892,0,10132,805492,3,14515,902036,4,16658,980263,5,18834,980264,1,18834,980264,50,18837,980264,40,18837,980465,0,18838,1019648,3,20239)
%
%
% START OF PROOF
% 980265 [] equal(X,X).
% 980273 [] ss^list(nil).
% 980321 [] segment^p(X,nil) | -ss^list(X).
% 980344 [] -equal(nil,X) | segment^p(nil,X) | -ss^list(X).
% 980345 [] -segment^p(nil,X) | equal(nil,X) | -ss^list(X).
% 980380 [] -neq(X,Y) | -equal(X,Y) | -ss^list(Y) | -ss^list(X).
% 980392 [] -segment^p(X,Y) | -segment^p(Y,X) | equal(Y,X) | -ss^list(Y) | -ss^list(X).
% 980452 [] ss^list(sk2).
% 980455 [] equal(sk2,sk4).
% 980456 [] equal(sk1,sk3).
% 980457 [] -equal(nil,sk4) | equal(nil,sk3).
% 980458 [] -neq(sk4,nil) | ss^list(sk5).
% 980459 [] -neq(sk4,nil) | neq(sk5,nil).
% 980460 [] -neq(sk4,nil) | segment^p(sk4,sk5).
% 980461 [] -neq(sk4,nil) | segment^p(sk3,sk5).
% 980462 [] neq(sk2,nil) | equal(nil,sk2).
% 980463 [] equal(nil,sk2) | -neq(X,nil) | -segment^p(sk2,X) | -segment^p(sk1,X) | -ss^list(X).
% 980464 [] -equal(nil,sk1) | neq(sk2,nil).
% 981233 [para:980455.1.2,980457.1.2] -equal(nil,sk2) | equal(nil,sk3).
% 981237 [para:980455.1.2,980458.1.1] -neq(sk2,nil) | ss^list(sk5).
% 981240 [para:980455.1.2,980459.1.1] -neq(sk2,nil) | neq(sk5,nil).
% 981242 [para:980455.1.2,980460.1.1] -neq(sk2,nil) | segment^p(sk4,sk5).
% 981245 [para:980455.1.2,980461.1.1] -neq(sk2,nil) | segment^p(sk3,sk5).
% 981249 [binary:981237,980462] equal(nil,sk2) | ss^list(sk5).
% 981270 [binary:981237,980464.2] -equal(nil,sk1) | ss^list(sk5).
% 981347 [para:980456.1.2,981233.2.2] -equal(nil,sk2) | equal(nil,sk1).
% 981351 [para:981249.1.2,981233.1.2,cut:980265] equal(nil,sk3) | ss^list(sk5).
% 981354 [binary:980452,980321.2] segment^p(sk2,nil).
% 981357 [binary:980273,980321.2] segment^p(nil,nil).
% 981643 [para:980456.1.2,981351.1.2,binarycut:981270] ss^list(sk5).
% 989032 [para:980462.2.2,981347.1.2,cut:980265,binarycut:980464] neq(sk2,nil).
% 989048 [binary:980380,989032,cut:980273,cut:980452] -equal(sk2,nil).
% 989049 [binary:981240,989032] neq(sk5,nil).
% 989050 [binary:981242,989032] segment^p(sk4,sk5).
% 989051 [binary:981245,989032] segment^p(sk3,sk5).
% 989216 [binary:980392.3,989048,cut:981354,cut:980452,cut:980273] -segment^p(nil,sk2).
% 989224 [para:980455.1.2,989050.1.1] segment^p(sk2,sk5).
% 989229 [para:980456.1.2,989051.1.1] segment^p(sk1,sk5).
% 989236 [binary:980344.2,989216,cut:980452] -equal(nil,sk2).
% 1023378 [para:980463.2.1,980345.2.2,cut:989236] -segment^p(sk2,X) | -segment^p(nil,Y) | -segment^p(sk1,X) | -neq(X,Y) | -ss^list(X) | -ss^list(Y).
% 1023408 [binary:989049,1023378.4,cut:989229,cut:981357,cut:989224,cut:981643,cut:980273] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using binary resolution
% using term-depth-order strategy
% not using sos strategy
% using unit paramodulation strategy
% using unit 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 19
% clause depth limited to 5
% seconds given: 28
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 9633
% derived clauses: 1596515
% kept clauses: 445503
% kept size sum: 731018
% kept mid-nuclei: 154993
% kept new demods: 36550
% forw unit-subs: 115110
% forw double-subs: 39486
% forw overdouble-subs: 38415
% backward subs: 611
% fast unit cutoff: 155771
% full unit cutoff: 93
% dbl unit cutoff: 8579
% real runtime : 210.75
% process. runtime: 209.7
% specific non-discr-tree subsumption statistics:
% tried: 7805669
% length fails: 133407
% strength fails: 1211758
% predlist fails: 4483897
% aux str. fails: 203607
% by-lit fails: 203357
% full subs tried: 1447831
% full subs fail: 1400778
%
% ; 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/SWC054-1+eq_r.in")
%
%------------------------------------------------------------------------------