TSTP Solution File: SWC076-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SWC076-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 : art05.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 20.0s
% Output : Assurance 20.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/SWC076-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(201,40,0,408,0,1,50106,4,2177,52032,5,2803,52033,1,2804,52033,50,2807,52033,40,2807,52240,0,2807)
%
%
% START OF PROOF
% 52042 [] ss^list(nil).
% 52091 [] segment^p(X,X) | -ss^list(X).
% 52114 [] -segment^p(nil,X) | equal(nil,X) | -ss^list(X).
% 52134 [] neq(X,Y) | equal(X,Y) | -ss^list(Y) | -ss^list(X).
% 52207 [] -equal(app(app(X,Y),Z),U) | segment^p(U,Y) | -ss^list(U) | -ss^list(Y) | -ss^list(Z) | -ss^list(X).
% 52225 [] equal(app(app(sk5,sk3),sk6),sk4).
% 52226 [] ss^list(sk6).
% 52227 [] ss^list(sk5).
% 52228 [] -neq(X,nil) | -segment^p(sk2,X) | -segment^p(sk1,X) | -ss^list(X).
% 52229 [] equal(sk1,sk3).
% 52230 [] equal(sk2,sk4).
% 52231 [] ss^list(sk4).
% 52232 [] ss^list(sk3).
% 52234 [] ss^list(sk1).
% 52239 [] -equal(nil,sk3) | equal(nil,sk4).
% 52240 [] -equal(nil,sk2) | -equal(nil,sk1).
% 53213 [para:52229.1.2,52239.1.2] -equal(nil,sk1) | equal(nil,sk4).
% 53380 [binary:52232,52091.2] segment^p(sk3,sk3).
% 53448 [para:52229.1.2,53380.1.1] segment^p(sk1,sk3).
% 61405 [para:52230.1.2,53213.2.2,binarycut:52240] -equal(nil,sk1).
% 61407 [binary:52114.2,61405,cut:52234] -segment^p(nil,sk1).
% 66568 [binary:52225,52207,cut:52231,cut:52232,cut:52226,cut:52227] segment^p(sk4,sk3).
% 66780 [para:52229.1.2,66568.1.2] segment^p(sk4,sk1).
% 66781 [para:52230.1.2,66568.1.1] segment^p(sk2,sk3).
% 66788 [para:52239.2.2,66780.1.1,cut:61407] -equal(nil,sk3).
% 66795 [binary:52228.2,66781,cut:53448,cut:52232] -neq(sk3,nil).
% 66810 [binary:52114.2,66788,cut:52232] -segment^p(nil,sk3).
% 67003 [binary:52134,66795,cut:52042,cut:52232] equal(sk3,nil).
% 67306 [para:67003.1.1,53380.1.1,cut:66810] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using binary resolution
% not using sos 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
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 811
% derived clauses: 103234
% kept clauses: 51728
% kept size sum: 728525
% kept mid-nuclei: 13945
% kept new demods: 30285
% forw unit-subs: 4578
% forw double-subs: 2244
% forw overdouble-subs: 926
% backward subs: 16
% fast unit cutoff: 2268
% full unit cutoff: 0
% dbl unit cutoff: 154
% real runtime : 29.68
% process. runtime: 29.64
% specific non-discr-tree subsumption statistics:
% tried: 146890
% length fails: 1777
% strength fails: 18201
% predlist fails: 83729
% aux str. fails: 4413
% by-lit fails: 1037
% full subs tried: 28005
% full subs fail: 26764
%
% ; 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/SWC076-1+eq_r.in")
%
%------------------------------------------------------------------------------