TSTP Solution File: SWC330-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SWC330-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 : art09.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 79.5s
% Output : Assurance 79.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/SWC330-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(207,40,1,414,0,2,80538,4,2300,103575,5,2804,103576,1,2805,103576,50,2810,103576,40,2810,103783,0,2810,195348,3,4235,219954,4,4916,236823,5,5611,236825,1,5612,236825,50,5615,236825,40,5615,237032,0,5615,273925,3,6166,289836,4,6443,306335,5,6716,306336,5,6717,306337,1,6717,306337,50,6719,306337,40,6719,306544,0,6719,356887,3,7572,374215,4,7995)
%
%
% START OF PROOF
% 306339 [] equalelems^p(nil).
% 306346 [] ss^list(nil).
% 306349 [] -singleton^p(nil).
% 306394 [] segment^p(X,nil) | -ss^list(X).
% 306395 [] segment^p(X,X) | -ss^list(X).
% 306402 [] equalelems^p(cons(X,nil)) | -ss^item(X).
% 306417 [] -equal(nil,X) | segment^p(nil,X) | -ss^list(X).
% 306436 [] -equal(cons(X,Y),nil) | -ss^item(X) | -ss^list(Y).
% 306454 [] -equal(cons(X,nil),Y) | -ss^item(X) | -ss^list(Y) | singleton^p(Y).
% 306465 [] -segment^p(X,Y) | -segment^p(Y,X) | equal(Y,X) | -ss^list(Y) | -ss^list(X).
% 306511 [] -equal(app(app(X,Y),Z),U) | segment^p(U,Y) | -ss^list(U) | -ss^list(Y) | -ss^list(Z) | -ss^list(X).
% 306524 [] ss^list(sk1).
% 306525 [] ss^list(sk2).
% 306526 [] ss^list(sk3).
% 306527 [] ss^list(sk4).
% 306528 [] equal(sk2,sk4).
% 306529 [] equal(sk1,sk3).
% 306531 [] equal(nil,sk3) | ss^item(sk5).
% 306532 [] equal(nil,sk4) | ss^list(sk6).
% 306533 [] equal(nil,sk4) | ss^list(sk7).
% 306534 [] equal(cons(sk5,nil),sk3) | equal(nil,sk4).
% 306538 [] equal(nil,sk3) | ss^list(sk6).
% 306539 [] equal(nil,sk3) | ss^list(sk7).
% 306540 [] equal(cons(sk5,nil),sk3) | equal(nil,sk3).
% 306541 [] equal(app(app(sk6,sk3),sk7),sk4) | equal(nil,sk3).
% 306544 [] -segment^p(sk2,sk1) | -equalelems^p(sk1).
% 306876 [para:306531.1.2,306529.1.2] equal(sk1,nil) | ss^item(sk5).
% 306879 [para:306532.1.2,306528.1.2] equal(sk2,nil) | ss^list(sk6).
% 306882 [para:306533.1.2,306528.1.2] equal(sk2,nil) | ss^list(sk7).
% 306885 [para:306534.2.2,306528.1.2] equal(cons(sk5,nil),sk3) | equal(sk2,nil).
% 306888 [para:306538.1.2,306529.1.2] equal(sk1,nil) | ss^list(sk6).
% 306919 [para:306539.1.2,306529.1.2] equal(sk1,nil) | ss^list(sk7).
% 306931 [para:306529.1.2,306541.1.1.1.2] equal(app(app(sk6,sk1),sk7),sk4) | equal(nil,sk3).
% 307016 [binary:306525,306394.2] segment^p(sk2,nil).
% 307017 [binary:306526,306394.2] segment^p(sk3,nil).
% 307055 [binary:306527,306395.2] segment^p(sk4,sk4).
% 307134 [para:306528.1.2,307055.1.1] segment^p(sk2,sk4).
% 307135 [para:306528.1.2,307055.1.2] segment^p(sk4,sk2).
% 307180 [?] ?
% 307181 [?] ?
% 307446 [para:306876.1.1,306544.1.2,cut:307016] -equalelems^p(sk1) | ss^item(sk5).
% 307511 [para:306876.1.1,307446.1.1,cut:306339] ss^item(sk5).
% 307517 [binary:306402.2,307511] equalelems^p(cons(sk5,nil)).
% 307975 [para:306540.1.1,307517.1.1] equal(nil,sk3) | equalelems^p(sk3).
% 311898 [para:306879.1.1,306544.1.1,binarycut:307180] -equalelems^p(sk1) | ss^list(sk6).
% 312578 [binary:307134,306465,cut:307135,cut:306527,cut:306525] equal(sk4,sk2).
% 315317 [para:306882.1.1,306544.1.1,binarycut:307181] -equalelems^p(sk1) | ss^list(sk7).
% 316349 [para:306888.1.1,311898.1.1,cut:306339] ss^list(sk6).
% 319317 [para:306919.1.1,315317.1.1,cut:306339] ss^list(sk7).
% 324284 [para:306885.1.1,306402.1.1,cut:307511] equal(sk2,nil) | equalelems^p(sk3).
% 324304 [binary:306454,306885,cut:307511,cut:306526] equal(sk2,nil) | singleton^p(sk3).
% 324917 [para:307975.1.2,306529.1.2] equal(sk1,nil) | equalelems^p(sk3).
% 324921 [?] ?
% 325229 [?] ?
% 325726 [para:324284.1.1,306544.1.1,binarycut:324921] -equalelems^p(sk1) | equalelems^p(sk3).
% 325890 [para:324304.1.1,306544.1.1,binarycut:325229] -equalelems^p(sk1) | singleton^p(sk3).
% 326685 [para:306931.1.1,306511.1.1,cut:306524,cut:319317,cut:316349] equal(nil,sk3) | -equal(sk4,X) | segment^p(X,sk1) | -ss^list(X).
% 327173 [para:324917.1.1,325726.1.1,cut:306339] equalelems^p(sk3).
% 327174 [para:306529.1.2,327173.1.1] equalelems^p(sk1).
% 327176 [binary:306544.2,327174] -segment^p(sk2,sk1).
% 327186 [binary:325890,327174] singleton^p(sk3).
% 327218 [para:306540.2.2,327186.1.1,cut:306349] equal(cons(sk5,nil),sk3).
% 327728 [para:327218.1.1,306436.1.1,cut:307511,cut:306346] -equal(sk3,nil).
% 327782 [binary:306465.3,327728,cut:307017,cut:306526,cut:306346] -segment^p(nil,sk3).
% 327840 [binary:306417.2,327782,cut:306526] -equal(nil,sk3).
% 386630 [binary:312578,326685.2,cut:327840,cut:327176,cut:306525] 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
% seconds given: 17
%
%
% old unit clauses discarded
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 4094
% derived clauses: 593961
% kept clauses: 260237
% kept size sum: 0
% kept mid-nuclei: 64208
% kept new demods: 27130
% forw unit-subs: 68352
% forw double-subs: 33538
% forw overdouble-subs: 11619
% backward subs: 1040
% fast unit cutoff: 47282
% full unit cutoff: 0
% dbl unit cutoff: 960
% real runtime : 84.29
% process. runtime: 83.74
% specific non-discr-tree subsumption statistics:
% tried: 2709884
% length fails: 38608
% strength fails: 280610
% predlist fails: 1792757
% aux str. fails: 94809
% by-lit fails: 77092
% full subs tried: 360453
% full subs fail: 347934
%
% ; 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/SWC330-1+eq_r.in")
%
%------------------------------------------------------------------------------