TSTP Solution File: SWC109-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SWC109-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 : art04.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 69.5s
% Output : Assurance 69.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/SWC109-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 *********
%
% **** EMPTY CLAUSE DERIVED ****
% By given clause simplification.
%
%
% timer checkpoints: c(210,40,1,420,0,1,84910,4,2352,91032,5,2802,91033,1,2802,91033,50,2806,91033,40,2806,91243,0,2806,157516,3,4207,169078,4,4908,181820,5,5642,181820,5,5644,181820,1,5644,181820,50,5647,181820,40,5647,182030,0,5648,217607,3,6199,229130,4,6475,246068,5,6749,246069,5,6750,246069,1,6750,246069,50,6752,246069,40,6752,246279,0,6752)
%
%
% START OF PROOF
% 217253 [?] ?
% 217264 [?] ?
% 217307 [?] ?
% 246078 [] ss^list(nil).
% 246126 [] segment^p(X,nil) | -ss^list(X).
% 246127 [] segment^p(X,X) | -ss^list(X).
% 246149 [] -equal(nil,X) | segment^p(nil,X) | -ss^list(X).
% 246155 [] ss^list(app(X,Y)) | -ss^list(X) | -ss^list(Y).
% 246168 [] -equal(cons(X,Y),nil) | -ss^item(X) | -ss^list(Y).
% 246170 [] neq(X,Y) | equal(X,Y) | -ss^list(Y) | -ss^list(X).
% 246188 [] -equal(app(X,Y),nil) | equal(nil,X) | -ss^list(X) | -ss^list(Y).
% 246189 [] -equal(app(X,Y),nil) | equal(nil,Y) | -ss^list(X) | -ss^list(Y).
% 246197 [] -segment^p(X,Y) | -segment^p(Y,X) | equal(Y,X) | -ss^list(Y) | -ss^list(X).
% 246243 [] -equal(app(app(X,Y),Z),U) | segment^p(U,Y) | -ss^list(U) | -ss^list(Y) | -ss^list(Z) | -ss^list(X).
% 246256 [] ss^list(sk1).
% 246257 [] ss^list(sk2).
% 246258 [] ss^list(sk3).
% 246259 [] ss^list(sk4).
% 246260 [] equal(sk2,sk4).
% 246261 [] equal(sk1,sk3).
% 246263 [] equal(nil,sk3) | ss^item(sk5).
% 246270 [] equal(nil,sk3) | ss^list(sk6).
% 246271 [] equal(nil,sk3) | ss^list(sk7).
% 246272 [] equal(cons(sk5,nil),sk3) | equal(nil,sk3).
% 246273 [] equal(app(app(sk6,sk3),sk7),sk4) | equal(nil,sk3).
% 246277 [] -neq(sk1,nil) | -segment^p(sk2,sk1) | equal(nil,sk2).
% 246611 [para:246263.1.2,246261.1.2,cut:217253] ss^item(sk5).
% 246622 [para:246270.1.2,246261.1.2,cut:217253] ss^list(sk6).
% 246650 [para:246271.1.2,246261.1.2,cut:217253] ss^list(sk7).
% 246654 [para:246272.2.2,246261.1.2,cut:217253] equal(cons(sk5,nil),sk3).
% 246723 [binary:246257,246126.2] segment^p(sk2,nil).
% 246758 [binary:246257,246127.2] segment^p(sk2,sk2).
% 247299 [binary:246256,246149.3,cut:217307] -equal(nil,sk1).
% 247301 [binary:246258,246149.3,cut:217264] -equal(nil,sk3).
% 247823 [binary:246256,246155.3] ss^list(app(X,sk1)) | -ss^list(X).
% 250048 [binary:246256,246189.4,cut:247299] -equal(app(X,sk1),nil) | -ss^list(X).
% 250342 [para:246654.1.1,246168.1.1,cut:246611,cut:246078] -equal(sk3,nil).
% 250350 [para:246261.1.2,250342.1.1] -equal(sk1,nil).
% 250363 [binary:246170.2,250350,cut:246078,cut:246256] neq(sk1,nil).
% 268862 [binary:246622,247823.2] ss^list(app(sk6,sk1)).
% 269856 [binary:246126.2,268862] segment^p(app(sk6,sk1),nil).
% 274217 [binary:246197.2,269856,cut:268862,cut:246078,binarydemod:250048,cut:246622] -segment^p(nil,app(sk6,sk1)).
% 274585 [binary:246149.2,274217,cut:268862] -equal(nil,app(sk6,sk1)).
% 276562 [para:246261.1.2,246273.1.1.1.2,cut:247301] equal(app(app(sk6,sk1),sk7),sk4).
% 276566 [para:276562.1.1,246188.1.1,cut:274585,cut:268862,cut:246650] -equal(sk4,nil).
% 276589 [binary:246243,276562,cut:246259,cut:246256,cut:246650,cut:246622] segment^p(sk4,sk1).
% 276591 [para:246260.1.2,276566.1.1] -equal(sk2,nil).
% 276645 [para:246260.1.2,276589.1.1] segment^p(sk2,sk1).
% 276661 [binary:246197.3,276591,cut:246723,cut:246257,cut:246078] -segment^p(nil,sk2).
% 291391 [para:246277.3.2,246758.1.1,cut:250363,cut:276645,cut:276661] 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
% seconds given: 17
%
%
% old unit clauses discarded
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 4375
% derived clauses: 709472
% kept clauses: 213269
% kept size sum: 0
% kept mid-nuclei: 48569
% kept new demods: 26842
% forw unit-subs: 50206
% forw double-subs: 12515
% forw overdouble-subs: 11411
% backward subs: 497
% fast unit cutoff: 36840
% full unit cutoff: 0
% dbl unit cutoff: 870
% real runtime : 74.40
% process. runtime: 73.86
% specific non-discr-tree subsumption statistics:
% tried: 8226781
% length fails: 1812241
% strength fails: 1380821
% predlist fails: 2897471
% aux str. fails: 433762
% by-lit fails: 187312
% full subs tried: 1456180
% full subs fail: 1444325
%
% ; 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/SWC109-1+eq_r.in")
%
%------------------------------------------------------------------------------