TSTP Solution File: GEO037-2 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : GEO037-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 : 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 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/GEO037-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)
%
%
% SOS clause
% equal(v,extension(u,v,lower_dimension_point_1,lower_dimension_point_2)) | -equidistant(v,extension(u,v,lower_dimension_point_1,lower_dimension_point_2),x,extension(w,x,lower_dimension_point_1,lower_dimension_point_2)) | -between(u,v,extension(u,v,lower_dimension_point_1,lower_dimension_point_2)).
% was split for some strategies as:
% equal(v,extension(u,v,lower_dimension_point_1,lower_dimension_point_2)).
% -equidistant(v,extension(u,v,lower_dimension_point_1,lower_dimension_point_2),x,extension(w,x,lower_dimension_point_1,lower_dimension_point_2)).
% -between(u,v,extension(u,v,lower_dimension_point_1,lower_dimension_point_2)).
%
% ********* EMPTY CLAUSE DERIVED *********
%
% ********* EMPTY CLAUSE DERIVED *********
%
%
% timer checkpoints: c(20,40,0,40,0,0,77374,4,626)
%
%
% START OF PROOF
% 22 [] equidistant(X,Y,Y,X).
% 23 [] -equidistant(X,Y,V,W) | -equidistant(X,Y,Z,U) | equidistant(Z,U,V,W).
% 24 [] -equidistant(X,Y,Z,Z) | equal(X,Y).
% 25 [] between(X,Y,extension(X,Y,Z,U)).
% 26 [] equidistant(X,extension(Y,X,Z,U),Z,U).
% 33 [] -between(lower_dimension_point_3,lower_dimension_point_1,lower_dimension_point_2).
% 40 [] -equidistant(v,extension(u,v,lower_dimension_point_1,lower_dimension_point_2),x,extension(w,x,lower_dimension_point_1,lower_dimension_point_2)) | -between(u,v,extension(u,v,lower_dimension_point_1,lower_dimension_point_2)) | equal(v,extension(u,v,lower_dimension_point_1,lower_dimension_point_2)).
% 42 [hyper:23,22,22] equidistant(X,Y,X,Y).
% 163 [hyper:23,26,42] equidistant(X,Y,Z,extension(U,Z,X,Y)).
% 164 [hyper:24,26] equal(X,extension(Y,X,Z,Z)).
% 255 [para:164.1.2,25.1.3] between(X,Y,Y).
% 256 [para:164.1.2,26.1.2] equidistant(X,X,Y,Y).
% 1497 [hyper:23,163,163] equidistant(X,extension(Y,X,Z,U),V,extension(W,V,Z,U)).
% 13432 [hyper:40,1497,cut:25] equal(v,extension(u,v,lower_dimension_point_1,lower_dimension_point_2)).
% 13894 [para:13432.1.2,26.1.2] equidistant(v,v,lower_dimension_point_1,lower_dimension_point_2).
% 14395 [hyper:23,13894,256] equidistant(lower_dimension_point_1,lower_dimension_point_2,X,X).
% 20229 [hyper:23,14395,22] equidistant(lower_dimension_point_2,lower_dimension_point_1,X,X).
% 25250 [hyper:24,20229] equal(lower_dimension_point_2,lower_dimension_point_1).
% 77391 [para:25250.1.1,33.1.3,cut:255] 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: 8
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 144
% derived clauses: 489875
% kept clauses: 276
% kept size sum: 3037
% kept mid-nuclei: 76887
% kept new demods: 38
% forw unit-subs: 211667
% forw double-subs: 4910
% forw overdouble-subs: 148
% backward subs: 15
% fast unit cutoff: 24755
% full unit cutoff: 10
% dbl unit cutoff: 156
% real runtime : 6.26
% process. runtime: 6.26
% specific non-discr-tree subsumption statistics:
% tried: 4996
% length fails: 0
% strength fails: 1105
% predlist fails: 1390
% aux str. fails: 225
% by-lit fails: 0
% full subs tried: 2276
% full subs fail: 2128
%
% ; 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/GEO037-2+eq_r.in")
%
%------------------------------------------------------------------------------