TSTP Solution File: SWC081-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SWC081-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 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/SWC081-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(202,40,1,404,0,2,63316,4,2298,74854,5,2805,74854,1,2805,74854,50,2809,74854,40,2809,75056,0,2809,147945,3,4212,160226,4,4910,173235,5,5610,173235,5,5611,173235,1,5611,173235,50,5615,173235,40,5615,173437,0,5615,214233,3,6181,230800,4,6441,246928,5,6716,246929,5,6717,246929,1,6717,246929,50,6719,246929,40,6719,247131,0,6720,304283,3,7571,320838,4,7996,334416,5,8421,334418,5,8422,334418,1,8422,334418,50,8425,334418,40,8425,334620,0,8425,406447,3,9279,428718,4,9703,447730,5,10126,447731,5,10128,447732,1,10128,447732,50,10131,447732,40,10131,447934,0,10131,754241,3,14482,842980,4,16661,948952,5,18832,948952,5,18834,948953,1,18834,948953,50,18837,948953,40,18837,949155,0,18837,989302,3,20238,992865,4,20939,1000453,5,21638,1000454,1,21638,1000454,50,21640,1000454,40,21640,1000656,0,21640,1240179,3,24541,1350621,4,25992,1421543,5,27441,1421544,1,27442,1421544,50,27447,1421544,40,27447,1421746,0,27478,1511292,3,28879,1545600,4,29579,1611652,5,30279,1611652,1,30279,1611652,50,30285,1611652,40,30285,1611854,0,30320,1661672,3,30871,1676384,4,31146,1721048,5,31421,1721048,1,31421,1721048,50,31426,1721048,40,31426,1721250,0,31426,1761817,3,32827,1764920,4,33527,1773295,5,34227,1773296,1,34227,1773296,50,34229,1773296,40,34229,1773498,0,34229,1847825,3,35634,1863599,4,36330,1878889,5,37030,1878890,5,37031,1878890,1,37031,1878890,50,37034,1878890,40,37034,1879092,0,37034)
%
%
% START OF PROOF
% 1878891 [] equal(X,X).
% 1878899 [] ss^list(nil).
% 1878942 [] ss^list(skaf45(X,Y)).
% 1878948 [] segment^p(X,X) | -ss^list(X).
% 1878952 [] frontseg^p(X,X) | -ss^list(X).
% 1878965 [] equal(app(nil,X),X) | -ss^list(X).
% 1879006 [] -neq(X,Y) | -equal(X,Y) | -ss^list(Y) | -ss^list(X).
% 1879023 [] equal(app(X,skaf45(Y,X)),Y) | -frontseg^p(Y,X) | -ss^list(Y) | -ss^list(X).
% 1879045 [] -frontseg^p(Y,Z) | -frontseg^p(X,Y) | frontseg^p(X,Z) | -ss^list(X) | -ss^list(Y) | -ss^list(Z).
% 1879063 [] segment^p(app(app(X,Y),Z),U) | -segment^p(Y,U) | -ss^list(Y) | -ss^list(U) | -ss^list(Z) | -ss^list(X).
% 1879077 [] ss^list(sk1).
% 1879078 [] ss^list(sk2).
% 1879080 [] ss^list(sk4).
% 1879081 [] equal(sk2,sk4).
% 1879082 [] equal(sk1,sk3).
% 1879083 [] neq(sk2,nil).
% 1879084 [] -neq(X,nil) | -segment^p(sk2,X) | -segment^p(sk1,X) | -ss^list(X).
% 1879085 [] equal(nil,sk4) | ss^list(sk5).
% 1879087 [] neq(sk5,nil) | equal(nil,sk4).
% 1879088 [] frontseg^p(sk4,sk5) | equal(nil,sk4).
% 1879089 [] frontseg^p(sk3,sk5) | equal(nil,sk4).
% 1879106 [input:1879006,factor:cut:1878891] -neq(X,X) | -ss^list(X).
% 1879862 [para:1879085.1.2,1879081.1.2] equal(sk2,nil) | ss^list(sk5).
% 1879870 [para:1879862.1.1,1879083.1.1] neq(nil,nil) | ss^list(sk5).
% 1879874 [para:1879082.1.2,1879089.1.1] frontseg^p(sk1,sk5) | equal(nil,sk4).
% 1879903 [binary:1879870,1879106,cut:1878899] ss^list(sk5).
% 1880012 [binary:1879084,1879087,cut:1879903] -segment^p(sk2,sk5) | -segment^p(sk1,sk5) | equal(nil,sk4).
% 1880099 [binary:1879083,1879006,cut:1878899,cut:1879078] -equal(sk2,nil).
% 1881378 [binary:1879088,1879045,cut:1879080,cut:1879903] equal(nil,sk4) | -frontseg^p(X,sk4) | frontseg^p(X,sk5) | -ss^list(X).
% 1882208 [para:1878965.1.1,1879063.1.1.1,cut:1878899,factor:factor:binarycut:1878948] segment^p(app(X,Y),X) | -ss^list(Y) | -ss^list(X).
% 1883926 [para:1879023.1.1,1882208.1.1,cut:1878942] -frontseg^p(X,Y) | segment^p(X,Y) | -ss^list(X) | -ss^list(Y).
% 1884616 [para:1881378.1.2,1879081.1.2,cut:1880099] -frontseg^p(X,sk4) | frontseg^p(X,sk5) | -ss^list(X).
% 1884620 [binary:1878952,1884616,cut:1879080] frontseg^p(sk4,sk5).
% 1884630 [para:1879081.1.2,1884620.1.1] frontseg^p(sk2,sk5).
% 1885204 [binary:1879874,1883926,cut:1879077,cut:1879903] segment^p(sk1,sk5) | equal(nil,sk4).
% 1885263 [binary:1884630,1883926,cut:1879078,cut:1879903] segment^p(sk2,sk5).
% 1885295 [binary:1880012,1885263,binarycut:1885204] equal(nil,sk4).
% 1885300 [para:1885295.1.2,1879081.1.2,cut:1880099] 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: 26956
% derived clauses: 2861286
% kept clauses: 766732
% kept size sum: 110308
% kept mid-nuclei: 345957
% kept new demods: 58546
% forw unit-subs: 218715
% forw double-subs: 85928
% forw overdouble-subs: 68178
% backward subs: 1267
% fast unit cutoff: 264030
% full unit cutoff: 268
% dbl unit cutoff: 9823
% real runtime : 372.61
% process. runtime: 371.9
% specific non-discr-tree subsumption statistics:
% tried: 11252766
% length fails: 371055
% strength fails: 2014592
% predlist fails: 5341427
% aux str. fails: 231083
% by-lit fails: 303768
% full subs tried: 2830621
% full subs fail: 2743696
%
% ; 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/SWC081-1+eq_r.in")
%
%------------------------------------------------------------------------------