TSTP Solution File: SWC153-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SWC153-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 : art05.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.6s
% Output : Assurance 59.6s
% 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/SWC153-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 6 19)
% (binary-unit 28 #f 6 19)
% (binary-double 11 #f 6 19)
% (binary-double 17 #f)
% (binary-double 17 #t)
% (binary 87 #t 6 19)
% (binary-order 28 #f 6 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(205,40,1,410,0,2,47134,4,2210,49060,5,2804,49062,1,2807,49062,50,2809,49062,40,2809,49267,0,2823,133380,3,4229,169611,4,4925,191412,5,5624,191413,5,5626,191414,1,5626,191414,50,5630,191414,40,5630,191619,0,5630,231966,3,6181,248807,4,6456,260523,5,6731,260524,5,6732,260524,1,6732,260524,50,6734,260524,40,6734,260729,0,6734)
%
%
% START OF PROOF
% 195411 [?] ?
% 260717 [] -equal(app(app(app(app(X,cons(Y,nil)),Z),cons(U,nil)),V),sk3) | -leq(U,Y) | leq(Y,U) | -ss^item(Y) | -ss^item(U) | -ss^list(V) | -ss^list(X) | -ss^list(Z).
% 260718 [] -equal(app(app(app(app(X,cons(Y,nil)),Z),cons(U,nil)),V),sk3) | -member^p(Z,W) | -leq(U,Y) | leq(Y,W) | -ss^item(W) | -ss^item(Y) | -ss^item(U) | -ss^list(Z) | -ss^list(V) | -ss^list(X).
% 260719 [] -equal(app(app(app(app(X,cons(Y,nil)),Z),cons(U,nil)),V),sk3) | -member^p(Z,W) | -leq(U,Y) | leq(W,U) | -ss^item(W) | -ss^item(Y) | -ss^item(U) | -ss^list(Z) | -ss^list(V) | -ss^list(X).
% 260720 [] ss^item(sk5).
% 260721 [] ss^item(sk6).
% 260722 [] ss^list(sk7).
% 260723 [] ss^list(sk8).
% 260724 [] ss^list(sk9).
% 260725 [] equal(app(app(app(app(sk7,cons(sk5,nil)),sk8),cons(sk6,nil)),sk9),sk1).
% 260726 [] leq(sk6,sk5).
% 260727 [?] ?
% 260728 [?] ?
% 260729 [?] ?
% 261247 [para:260725.1.1,260717.1.1,cut:195411,cut:260726,cut:260720,cut:260721,cut:260724,cut:260722,cut:260723] leq(sk5,sk6).
% 261249 [para:260725.1.1,260718.1.1,cut:195411,cut:260726,cut:260720,cut:260721,cut:260723,cut:260724,cut:260722] -member^p(sk8,X) | leq(sk5,X) | -ss^item(X).
% 261251 [para:260725.1.1,260719.1.1,cut:195411,cut:260726,cut:260720,cut:260721,cut:260723,cut:260724,cut:260722] -member^p(sk8,X) | leq(X,sk6) | -ss^item(X).
% 261289 [input:260727,cut:261247] ss^item(sk10).
% 261325 [input:260728,cut:261247] member^p(sk8,sk10).
% 261336 [input:260729,cut:261247] -leq(sk5,sk10) | -leq(sk10,sk6).
% 261362 [binary:261325,261249] leq(sk5,sk10) | -ss^item(sk10).
% 261459 [binary:261289,261362.2] leq(sk5,sk10).
% 261542 [binary:261336,261459] -leq(sk10,sk6).
% 278996 [binary:261325,261251,cut:261542] -ss^item(sk10).
% 279038 [binary:261289,278996] 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: 3556
% derived clauses: 369111
% kept clauses: 180691
% kept size sum: 0
% kept mid-nuclei: 47348
% kept new demods: 28996
% forw unit-subs: 37290
% forw double-subs: 10220
% forw overdouble-subs: 7731
% backward subs: 60
% fast unit cutoff: 35781
% full unit cutoff: 0
% dbl unit cutoff: 785
% real runtime : 69.48
% process. runtime: 69.0
% specific non-discr-tree subsumption statistics:
% tried: 2434625
% length fails: 23112
% strength fails: 284981
% predlist fails: 1597103
% aux str. fails: 87061
% by-lit fails: 47282
% full subs tried: 326590
% full subs fail: 317813
%
% ; 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/SWC153-1+eq_r.in")
%
%------------------------------------------------------------------------------