TSTP Solution File: GEO029-2 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : GEO029-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 : art03.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/GEO029-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(21,40,0,42,0,0)
%
%
% START OF PROOF
% 23 [] equidistant(X,Y,Y,X).
% 24 [] -equidistant(X,Y,V,W) | -equidistant(X,Y,Z,U) | equidistant(Z,U,V,W).
% 25 [] -equidistant(X,Y,Z,Z) | equal(X,Y).
% 26 [] between(X,Y,extension(X,Y,Z,U)).
% 27 [] equidistant(X,extension(Y,X,Z,U),Z,U).
% 28 [] -equidistant(X,X1,Z,X2) | -equidistant(Y,X1,U,X2) | -equidistant(X,Y,Z,U) | -equidistant(Y,V,U,W) | equidistant(V,X1,W,X2) | -between(X,Y,V) | -between(Z,U,W) | equal(X,Y).
% 29 [] -between(X,Y,X) | equal(X,Y).
% 39 [] between(X,continuous(Y,Z,X,U,V,W),W) | -equidistant(Y,Z,Y,X) | -equidistant(Y,V,Y,W) | -between(Z,U,V) | -between(Y,Z,V).
% 40 [] equidistant(X,Y,X,continuous(X,Z,U,Y,V,W)) | -equidistant(X,Z,X,U) | -equidistant(X,V,X,W) | -between(Z,Y,V) | -between(X,Z,V).
% 41 [] -equal(u,v).
% 42 [] -equal(extension(u,v,u,v),extension(u,v,v,u)).
% 44 [hyper:24,23,23] equidistant(X,Y,X,Y).
% 166 [hyper:24,27,23] equidistant(X,Y,extension(Z,U,X,Y),U).
% 167 [hyper:24,27,44] equidistant(X,Y,Z,extension(U,Z,X,Y)).
% 168 [hyper:25,27] equal(X,extension(Y,X,Z,Z)).
% 255 [para:168.1.2,26.1.3] between(X,Y,Y).
% 256 [para:168.1.2,27.1.2] equidistant(X,X,Y,Y).
% 318 [hyper:39,255,255,44,44] between(X,continuous(Y,X,X,X,X,X),X).
% 362 [hyper:40,255,255,44,44] equidistant(X,Y,X,continuous(X,Y,Y,Y,Y,Y)).
% 1292 [hyper:24,166,23] equidistant(X,Y,extension(Z,U,Y,X),U).
% 1381 [hyper:24,167,23] equidistant(X,Y,Z,extension(U,Z,Y,X)).
% 1383 [hyper:24,167,167] equidistant(X,extension(Y,X,Z,U),V,extension(W,V,Z,U)).
% 1981 [hyper:24,1292,166] equidistant(extension(X,Y,Z,U),Y,extension(V,W,U,Z),W).
% 2232 [hyper:24,1381,167] equidistant(X,extension(Y,X,Z,U),V,extension(W,V,U,Z)).
% 3397 [hyper:29,318] equal(X,continuous(Y,X,X,X,X,X)).
% 14967 [hyper:28,1383,26,26,23,256,cut:23] equidistant(extension(X,Y,Z,U),X,extension(Y,X,Z,U),Y) | equal(X,Y).
% 25282 [hyper:41,14967] equidistant(extension(u,v,X,Y),u,extension(v,u,X,Y),v).
% 25646 [hyper:24,25282,44] equidistant(extension(v,u,X,Y),v,extension(u,v,X,Y),u).
% 27710 [hyper:28,25646,1981,26,2232,26,demod:168,cut:23,cut:41] equidistant(extension(u,v,X,Y),u,extension(v,u,Y,X),v).
% 31950 [hyper:24,27710,14967,cut:41] equidistant(extension(v,u,X,Y),v,extension(v,u,Y,X),v).
% 35353 [hyper:28,31950,362,26,2232,26,demod:3397,168,cut:44,cut:41] equidistant(extension(u,v,X,Y),Z,extension(u,v,Y,X),Z).
% 36789 [hyper:25,35353,slowcut:42] 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: 119
% derived clauses: 236684
% kept clauses: 128
% kept size sum: 1628
% kept mid-nuclei: 36556
% kept new demods: 8
% forw unit-subs: 82610
% forw double-subs: 2789
% forw overdouble-subs: 0
% backward subs: 5
% fast unit cutoff: 8947
% full unit cutoff: 6
% dbl unit cutoff: 36
% real runtime : 3.11
% process. runtime: 3.10
% specific non-discr-tree subsumption statistics:
% tried: 3750
% length fails: 0
% strength fails: 614
% predlist fails: 1098
% aux str. fails: 129
% by-lit fails: 0
% full subs tried: 1909
% full subs fail: 1909
%
% ; 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/GEO029-2+eq_r.in")
%
%------------------------------------------------------------------------------