↑ Up

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

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : FLD061-1 : TPTP v3.4.2. Bugfixed v2.1.0.
% Transfm  : add_equality:r
% Format   : otter:hypothesis:set(auto),clear(print_given)
% Command  : gandalf-wrapper -time %d %s

% Computer : art09.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 79.9s
% Output   : Assurance 79.9s
% 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/FLD/FLD061-1+noeq.in
% Using automatic strategy selection.
% Time limit in seconds: 600
% 
% prove-all-passes started
% 
% detected problem class: nne
% detected subclass: medium
% 
% strategies selected: 
% (hyper 27 #f 3 7)
% (binary-unit 10 #f 3 7)
% (binary-double 16 #f 3 7)
% (binary 54 #t 3 7)
% (binary-order 27 #f 3 7)
% (binary-posweight-order 125 #f)
% (binary-order-sos 54 #t)
% (binary-unit-uniteq 27 #f)
% (binary-weightorder 54 #f)
% (binary-order 54 #f)
% (hyper-order 43 #f)
% (binary 109 #t)
% 
% 
% ********* EMPTY CLAUSE DERIVED *********
% 
% 
% timer checkpoints: c(34,40,1,68,0,1,775381,4,2044,775405,50,2071,775405,40,2071,775439,0,2071,818049,3,2574,824787,4,2822,847211,5,3072,847211,1,3072,847211,50,3076,847211,40,3076,847245,0,3076,907941,3,3877,926228,4,4277,989637,5,4677,989638,5,4678,989638,1,4678,989638,50,4685,989638,40,4685,989672,0,4685,1105345,3,7386,1120897,4,8736)
% 
% 
% START OF PROOF
% 989642 [] equalish(add(X,Y),add(Y,X)) | -defined(X) | -defined(Y).
% 989655 [] -less_or_equal(X,Y) | -less_or_equal(Y,Z) | less_or_equal(X,Z).
% 989657 [] less_or_equal(add(X,Y),add(Z,Y)) | -less_or_equal(X,Z) | -defined(Y).
% 989664 [] -less_or_equal(X,Y) | -equalish(X,Z) | less_or_equal(Z,Y).
% 989667 [] defined(b).
% 989668 [] defined(c).
% 989670 [] less_or_equal(a,b).
% 989671 [] less_or_equal(c,d).
% 989672 [] -less_or_equal(add(a,c),add(d,b)).
% 989707 [binary:989642.3,989667] equalish(add(X,b),add(b,X)) | -defined(X).
% 989725 [binary:989657.3,989667] less_or_equal(add(X,b),add(Y,b)) | -less_or_equal(X,Y).
% 989806 [binary:989657.2,989670] less_or_equal(add(a,X),add(b,X)) | -defined(X).
% 989867 [binary:989655.3,989672] -less_or_equal(X,add(d,b)) | -less_or_equal(add(a,c),X).
% 991863 [binary:989664.2,989707] -less_or_equal(add(X,b),Y) | less_or_equal(add(b,X),Y) | -defined(X).
% 993415 [binary:989671,989725.2] less_or_equal(add(c,b),add(d,b)).
% 1006857 [binary:989806,989867.2,cut:989668] -less_or_equal(add(b,c),add(d,b)).
% 1141858 [binary:993415,991863,cut:1006857,cut:989668] contradiction
% END OF PROOF
% 
% Proof found by the following strategy:
% 
% using binary resolution
% 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 7
% clause depth limited to 3
% seconds given: 54
% 
% 
% old unit clauses discarded
% 
% ***GANDALF_FOUND_A_REFUTATION***
% 
% Global statistics over all passes: 
% 
%  given clauses:    8661
%  derived clauses:   4246125
%  kept clauses:      284122
%  kept size sum:     0
%  kept mid-nuclei:   110170
%  kept new demods:   0
%  forw unit-subs:    98290
%  forw double-subs: 118001
%  forw overdouble-subs: 12940
%  backward subs:     5
%  fast unit cutoff:  16098
%  full unit cutoff:  0
%  dbl  unit cutoff:  299
%  real runtime  :  88.95
%  process. runtime:  88.36
% specific non-discr-tree subsumption statistics: 
%  tried:           245781
%  length fails:    107
%  strength fails:  17431
%  predlist fails:  98930
%  aux str. fails:  503
%  by-lit fails:    37
%  full subs tried: 120009
%  full subs fail:  112536
% 
% ; 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/FLD/FLD061-1+noeq.in")
% 
%------------------------------------------------------------------------------