TSTP Solution File: SWC270-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SWC270-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 : art03.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 59.8s
% Output : Assurance 59.8s
% 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/SWC270-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(195,40,2,390,0,2,54358,4,2202,56419,5,2804,56420,1,2804,56420,50,2807,56420,40,2807,56615,0,2807,128556,3,4209,155615,4,4908,176556,5,5608,176557,5,5610,176558,1,5610,176558,50,5615,176558,40,5615,176753,0,5615,220688,3,6168,235316,4,6443)
%
%
% START OF PROOF
% 176586 [] ss^list(skaf68(X)).
% 176587 [] ss^list(skaf67(X)).
% 176588 [] ss^list(skaf66(X)).
% 176589 [] ss^item(skaf65(X)).
% 176590 [] ss^item(skaf64(X)).
% 176650 [] -leq(skaf64(X),skaf65(X)) | -ss^list(X) | totalordered^p(X).
% 176662 [] -lt(X,Y) | leq(X,Y) | -ss^item(X) | -ss^item(Y).
% 176723 [] equal(app(app(skaf66(X),cons(skaf64(X),skaf67(X))),cons(skaf65(X),skaf68(X))),X) | -ss^list(X) | totalordered^p(X).
% 176740 [] -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).
% 176745 [] ss^list(sk1).
% 176750 [] equal(sk1,sk3).
% 176752 [] strictordered^p(sk3).
% 176753 [] -totalordered^p(sk1).
% 177520 [para:176750.1.2,176752.1.1] strictordered^p(sk1).
% 179014 [binary:176745,176650.2,cut:176753] -leq(skaf64(sk1),skaf65(sk1)).
% 182911 [binary:176662.2,179014,cut:176590,cut:176589] -lt(skaf64(sk1),skaf65(sk1)).
% 187938 [binary:176745,176723.2,cut:176753] equal(app(app(skaf66(sk1),cons(skaf64(sk1),skaf67(sk1))),cons(skaf65(sk1),skaf68(sk1))),sk1).
% 239143 [binary:187938,176740,cut:182911,cut:176589,cut:176590,cut:176745,cut:176587,cut:176588,cut:176586,cut:177520] 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
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 2506
% derived clauses: 305327
% kept clauses: 173877
% kept size sum: 947300
% kept mid-nuclei: 39622
% kept new demods: 34223
% forw unit-subs: 25607
% forw double-subs: 8188
% forw overdouble-subs: 5596
% backward subs: 46
% fast unit cutoff: 30554
% full unit cutoff: 0
% dbl unit cutoff: 651
% real runtime : 65.3
% process. runtime: 64.73
% specific non-discr-tree subsumption statistics:
% tried: 1700386
% length fails: 20935
% strength fails: 163698
% predlist fails: 1174109
% aux str. fails: 48446
% by-lit fails: 35854
% full subs tried: 217971
% full subs fail: 211515
%
% ; 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/SWC270-1+eq_r.in")
%
%------------------------------------------------------------------------------