TSTP Solution File: GEO048-3 by Gandalf---c-2.6

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : GEO048-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 : art07.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 20.0s
% Output   : Assurance 20.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/GEO048-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 3 15)
% (binary-unit 9 #f 3 15)
% (binary-double 9 #f 3 15)
% (binary-double 15 #f)
% (binary-double 15 #t)
% (binary 50 #t 3 15)
% (binary-order 25 #f 3 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 *********
% 
% **** EMPTY CLAUSE DERIVED ****
% By given clause simplification.
% 
% 
% timer checkpoints: c(69,40,1,138,0,1,239511,4,1881,267009,5,2502,267011,1,2502,267011,50,2505,267011,40,2505,267080,0,2505)
% 
% 
% START OF PROOF
% 267021 [] between(X,inner_pasch(Y,Z,U,X,V),Y) | -between(V,X,U) | -between(Y,Z,U).
% 267058 [] -between(X,Y,Z) | between(Z,Y,X).
% 267076 [] between(u,v,w).
% 267077 [] between(u1,v1,w).
% 267078 [] between(u,x,u1).
% 267080 [] -between(v,inner_pasch(v1,inner_pasch(u,x,u1,v1,w),u,v,w),v1).
% 267221 [binary:267078,267021.3] between(X,inner_pasch(u,x,u1,X,Y),u) | -between(Y,X,u1).
% 267237 [binary:267076,267058] between(w,v,u).
% 267238 [binary:267077,267058] between(w,v1,u1).
% 292611 [binary:267238,267221.2] between(v1,inner_pasch(u,x,u1,v1,w),u).
% 292613 [binary:267080,267021,cut:292611,cut:267237] contradiction
% END OF PROOF
% 
% Proof found by the following strategy:
% 
% using binary resolution
% not using sos 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 15
% clause depth limited to 3
% seconds given: 9
% 
% 
% ***GANDALF_FOUND_A_REFUTATION***
% 
% Global statistics over all passes: 
% 
%  given clauses:    1052
%  derived clauses:   1094238
%  kept clauses:      72050
%  kept size sum:     822576
%  kept mid-nuclei:   210541
%  kept new demods:   21
%  forw unit-subs:    206746
%  forw double-subs: 65266
%  forw overdouble-subs: 5091
%  backward subs:     21
%  fast unit cutoff:  32187
%  full unit cutoff:  1
%  dbl  unit cutoff:  78
%  real runtime  :  28.95
%  process. runtime:  28.94
% specific non-discr-tree subsumption statistics: 
%  tried:           379737
%  length fails:    9111
%  strength fails:  43067
%  predlist fails:  215581
%  aux str. fails:  6521
%  by-lit fails:    3859
%  full subs tried: 97507
%  full subs fail:  92402
% 
% ; 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/GEO048-3+eq_r.in")
% 
%------------------------------------------------------------------------------