↑ Up

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

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : GEO013-3 : TPTP v3.4.2. Bugfixed v1.2.1.
% 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 0.0s
% Output   : Assurance 0.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/GEO/GEO013-3+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 3 15)
% (binary-unit 28 #f 3 15)
% (binary-double 11 #f 3 15)
% (binary-double 17 #f)
% (binary-double 17 #t)
% (binary 87 #t 3 15)
% (binary-order 28 #f 3 15)
% (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(111,40,1,222,0,1)
% 
% 
% START OF PROOF
% 214 [] -colinear(X,Y,Z) | -colinear(X,Y,U) | colinear(X,Z,U) | equal(X,Y).
% 215 [] -colinear(X,Y,Z) | -colinear(X,Y,U) | colinear(Y,Z,U) | equal(X,Y).
% 218 [] -equal(a,b).
% 219 [] colinear(a,b,d1).
% 220 [] colinear(a,b,d2).
% 221 [] colinear(a,b,d3).
% 222 [] -colinear(d1,d2,d3).
% 365 [hyper:214,220,219,cut:218] colinear(a,d1,d2).
% 369 [hyper:215,220,219,cut:218] colinear(b,d1,d2).
% 385 [hyper:214,221,219,cut:218] colinear(a,d1,d3).
% 391 [hyper:215,221,219,cut:218] colinear(b,d1,d3).
% 2283 [hyper:215,385,365,cut:222] equal(a,d1).
% 5784 [hyper:215,391,369,cut:222] equal(b,d1).
% 5793 [para:5784.1.2,2283.1.2,cut:218] contradiction
% END OF PROOF
% 
% Proof found by the following strategy:
% 
% using hyperresolution
% not using sos strategy
% using positive unit paramodulation strategy
% using dynamic demodulation
% using ordered paramodulation
% using kb ordering for equality
% preferring bigger arities for lex ordering
% clause length limited to 15
% clause depth limited to 3
% seconds given: 28
% 
% 
% ***GANDALF_FOUND_A_REFUTATION***
% 
% Global statistics over all passes: 
% 
%  given clauses:    70
%  derived clauses:   9804
%  kept clauses:      1270
%  kept size sum:     27587
%  kept mid-nuclei:   4268
%  kept new demods:   18
%  forw unit-subs:    2833
%  forw double-subs: 234
%  forw overdouble-subs: 924
%  backward subs:     3
%  fast unit cutoff:  282
%  full unit cutoff:  8
%  dbl  unit cutoff:  14
%  real runtime  :  0.35
%  process. runtime:  0.35
% specific non-discr-tree subsumption statistics: 
%  tried:           157559
%  length fails:    10032
%  strength fails:  67691
%  predlist fails:  27545
%  aux str. fails:  8298
%  by-lit fails:    14212
%  full subs tried: 28853
%  full subs fail:  28644
% 
% ; 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/GEO/GEO013-3+eq_r.in")
% 
%------------------------------------------------------------------------------