TSTP Solution File: SWC241-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SWC241-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 : art07.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 80.0s
% Output : Assurance 80.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/SWC241-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(203,40,0,406,0,1,61437,4,2212,83880,5,2803,83881,1,2805,83881,50,2809,83881,40,2809,84084,0,2809,182787,3,4211,225302,4,4912,243318,5,5610,243318,5,5611,243318,1,5611,243318,50,5614,243318,40,5614,243521,0,5614,285595,3,6182,302356,4,6442,317461,5,6732,317461,5,6734,317462,1,6734,317462,50,6736,317462,40,6736,317665,0,6736,383165,3,7595,394281,4,8012)
%
%
% START OF PROOF
% 246964 [?] ?
% 256808 [?] ?
% 317566 [] -lt(X,Y) | leq(X,Y) | -ss^item(X) | -ss^item(Y).
% 317654 [] equal(sk1,sk3).
% 317656 [] -equal(app(app(X,cons(Y,nil)),Z),sk1) | ss^item(sk5(Z,X,Y)) | -ss^item(Y) | -ss^list(Z) | -ss^list(X).
% 317659 [] -equal(app(app(X,cons(Y,nil)),Z),sk1) | lt(Y,sk5(Z,X,Y)) | -ss^item(Y) | -ss^list(Z) | -ss^list(X).
% 317660 [] -equal(app(app(X,cons(Y,nil)),Z),sk1) | -leq(Y,sk5(Z,X,Y)) | -ss^item(Y) | -ss^list(Z) | -ss^list(X).
% 317661 [] equal(nil,sk3) | ss^item(sk6).
% 317662 [] equal(nil,sk3) | ss^list(sk7).
% 317663 [] equal(nil,sk3) | ss^list(sk8).
% 317664 [] equal(app(app(sk7,cons(sk6,nil)),sk8),sk3) | equal(nil,sk3).
% 318013 [para:317661.1.2,317654.1.2,cut:256808] ss^item(sk6).
% 318083 [para:317662.1.2,317654.1.2,cut:256808] ss^list(sk7).
% 318200 [para:317663.1.2,317654.1.2,cut:256808] ss^list(sk8).
% 318222 [para:317664.2.2,317654.1.2,cut:256808] equal(app(app(sk7,cons(sk6,nil)),sk8),sk3).
% 318223 [para:317664.1.1,317656.1.1,cut:246964,cut:318013,cut:318200,cut:318083] ss^item(sk5(sk8,sk7,sk6)) | equal(nil,sk3).
% 318309 [para:318223.2.2,317654.1.2,cut:256808] ss^item(sk5(sk8,sk7,sk6)).
% 318467 [para:318222.1.1,317659.1.1,cut:246964,cut:318013,cut:318200,cut:318083] lt(sk6,sk5(sk8,sk7,sk6)).
% 318468 [para:318222.1.1,317660.1.1,cut:246964,cut:318013,cut:318200,cut:318083] -leq(sk6,sk5(sk8,sk7,sk6)).
% 394909 [binary:318467,317566,cut:318468,cut:318013,cut:318309] 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: 4667
% derived clauses: 784392
% kept clauses: 232072
% kept size sum: 0
% kept mid-nuclei: 49540
% kept new demods: 32593
% forw unit-subs: 39920
% forw double-subs: 17783
% forw overdouble-subs: 8996
% backward subs: 88
% fast unit cutoff: 35363
% full unit cutoff: 0
% dbl unit cutoff: 1055
% real runtime : 80.31
% process. runtime: 80.28
% specific non-discr-tree subsumption statistics:
% tried: 4015557
% length fails: 32620
% strength fails: 372600
% predlist fails: 3085350
% aux str. fails: 71960
% by-lit fails: 25262
% full subs tried: 366597
% full subs fail: 356626
%
% ; 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/SWC241-1+eq_r.in")
%
%------------------------------------------------------------------------------