↑ Up

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

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : GEO027-3 : TPTP v3.4.2. Released v1.0.0.
% Transfm  : add_equality:r
% Format   : otter:hypothesis:set(auto),clear(print_given)
% Command  : gandalf-wrapper -time %d %s

% Computer : art08.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 10.0s
% Output   : Assurance 10.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/GEO027-3+eq_r.in
% Using automatic strategy selection.
% Time limit in seconds: 600
% 
% prove-all-passes started
% 
% detected problem class: neq
% detected subclass: medium
% 
% strategies selected: 
% (hyper 25 #f 2 15)
% (binary-unit 9 #f 2 15)
% (binary-double 9 #f 2 15)
% (binary-double 15 #f)
% (binary-double 15 #t)
% (binary 50 #t 2 15)
% (binary-order 25 #f 2 15)
% (binary-posweight-order 101 #f)
% (binary-posweight-lex-big-order 25 #f)
% (binary-posweight-lex-small-order 9 #f)
% (binary-order-sos 50 #t)
% (binary-unit-uniteq 25 #f)
% (binary-weightorder 50 #f)
% (binary-order 50 #f)
% (hyper-order 30 #f)
% (binary 112 #t)
% 
% 
% ********* EMPTY CLAUSE DERIVED *********
% 
% 
% timer checkpoints: c(42,40,0,84,0,1,187249,4,1878)
% 
% 
% START OF PROOF
% 47 [] between(X,Y,extension(X,Y,Z,U)).
% 48 [] equidistant(X,extension(Y,X,Z,U),Z,U).
% 63 [] equidistant(X,Y,X,Y).
% 81 [] -equidistant(X,Y,X,Z) | -between(U,X,Y) | -between(U,X,Z) | equal(U,X) | equal(Y,Z).
% 82 [] between(u,v,w).
% 83 [] -equal(u,v).
% 84 [] -equal(w,extension(u,v,v,w)).
% 1404 [hyper:81,48,47,82,cut:83] equal(extension(u,v,v,w),w).
% 187862 [binary:81.4,83] -equidistant(v,X,v,Y) | -between(u,v,Y) | -between(u,v,X) | equal(X,Y).
% 187942 [binary:84,187862.4,demod:1404,cut:82,cut:63] contradiction
% END OF PROOF
% 
% Proof found by the following strategy:
% 
% using binary resolution
% not using sos 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 2
% seconds given: 25
% 
% 
% ***GANDALF_FOUND_A_REFUTATION***
% 
% Global statistics over all passes: 
% 
%  given clauses:    359
%  derived clauses:   1311590
%  kept clauses:      2256
%  kept size sum:     36867
%  kept mid-nuclei:   185349
%  kept new demods:   25
%  forw unit-subs:    335689
%  forw double-subs: 31802
%  forw overdouble-subs: 1024
%  backward subs:     50
%  fast unit cutoff:  49626
%  full unit cutoff:  6
%  dbl  unit cutoff:  198
%  real runtime  :  18.80
%  process. runtime:  18.79
% specific non-discr-tree subsumption statistics: 
%  tried:           50354
%  length fails:    150
%  strength fails:  2683
%  predlist fails:  24445
%  aux str. fails:  971
%  by-lit fails:    0
%  full subs tried: 22105
%  full subs fail:  21081
% 
% ; 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/GEO027-3+eq_r.in")
% 
%------------------------------------------------------------------------------