TSTP Solution File: SWC271-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SWC271-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 : art01.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 56.1s
% Output : Assurance 56.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/SWC271-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(196,40,0,392,0,1,53474,4,2248,55547,5,2802,55548,1,2804,55548,50,2806,55548,40,2806,55744,0,2807,139610,3,4212,179203,4,4912,205688,5,5608,205689,5,5610,205689,1,5610,205689,50,5615,205689,40,5615,205885,0,5615,256084,3,6166,272314,4,6443)
%
%
% START OF PROOF
% 205717 [] ss^list(skaf68(X)).
% 205718 [] ss^list(skaf67(X)).
% 205719 [] ss^list(skaf66(X)).
% 205720 [] ss^item(skaf65(X)).
% 205721 [] ss^item(skaf64(X)).
% 205781 [] -leq(skaf64(X),skaf65(X)) | -ss^list(X) | totalordered^p(X).
% 205793 [] -lt(X,Y) | leq(X,Y) | -ss^item(X) | -ss^item(Y).
% 205854 [] equal(app(app(skaf66(X),cons(skaf64(X),skaf67(X))),cons(skaf65(X),skaf68(X))),X) | -ss^list(X) | totalordered^p(X).
% 205871 [] -equal(app(app(X,cons(Y,Z)),cons(U,V)),W) | lt(Y,U) | -ss^item(U) | -ss^item(Y) | -ss^list(W) | -ss^list(Z) | -ss^list(X) | -ss^list(V) | -strictordered^p(W).
% 205876 [] ss^list(sk1).
% 205881 [] equal(sk1,sk3).
% 205883 [] strictordered^p(sk3).
% 205885 [] -totalordered^p(sk1).
% 206652 [para:205881.1.2,205883.1.1] strictordered^p(sk1).
% 208153 [binary:205876,205781.2,cut:205885] -leq(skaf64(sk1),skaf65(sk1)).
% 212086 [binary:205793.2,208153,cut:205721,cut:205720] -lt(skaf64(sk1),skaf65(sk1)).
% 217051 [binary:205876,205854.2,cut:205885] equal(app(app(skaf66(sk1),cons(skaf64(sk1),skaf67(sk1))),cons(skaf65(sk1),skaf68(sk1))),sk1).
% 276919 [binary:217051,205871,cut:212086,cut:205720,cut:205721,cut:205876,cut:205718,cut:205719,cut:205717,cut:206652] 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
% clause length limited to 19
% clause depth limited to 5
% seconds given: 11
%
%
% old unit clauses discarded
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 2638
% derived clauses: 359832
% kept clauses: 179745
% kept size sum: 0
% kept mid-nuclei: 45794
% kept new demods: 34153
% forw unit-subs: 27874
% forw double-subs: 8848
% forw overdouble-subs: 6451
% backward subs: 51
% fast unit cutoff: 34798
% full unit cutoff: 0
% dbl unit cutoff: 680
% real runtime : 69.22
% process. runtime: 64.98
% specific non-discr-tree subsumption statistics:
% tried: 2023673
% length fails: 17234
% strength fails: 188230
% predlist fails: 1394661
% aux str. fails: 61512
% by-lit fails: 57809
% full subs tried: 259561
% full subs fail: 252254
%
% ; 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/SWC271-1+eq_r.in")
%
%------------------------------------------------------------------------------