TSTP Solution File: SWC242-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SWC242-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 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/SWC242-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,61438,4,2223,83873,5,2803,83874,1,2805,83874,50,2809,83874,40,2809,84077,0,2809,182896,3,4210,226357,4,4912,244641,5,5640,244641,5,5642,244641,1,5642,244641,50,5645,244641,40,5645,244844,0,5645,285819,3,6198,303115,4,6471,317413,5,6746,317414,5,6747,317415,1,6747,317415,50,6750,317415,40,6750,317618,0,6750,383121,3,7601,394249,4,8026)
%
%
% START OF PROOF
% 248288 [?] ?
% 258132 [?] ?
% 317519 [] -lt(X,Y) | leq(X,Y) | -ss^item(X) | -ss^item(Y).
% 317607 [] equal(sk1,sk3).
% 317609 [] -equal(app(app(X,cons(Y,nil)),Z),sk1) | ss^item(sk5(Z,X,Y)) | -ss^item(Y) | -ss^list(Z) | -ss^list(X).
% 317612 [] -equal(app(app(X,cons(Y,nil)),Z),sk1) | lt(Y,sk5(Z,X,Y)) | -ss^item(Y) | -ss^list(Z) | -ss^list(X).
% 317613 [] -equal(app(app(X,cons(Y,nil)),Z),sk1) | -leq(Y,sk5(Z,X,Y)) | -ss^item(Y) | -ss^list(Z) | -ss^list(X).
% 317614 [] equal(nil,sk3) | ss^item(sk6).
% 317615 [] equal(nil,sk3) | ss^list(sk7).
% 317616 [] equal(nil,sk3) | ss^list(sk8).
% 317617 [] equal(app(app(sk7,cons(sk6,nil)),sk8),sk3) | equal(nil,sk3).
% 317966 [para:317614.1.2,317607.1.2,cut:258132] ss^item(sk6).
% 318036 [para:317615.1.2,317607.1.2,cut:258132] ss^list(sk7).
% 318153 [para:317616.1.2,317607.1.2,cut:258132] ss^list(sk8).
% 318175 [para:317617.2.2,317607.1.2,cut:258132] equal(app(app(sk7,cons(sk6,nil)),sk8),sk3).
% 318176 [para:317617.1.1,317609.1.1,cut:248288,cut:317966,cut:318153,cut:318036] ss^item(sk5(sk8,sk7,sk6)) | equal(nil,sk3).
% 318263 [para:318176.2.2,317607.1.2,cut:258132] ss^item(sk5(sk8,sk7,sk6)).
% 318421 [para:318175.1.1,317612.1.1,cut:248288,cut:317966,cut:318153,cut:318036] lt(sk6,sk5(sk8,sk7,sk6)).
% 318422 [para:318175.1.1,317613.1.1,cut:248288,cut:317966,cut:318153,cut:318036] -leq(sk6,sk5(sk8,sk7,sk6)).
% 394881 [binary:318421,317519,cut:318422,cut:317966,cut:318263] 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: 4674
% derived clauses: 779142
% kept clauses: 232022
% kept size sum: 0
% kept mid-nuclei: 48999
% kept new demods: 32597
% forw unit-subs: 39969
% forw double-subs: 17799
% forw overdouble-subs: 8984
% backward subs: 90
% fast unit cutoff: 35423
% full unit cutoff: 0
% dbl unit cutoff: 1063
% real runtime : 80.44
% process. runtime: 80.42
% specific non-discr-tree subsumption statistics:
% tried: 4020780
% length fails: 32620
% strength fails: 371248
% predlist fails: 3092099
% aux str. fails: 71655
% by-lit fails: 24691
% full subs tried: 367246
% full subs fail: 357286
%
% ; 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/SWC242-1+eq_r.in")
%
%------------------------------------------------------------------------------