TSTP Solution File: SWC085-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SWC085-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 : art10.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/SWC085-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,54004,4,2193,56026,5,2802,56027,1,2804,56027,50,2806,56027,40,2806,56225,0,2806,139109,3,4236,178959,4,4908)
%
%
% START OF PROOF
% 398 [?] ?
% 399 [?] ?
% 580 [?] ?
% 56036 [] ss^list(nil).
% 56079 [] ss^list(skaf45(X,Y)).
% 56102 [] equal(app(nil,X),X) | -ss^list(X).
% 56160 [] equal(app(X,skaf45(Y,X)),Y) | -frontseg^p(Y,X) | -ss^list(Y) | -ss^list(X).
% 56201 [] -equal(app(app(X,Y),Z),U) | segment^p(U,Y) | -ss^list(U) | -ss^list(Y) | -ss^list(Z) | -ss^list(X).
% 56214 [] ss^list(sk1).
% 56215 [] ss^list(sk2).
% 56218 [] equal(sk2,sk4).
% 56219 [] equal(sk1,sk3).
% 56220 [] neq(sk2,nil).
% 56221 [] -neq(X,nil) | -segment^p(sk2,X) | -segment^p(sk1,X) | -ss^list(X).
% 56222 [] neq(sk3,nil) | equal(nil,sk4).
% 56225 [] frontseg^p(sk4,sk3) | equal(nil,sk3).
% 56997 [binary:56036,56221.4,cut:398,cut:580] -neq(nil,nil).
% 57000 [para:56222.2.2,56218.1.2] neq(sk3,nil) | equal(sk2,nil).
% 57036 [para:57000.2.1,56220.1.1,cut:56997] neq(sk3,nil).
% 57041 [para:56219.1.2,57036.1.1] neq(sk1,nil).
% 57043 [para:56225.2.2,57036.1.1,cut:56997] frontseg^p(sk4,sk3).
% 57045 [binary:56221,57041,cut:399,cut:56214] -segment^p(sk2,sk1).
% 57046 [para:56218.1.2,57043.1.1] frontseg^p(sk2,sk3).
% 57048 [para:56219.1.2,57046.1.2] frontseg^p(sk2,sk1).
% 57528 [binary:56214,56102.2] equal(app(nil,sk1),sk1).
% 62365 [binary:57048,56160.2,cut:56215,cut:56214] equal(app(sk1,skaf45(sk2,sk1)),sk2).
% 69922 [para:57528.1.1,56201.1.1.1,cut:56214,cut:56036] -equal(app(sk1,X),Y) | segment^p(Y,sk1) | -ss^list(Y) | -ss^list(X).
% 191047 [binary:62365,69922,cut:57045,cut:56215,cut:56079] 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 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: 28
%
%
% old unit clauses discarded
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 1577
% derived clauses: 264017
% kept clauses: 117718
% kept size sum: 0
% kept mid-nuclei: 27092
% kept new demods: 33070
% forw unit-subs: 19745
% forw double-subs: 5670
% forw overdouble-subs: 3239
% backward subs: 35
% fast unit cutoff: 18433
% full unit cutoff: 0
% dbl unit cutoff: 284
% real runtime : 51.74
% process. runtime: 51.71
% specific non-discr-tree subsumption statistics:
% tried: 1231044
% length fails: 13594
% strength fails: 118514
% predlist fails: 856352
% aux str. fails: 38267
% by-lit fails: 44054
% full subs tried: 138425
% full subs fail: 134945
%
% ; 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/SWC085-1+eq_r.in")
%
%------------------------------------------------------------------------------