TSTP Solution File: SWC422-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SWC422-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 : art02.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 69.5s
% Output : Assurance 69.5s
% 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/SWC422-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(206,40,2,412,0,3,56790,4,2295,58694,5,2804,58694,1,2804,58694,50,2807,58694,40,2807,58900,0,2807,139606,3,4209,178637,4,4910,202157,5,5608,202157,5,5609,202157,1,5609,202157,50,5613,202157,40,5613,202363,0,5613,245501,3,6165,261340,4,6442,275839,5,6714,275839,5,6715,275840,1,6715,275840,50,6718,275840,40,6718,276046,0,6718)
%
%
% START OF PROOF
% 275941 [] neq(X,Y) | equal(X,Y) | -ss^list(Y) | -ss^list(X).
% 275956 [] -neq(X,Y) | -equal(X,Y) | -ss^list(Y) | -ss^list(X).
% 276027 [] ss^list(sk1).
% 276028 [] ss^list(sk2).
% 276029 [] ss^list(sk3).
% 276030 [] ss^list(sk4).
% 276031 [] equal(sk2,sk4).
% 276032 [] equal(sk1,sk3).
% 276033 [] neq(sk2,nil).
% 276041 [] -neq(sk4,nil) | -equal(app(app(X,cons(Y,nil)),Z),sk1) | -equal(app(app(Z,cons(Y,nil)),X),sk2) | -ss^item(Y) | -ss^list(Z) | -ss^list(X).
% 276042 [] -neq(sk4,nil) | ss^item(sk5).
% 276043 [] -neq(sk4,nil) | ss^list(sk6).
% 276044 [] -neq(sk4,nil) | ss^list(sk7).
% 276045 [] equal(app(app(sk6,cons(sk5,nil)),sk7),sk4) | -neq(sk4,nil).
% 276046 [] equal(app(app(sk7,cons(sk5,nil)),sk6),sk3) | -neq(sk4,nil).
% 276384 [para:276031.1.2,276041.1.1,cut:276033] -equal(app(app(X,cons(Y,nil)),Z),sk1) | -equal(app(app(Z,cons(Y,nil)),X),sk2) | -ss^item(Y) | -ss^list(Z) | -ss^list(X).
% 276414 [para:276031.1.2,276042.1.1,cut:276033] ss^item(sk5).
% 276416 [para:276031.1.2,276043.1.1,cut:276033] ss^list(sk6).
% 276418 [para:276031.1.2,276044.1.1,cut:276033] ss^list(sk7).
% 276420 [para:276031.1.2,276045.2.1,cut:276033] equal(app(app(sk6,cons(sk5,nil)),sk7),sk4).
% 276422 [para:276031.1.2,276046.2.1,cut:276033] equal(app(app(sk7,cons(sk5,nil)),sk6),sk3).
% 279602 [binary:276420,275956.2,demod:276420,cut:276030] -neq(sk4,sk4).
% 279613 [binary:276422,275956.2,demod:276422,cut:276029] -neq(sk3,sk3).
% 279633 [para:276031.1.2,279602.1.2] -neq(sk4,sk2).
% 279634 [para:276032.1.2,279613.1.2] -neq(sk3,sk1).
% 279698 [binary:275941,279633,cut:276028,cut:276030] equal(sk4,sk2).
% 279699 [binary:275941,279634,cut:276027,cut:276029] equal(sk3,sk1).
% 299290 [para:276420.1.1,276384.2.1,demod:276422,cut:279698,cut:279699,cut:276414,cut:276416,cut:276418] 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: 3652
% derived clauses: 432440
% kept clauses: 197654
% kept size sum: 0
% kept mid-nuclei: 52821
% kept new demods: 34222
% forw unit-subs: 44276
% forw double-subs: 11436
% forw overdouble-subs: 10043
% backward subs: 91
% fast unit cutoff: 45933
% full unit cutoff: 0
% dbl unit cutoff: 909
% real runtime : 69.90
% process. runtime: 69.33
% specific non-discr-tree subsumption statistics:
% tried: 2649156
% length fails: 32043
% strength fails: 263044
% predlist fails: 1855080
% aux str. fails: 82816
% by-lit fails: 61128
% full subs tried: 293647
% full subs fail: 282621
%
% ; 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/SWC422-1+eq_r.in")
%
%------------------------------------------------------------------------------