TSTP Solution File: SWC331-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SWC331-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 : art08.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 169.1s
% Output : Assurance 169.1s
% 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/SWC331-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,2,402,0,2,50013,4,2141,52215,5,2803,52216,1,2803,52216,50,2805,52216,40,2805,52420,0,2805,137731,3,4209,172885,4,4907,195198,5,5606,195200,1,5608,195200,50,5612,195200,40,5612,195404,0,5612,245614,3,6182,259180,4,6441,269054,5,6713,269055,5,6714,269056,1,6714,269056,50,6717,269056,40,6717,269260,0,6717,331450,3,7568,348272,4,7995,364730,5,8418,364731,5,8420,364732,1,8420,364732,50,8422,364732,40,8422,364936,0,8423,443528,3,9274,465999,4,9700,479346,5,10124,479346,5,10126,479347,1,10126,479347,50,10129,479347,40,10129,479551,0,10129,799041,3,14480,884886,4,16655)
%
%
% START OF PROOF
% 479356 [] ss^list(nil).
% 479399 [] ss^list(skaf45(X,Y)).
% 479405 [] segment^p(X,X) | -ss^list(X).
% 479422 [] equal(app(nil,X),X) | -ss^list(X).
% 479480 [] equal(app(X,skaf45(Y,X)),Y) | -frontseg^p(Y,X) | -ss^list(Y) | -ss^list(X).
% 479492 [] -equal(app(X,Y),Z) | frontseg^p(Z,X) | -ss^list(Z) | -ss^list(X) | -ss^list(Y).
% 479500 [] -segment^p(X,Y) | -segment^p(Z,X) | segment^p(Z,Y) | -ss^list(Z) | -ss^list(X) | -ss^list(Y).
% 479521 [] -equal(app(app(X,Y),Z),U) | segment^p(U,Y) | -ss^list(U) | -ss^list(Y) | -ss^list(Z) | -ss^list(X).
% 479537 [] equalelems^p(sk3).
% 479538 [] equal(app(sk3,sk5),sk4).
% 479539 [] ss^list(sk5).
% 479540 [] equal(sk1,sk3).
% 479541 [] equal(sk2,sk4).
% 479542 [] ss^list(sk4).
% 479543 [] ss^list(sk3).
% 479544 [] ss^list(sk2).
% 479545 [] ss^list(sk1).
% 479551 [?] ?
% 479727 [binary:479405.2,479542] segment^p(sk4,sk4).
% 479823 [binary:479500.5,479542] -segment^p(sk4,X) | -segment^p(Y,sk4) | segment^p(Y,X) | -ss^list(X) | -ss^list(Y).
% 480247 [binary:479422.2,479545] equal(app(nil,sk1),sk1).
% 480415 [para:479540.1.2,479537.1.1] equalelems^p(sk1).
% 481217 [para:479541.1.2,479727.1.1] segment^p(sk2,sk4).
% 481281 [binary:479492,479538,cut:479542,cut:479543,cut:479539] frontseg^p(sk4,sk3).
% 481878 [input:479551,cut:480415] -segment^p(sk2,sk1).
% 481901 [para:479540.1.2,481281.1.2] frontseg^p(sk4,sk1).
% 483057 [binary:479480.2,481901,cut:479542,cut:479545] equal(app(sk1,skaf45(sk4,sk1)),sk4).
% 498823 [para:480247.1.1,479521.1.1.1,cut:479545,cut:479356] -equal(app(sk1,X),Y) | segment^p(Y,sk1) | -ss^list(Y) | -ss^list(X).
% 762242 [binary:481878,479823.3,cut:481217,cut:479545,cut:479544] -segment^p(sk4,sk1).
% 899159 [binary:483057,498823,cut:762242,cut:479542,cut:479399] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using binary resolution
% 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: 87
%
%
% old unit clauses discarded
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 6982
% derived clauses: 1206609
% kept clauses: 404769
% kept size sum: 0
% kept mid-nuclei: 89509
% kept new demods: 34364
% forw unit-subs: 90890
% forw double-subs: 30828
% forw overdouble-subs: 21958
% backward subs: 61
% fast unit cutoff: 100774
% full unit cutoff: 42
% dbl unit cutoff: 6307
% real runtime : 172.29
% process. runtime: 171.21
% specific non-discr-tree subsumption statistics:
% tried: 5716714
% length fails: 44011
% strength fails: 652003
% predlist fails: 3710076
% aux str. fails: 201302
% by-lit fails: 112322
% full subs tried: 907909
% full subs fail: 882169
%
% ; 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/SWC331-1+eq_r.in")
%
%------------------------------------------------------------------------------