TSTP Solution File: SWC070-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SWC070-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 : art07.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 59.5s
% Output : Assurance 59.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/SWC070-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(198,40,1,396,0,1,54002,4,2221,55991,5,2803,55992,1,2805,55992,50,2807,55992,40,2807,56190,0,2808,150244,3,4211,176044,4,4912,194818,5,5609,194819,5,5611,194820,1,5611,194820,50,5615,194820,40,5615,195018,0,5615,241088,3,6166,245476,4,6441)
%
%
% START OF PROOF
% 194821 [] equal(X,X).
% 194829 [] ss^list(nil).
% 194872 [] ss^list(skaf45(X,Y)).
% 194877 [] segment^p(X,nil) | -ss^list(X).
% 194878 [] segment^p(X,X) | -ss^list(X).
% 194895 [] equal(app(nil,X),X) | -ss^list(X).
% 194953 [] equal(app(X,skaf45(Y,X)),Y) | -frontseg^p(Y,X) | -ss^list(Y) | -ss^list(X).
% 194994 [] -equal(app(app(X,Y),Z),U) | segment^p(U,Y) | -ss^list(U) | -ss^list(Y) | -ss^list(Z) | -ss^list(X).
% 195007 [] ss^list(sk1).
% 195008 [] ss^list(sk2).
% 195011 [] equal(sk2,sk4).
% 195012 [] equal(sk1,sk3).
% 195013 [] -neq(X,nil) | -segment^p(sk2,X) | -segment^p(sk1,X) | -ss^list(X).
% 195014 [] -equal(nil,sk2) | -equal(nil,sk1).
% 195015 [] neq(sk3,nil) | equal(nil,sk4).
% 195017 [] neq(sk3,nil) | equal(nil,sk3).
% 195018 [] frontseg^p(sk4,sk3) | equal(nil,sk3).
% 195793 [para:195015.2.2,195011.1.2] neq(sk3,nil) | equal(sk2,nil).
% 195828 [para:195793.2.1,195014.1.2,cut:194821] -equal(nil,sk1) | neq(sk3,nil).
% 195868 [binary:195007,194877.2] segment^p(sk1,nil).
% 195872 [binary:195013.2,194877,cut:195008,cut:195868,cut:194829] -neq(nil,nil).
% 195902 [binary:195007,194878.2] segment^p(sk1,sk1).
% 209028 [para:194895.1.1,194994.1.1.1,cut:194829] -equal(app(X,Y),Z) | segment^p(Z,X) | -ss^list(Y) | -ss^list(X) | -ss^list(Z).
% 234101 [para:195012.1.2,195017.2.2,binarycut:195828] neq(sk3,nil).
% 234102 [para:195012.1.2,234101.1.1] neq(sk1,nil).
% 234105 [para:195018.2.2,234101.1.1,cut:195872] frontseg^p(sk4,sk3).
% 234123 [binary:195013,234102,cut:195902,cut:195007] -segment^p(sk2,sk1).
% 234355 [para:195011.1.2,234105.1.1] frontseg^p(sk2,sk3).
% 234714 [para:195012.1.2,234355.1.2] frontseg^p(sk2,sk1).
% 235305 [binary:194953.2,234714,cut:195008,cut:195007] equal(app(sk1,skaf45(sk2,sk1)),sk2).
% 257475 [binary:235305,209028,cut:234123,cut:194872,cut:195007,cut:195008] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using binary resolution
% not using sos strategy
% using unit paramodulation strategy
% using unit strategy
% using double 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: 11
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 2717
% derived clauses: 392044
% kept clauses: 165892
% kept size sum: 788375
% kept mid-nuclei: 45768
% kept new demods: 34038
% forw unit-subs: 39770
% forw double-subs: 10511
% forw overdouble-subs: 6536
% backward subs: 45
% fast unit cutoff: 35030
% full unit cutoff: 0
% dbl unit cutoff: 629
% real runtime : 67.26
% process. runtime: 66.76
% specific non-discr-tree subsumption statistics:
% tried: 1582377
% length fails: 21167
% strength fails: 149937
% predlist fails: 1085262
% aux str. fails: 42236
% by-lit fails: 35223
% full subs tried: 208531
% full subs fail: 201158
%
% ; 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/SWC070-1+eq_r.in")
%
%------------------------------------------------------------------------------