TSTP Solution File: SWC176-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SWC176-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 : art06.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 88.8s
% Output : Assurance 88.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/SWC176-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(205,40,1,421,0,1,49323,4,2143,51306,5,2802,51307,1,2804,51307,50,2806,51307,40,2806,51523,0,2806,141201,3,4216,183648,4,4911,201059,5,5607,201060,5,5609,201061,1,5609,201061,50,5613,201061,40,5613,201277,0,5613,243853,3,6164,260299,4,6439,271123,5,6714,271124,5,6715,271125,1,6715,271125,50,6717,271125,40,6717,271341,0,6717,328634,3,7569,344821,4,7993,360527,5,8418,360528,5,8419,360529,1,8419,360529,50,8421,360529,40,8421,360745,0,8421,433658,3,9273,455993,4,9697)
%
%
% START OF PROOF
% 360538 [] ss^list(nil).
% 360615 [] ss^list(app(X,Y)) | -ss^list(X) | -ss^list(Y).
% 360616 [] ss^list(cons(X,Y)) | -ss^item(X) | -ss^list(Y).
% 360632 [] neq(X,Y) | equal(X,Y) | -ss^item(Y) | -ss^item(X).
% 360641 [] -lt(X,Y) | -equal(X,Y) | -ss^item(Y) | -ss^item(X).
% 360650 [] equal(app(cons(X,nil),Y),cons(X,Y)) | -ss^item(X) | -ss^list(Y).
% 360679 [] equal(app(app(X,Y),Z),app(X,app(Y,Z))) | -ss^list(X) | -ss^list(Z) | -ss^list(Y).
% 360711 [] -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).
% 360717 [] -neq(sk7,sk8).
% 360718 [] equal(app(app(app(sk9,cons(sk7,nil)),cons(sk8,nil)),sk10),sk1).
% 360719 [] ss^list(sk10).
% 360720 [] ss^list(sk9).
% 360721 [] ss^item(sk8).
% 360722 [] ss^item(sk7).
% 360725 [] strictordered^p(sk3).
% 360729 [] equal(sk1,sk3).
% 360734 [] ss^list(sk1).
% 360801 [binary:360650.3,360719] equal(app(cons(X,nil),sk10),cons(X,sk10)) | -ss^item(X).
% 360842 [binary:360679.3,360719] equal(app(app(X,Y),sk10),app(X,app(Y,sk10))) | -ss^list(Y) | -ss^list(X).
% 360943 [binary:360615.2,360720] ss^list(app(sk9,X)) | -ss^list(X).
% 361109 [binary:360616.2,360721] ss^list(cons(sk8,X)) | -ss^list(X).
% 361209 [binary:360616.2,360722] ss^list(cons(sk7,X)) | -ss^list(X).
% 362155 [binary:360632,360717,cut:360721,cut:360722] equal(sk7,sk8).
% 362413 [para:360729.1.2,360725.1.1] strictordered^p(sk1).
% 363814 [binary:360641.2,362155,cut:360721,cut:360722] -lt(sk7,sk8).
% 383336 [binary:360721,360801.2] equal(app(cons(sk8,nil),sk10),cons(sk8,sk10)).
% 396587 [para:360842.1.1,360718.1.1,demod:383336,binarydemod:361109,361209,360943,cut:360538] equal(app(app(sk9,cons(sk7,nil)),cons(sk8,sk10)),sk1).
% 458961 [binary:396587,360711,cut:363814,cut:360721,cut:360722,cut:360734,cut:360538,cut:360720,cut:360719,cut:362413] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using binary resolution
% 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: 5130
% derived clauses: 674904
% kept clauses: 305711
% kept size sum: 0
% kept mid-nuclei: 60070
% kept new demods: 33001
% forw unit-subs: 63090
% forw double-subs: 18477
% forw overdouble-subs: 13320
% backward subs: 74
% fast unit cutoff: 52621
% full unit cutoff: 0
% dbl unit cutoff: 1503
% real runtime : 98.61
% process. runtime: 97.35
% specific non-discr-tree subsumption statistics:
% tried: 4625453
% length fails: 12684
% strength fails: 670296
% predlist fails: 3134632
% aux str. fails: 124767
% by-lit fails: 87344
% full subs tried: 521042
% full subs fail: 506659
%
% ; 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/SWC176-1+eq_r.in")
%
%------------------------------------------------------------------------------