↑ Up

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

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : GEO065-2 : 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 : art10.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/GEO065-2+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(25,40,0,50,0,0)
% 
% 
% START OF PROOF
% 29 [] -equidistant(X,Y,Z,Z) | equal(X,Y).
% 30 [] between(X,Y,extension(X,Y,Z,U)).
% 31 [] equidistant(X,extension(Y,X,Z,U),Z,U).
% 33 [] -between(X,Y,X) | equal(X,Y).
% 34 [] between(X,inner_pasch(Y,X,Z,U,V),V) | -between(V,U,Z) | -between(Y,X,Z).
% 35 [] between(X,inner_pasch(Y,Z,U,X,V),Y) | -between(V,X,U) | -between(Y,Z,U).
% 46 [] -between(X,Y,Z) | colinear(Z,X,Y).
% 49 [] between(u,w,v).
% 50 [] -colinear(u,v,w).
% 199 [hyper:29,31] equal(X,extension(Y,X,Z,Z)).
% 290 [para:199.1.2,30.1.3] between(X,Y,Y).
% 331 [hyper:34,290,49] between(v,inner_pasch(X,v,v,w,u),u).
% 336 [hyper:35,290,49] between(w,inner_pasch(X,v,v,w,u),X).
% 3826 [hyper:33,336] equal(w,inner_pasch(w,v,v,w,u)).
% 3933 [para:3826.1.2,331.1.2] between(v,w,u).
% 4450 [hyper:46,3933,cut:50] 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 2
% seconds given: 25
% 
% 
% ***GANDALF_FOUND_A_REFUTATION***
% 
% Global statistics over all passes: 
% 
%  given clauses:    113
%  derived clauses:   13769
%  kept clauses:      203
%  kept size sum:     2091
%  kept mid-nuclei:   4169
%  kept new demods:   12
%  forw unit-subs:    3951
%  forw double-subs: 398
%  forw overdouble-subs: 0
%  backward subs:     3
%  fast unit cutoff:  982
%  full unit cutoff:  0
%  dbl  unit cutoff:  8
%  real runtime  :  0.28
%  process. runtime:  0.27
% specific non-discr-tree subsumption statistics: 
%  tried:           1447
%  length fails:    0
%  strength fails:  185
%  predlist fails:  575
%  aux str. fails:  91
%  by-lit fails:    0
%  full subs tried: 596
%  full subs fail:  596
% 
% ; 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/GEO065-2+eq_r.in")
% 
%------------------------------------------------------------------------------