TSTP Solution File: SWC069-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SWC069-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 50.0s
% Output : Assurance 50.0s
% 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/SWC069-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(199,40,1,398,0,1,55029,4,2201,56958,5,2802,56959,1,2802,56959,50,2805,56959,40,2805,57158,0,2805,150772,3,4214,174925,4,4906,192264,5,5606,192265,5,5612,192266,1,5612,192266,50,5617,192266,40,5617,192465,0,5618)
%
%
% START OF PROOF
% 192267 [] equal(X,X).
% 192275 [] ss^list(nil).
% 192340 [] equal(app(X,nil),X) | -ss^list(X).
% 192367 [] neq(X,Y) | equal(X,Y) | -ss^list(Y) | -ss^list(X).
% 192382 [] -neq(X,Y) | -equal(X,Y) | -ss^list(Y) | -ss^list(X).
% 192385 [] -equal(app(X,Y),nil) | equal(nil,X) | -ss^list(X) | -ss^list(Y).
% 192453 [] ss^list(sk1).
% 192454 [] ss^list(sk2).
% 192455 [] ss^list(sk3).
% 192457 [] equal(sk2,sk4).
% 192458 [] equal(sk1,sk3).
% 192459 [] -neq(X,nil) | -segment^p(sk2,X) | -segment^p(sk1,X) | -ss^list(X).
% 192460 [] -equal(nil,sk4) | equal(nil,sk3).
% 192461 [] -equal(nil,sk2) | -equal(nil,sk1).
% 192462 [] -neq(sk4,nil) | ss^list(sk5).
% 192463 [] -neq(sk4,nil) | neq(sk5,nil).
% 192464 [] -neq(sk4,nil) | segment^p(sk4,sk5).
% 192465 [] -neq(sk4,nil) | segment^p(sk3,sk5).
% 192479 [input:192382,factor:cut:192267] -neq(X,X) | -ss^list(X).
% 193239 [para:192457.1.2,192460.1.2] -equal(nil,sk2) | equal(nil,sk3).
% 193243 [para:192457.1.2,192462.1.1] -neq(sk2,nil) | ss^list(sk5).
% 193251 [para:192457.1.2,192463.1.1] -neq(sk2,nil) | neq(sk5,nil).
% 193259 [para:192457.1.2,192464.1.1] -neq(sk2,nil) | segment^p(sk4,sk5).
% 193781 [binary:192454,192340.2] equal(app(sk2,nil),sk2).
% 194916 [binary:192455,192479.2] -neq(sk3,sk3).
% 194952 [para:192458.1.2,194916.1.2] -neq(sk3,sk1).
% 194994 [para:193239.2.2,194952.1.1] -neq(nil,sk1) | -equal(nil,sk2).
% 195365 [binary:192461.2,192367.2,cut:192453,cut:192275,binarycut:194994] -equal(nil,sk2).
% 199294 [para:193781.1.1,192385.1.1,cut:195365,cut:192454,cut:192275] -equal(sk2,nil).
% 199550 [binary:192367.2,199294,cut:192275,cut:192454] neq(sk2,nil).
% 199559 [binary:193243,199550] ss^list(sk5).
% 199560 [binary:193251,199550] neq(sk5,nil).
% 199561 [binary:193259,199550] segment^p(sk4,sk5).
% 199886 [para:192457.1.2,199561.1.1] segment^p(sk2,sk5).
% 200383 [binary:192459.2,199886,cut:199560,cut:199559] -segment^p(sk1,sk5).
% 205415 [para:192457.1.2,192465.1.1,cut:199550] segment^p(sk3,sk5).
% 205416 [para:192458.1.2,205415.1.1,cut:200383] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using binary resolution
% not using sos 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: 2201
% derived clauses: 286405
% kept clauses: 131175
% kept size sum: 154788
% kept mid-nuclei: 32144
% kept new demods: 33499
% forw unit-subs: 20993
% forw double-subs: 6800
% forw overdouble-subs: 4490
% backward subs: 39
% fast unit cutoff: 19914
% full unit cutoff: 1
% dbl unit cutoff: 381
% real runtime : 57.65
% process. runtime: 57.24
% specific non-discr-tree subsumption statistics:
% tried: 1047931
% length fails: 4957
% strength fails: 91864
% predlist fails: 723675
% aux str. fails: 27383
% by-lit fails: 29182
% full subs tried: 140288
% full subs fail: 135165
%
% ; 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/SWC069-1+eq_r.in")
%
%------------------------------------------------------------------------------