↑ Up

Gandalf---c-2.6.UNS-Ass.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : SWC009-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 49.5s
% Output   : Assurance 49.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/SWC009-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(198,40,1,401,0,1,50209,4,2190,52134,5,2802,52135,1,2804,52135,50,2806,52135,40,2806,52338,0,2806,130326,3,4209,162770,4,4907)
% 
% 
% START OF PROOF
% 52136 [] equal(X,X).
% 52144 [] ss^list(nil).
% 52209 [] equal(app(X,nil),X) | -ss^list(X).
% 52236 [] neq(X,Y) | equal(X,Y) | -ss^list(Y) | -ss^list(X).
% 52251 [] -neq(X,Y) | -equal(X,Y) | -ss^list(Y) | -ss^list(X).
% 52325 [] equal(app(sk3,sk5),sk4).
% 52326 [] ss^list(sk5).
% 52327 [] -equal(app(app(X,Y),Z),sk2) | -equal(app(X,Z),sk1) | -ss^list(Z) | -ss^list(X) | -ss^list(Y).
% 52328 [] equal(sk1,sk3).
% 52329 [] equal(sk2,sk4).
% 52330 [] ss^list(sk4).
% 52332 [] ss^list(sk2).
% 52333 [] ss^list(sk1).
% 52359 [input:52251,factor:cut:52136] -neq(X,X) | -ss^list(X).
% 53131 [para:52328.1.2,52325.1.1.1] equal(app(sk1,sk5),sk4).
% 53865 [para:53131.1.1,52327.1.1.1,cut:52333,cut:52326] -equal(app(sk1,X),sk1) | -equal(app(sk4,X),sk2) | -ss^list(X).
% 53903 [binary:52330,52209.2] equal(app(sk4,nil),sk4).
% 53906 [binary:52333,52209.2] equal(app(sk1,nil),sk1).
% 54953 [binary:52330,52359.2] -neq(sk4,sk4).
% 54986 [para:52329.1.2,54953.1.2] -neq(sk4,sk2).
% 55326 [binary:54986,52236,cut:52332,cut:52330] equal(sk4,sk2).
% 170087 [binary:53906,53865,demod:53903,cut:55326,cut:52144] 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:    1565
%  derived clauses:   238034
%  kept clauses:      114689
%  kept size sum:     0
%  kept mid-nuclei:   21415
%  kept new demods:   30787
%  forw unit-subs:    12062
%  forw double-subs: 4500
%  forw overdouble-subs: 2838
%  backward subs:     18
%  fast unit cutoff:  14550
%  full unit cutoff:  0
%  dbl  unit cutoff:  290
%  real runtime  :  50.87
%  process. runtime:  50.32
% specific non-discr-tree subsumption statistics: 
%  tried:           1029636
%  length fails:    17347
%  strength fails:  101533
%  predlist fails:  683512
%  aux str. fails:  37261
%  by-lit fails:    37757
%  full subs tried: 131233
%  full subs fail:  128149
% 
% ; 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/SWC009-1+eq_r.in")
% 
%------------------------------------------------------------------------------