TSTP Solution File: SWC355-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SWC355-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 : art03.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 50.0s
% Output : Assurance 50.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/SWC355-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(200,40,3,400,0,3,54953,4,2204,56900,5,2805,56901,1,2807,56901,50,2810,56901,40,2810,57101,0,2810,142046,3,4213,179892,4,4911)
%
%
% START OF PROOF
% 56910 [] ss^list(nil).
% 56953 [] ss^list(skaf45(X,Y)).
% 56976 [] equal(app(nil,X),X) | -ss^list(X).
% 56988 [] ss^list(cons(X,Y)) | -ss^item(X) | -ss^list(Y).
% 57034 [] equal(app(X,skaf45(Y,X)),Y) | -frontseg^p(Y,X) | -ss^list(Y) | -ss^list(X).
% 57046 [] -equal(app(X,Y),Z) | frontseg^p(Z,X) | -ss^list(Z) | -ss^list(X) | -ss^list(Y).
% 57075 [] -equal(app(app(X,Y),Z),U) | segment^p(U,Y) | -ss^list(U) | -ss^list(Y) | -ss^list(Z) | -ss^list(X).
% 57088 [] ss^list(sk1).
% 57089 [] ss^list(sk2).
% 57091 [] ss^list(sk4).
% 57092 [] equal(sk2,sk4).
% 57093 [] equal(sk1,sk3).
% 57094 [] neq(sk2,nil).
% 57099 [] -neq(sk4,nil) | ss^item(sk5).
% 57100 [] equal(app(sk3,cons(sk5,nil)),sk4) | -neq(sk4,nil).
% 57101 [] -neq(sk4,nil) | -segment^p(sk2,sk1).
% 57869 [para:57092.1.2,57099.1.1,cut:57094] ss^item(sk5).
% 57871 [para:57092.1.2,57100.2.1,cut:57094] equal(app(sk3,cons(sk5,nil)),sk4).
% 57874 [para:57092.1.2,57101.1.1,cut:57094] -segment^p(sk2,sk1).
% 57875 [para:57093.1.2,57871.1.1.1] equal(app(sk1,cons(sk5,nil)),sk4).
% 58359 [binary:57088,56976.2] equal(app(nil,sk1),sk1).
% 58989 [binary:57869,56988.2] ss^list(cons(sk5,X)) | -ss^list(X).
% 64960 [binary:57875,57046,cut:57091,cut:57088,binarydemod:58989,cut:56910] frontseg^p(sk4,sk1).
% 65039 [para:57092.1.2,64960.1.1] frontseg^p(sk2,sk1).
% 65158 [binary:57034.2,65039,cut:57089,cut:57088] equal(app(sk1,skaf45(sk2,sk1)),sk2).
% 70745 [para:58359.1.1,57075.1.1.1,cut:57088,cut:56910] -equal(app(sk1,X),Y) | segment^p(Y,sk1) | -ss^list(Y) | -ss^list(X).
% 191898 [binary:65158,70745,cut:57874,cut:57089,cut:56953] 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 dynamic demodulation
% using ordered paramodulation
% using kb ordering for equality
% preferring bigger arities for lex ordering
% using clause demodulation
% clause length limited to 19
% clause depth limited to 5
% seconds given: 28
%
%
% old unit clauses discarded
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 1580
% derived clauses: 263384
% kept clauses: 119019
% kept size sum: 0
% kept mid-nuclei: 26698
% kept new demods: 33075
% forw unit-subs: 20124
% forw double-subs: 5683
% forw overdouble-subs: 3457
% backward subs: 25
% fast unit cutoff: 18534
% full unit cutoff: 0
% dbl unit cutoff: 303
% real runtime : 51.80
% process. runtime: 51.79
% specific non-discr-tree subsumption statistics:
% tried: 1246135
% length fails: 18256
% strength fails: 117393
% predlist fails: 862291
% aux str. fails: 41175
% by-lit fails: 44559
% full subs tried: 139274
% full subs fail: 135578
%
% ; 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/SWC355-1+eq_r.in")
%
%------------------------------------------------------------------------------