TSTP Solution File: GEO049-2 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : GEO049-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 : art06.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/GEO049-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(24,40,0,48,0,0,238733,4,1877)
%
%
% START OF PROOF
% 26 [] equidistant(X,Y,Y,X).
% 27 [] -equidistant(X,Y,V,W) | -equidistant(X,Y,Z,U) | equidistant(Z,U,V,W).
% 28 [] -equidistant(X,Y,Z,Z) | equal(X,Y).
% 29 [] between(X,Y,extension(X,Y,Z,U)).
% 30 [] equidistant(X,extension(Y,X,Z,U),Z,U).
% 31 [] -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).
% 32 [] -between(X,Y,X) | equal(X,Y).
% 33 [] between(X,inner_pasch(Y,X,Z,U,V),V) | -between(V,U,Z) | -between(Y,X,Z).
% 34 [] between(X,inner_pasch(Y,Z,U,X,V),Y) | -between(V,X,U) | -between(Y,Z,U).
% 44 [] equidistant(u,v,u1,v1).
% 45 [] equidistant(v,w,v1,w1).
% 46 [] equidistant(u,w,u1,w1).
% 47 [] between(u,v,w).
% 48 [] -between(u1,v1,w1).
% 81 [hyper:27,26,26] equidistant(X,Y,X,Y).
% 146 [hyper:27,81,44] equidistant(u1,v1,u,v).
% 207 [hyper:27,45,81] equidistant(v1,w1,v,w).
% 247 [hyper:27,46,81] equidistant(u1,w1,u,w).
% 872 [hyper:27,30,81] equidistant(X,Y,Z,extension(U,Z,X,Y)).
% 873 [hyper:28,30] equal(X,extension(Y,X,Z,Z)).
% 7087 [para:873.1.2,29.1.3] between(X,Y,Y).
% 7513 [hyper:33,7087,7087] between(X,inner_pasch(Y,X,X,X,Z),Z).
% 7518 [hyper:34,7087,7087] between(X,inner_pasch(Y,X,X,X,Z),Y).
% 10394 [hyper:27,872,26] equidistant(X,extension(Y,X,Z,U),U,Z).
% 12128 [hyper:32,7513] equal(X,inner_pasch(Y,X,X,X,X)).
% 12241 [para:12128.1.2,7518.1.2] between(X,X,Y).
% 14910 [hyper:31,10394,29,47,146,207,cut:247] equidistant(extension(u1,v1,w,v),w1,w,w) | equal(u1,v1).
% 238587 [hyper:28,14910] equal(extension(u1,v1,w,v),w1) | equal(u1,v1).
% 238843 [para:238587.1.2,48.1.3,cut:29] equal(u1,v1).
% 240553 [para:238843.1.1,48.1.1,cut:12241] 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: 379
% derived clauses: 904639
% kept clauses: 3449
% kept size sum: 50372
% kept mid-nuclei: 236761
% kept new demods: 22
% forw unit-subs: 248261
% forw double-subs: 27657
% forw overdouble-subs: 22
% backward subs: 21
% fast unit cutoff: 79712
% full unit cutoff: 2
% dbl unit cutoff: 242
% real runtime : 18.86
% process. runtime: 18.83
% specific non-discr-tree subsumption statistics:
% tried: 14886
% length fails: 0
% strength fails: 1176
% predlist fails: 4336
% aux str. fails: 3269
% by-lit fails: 0
% full subs tried: 6105
% full subs fail: 6083
%
% ; 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/GEO049-2+eq_r.in")
%
%------------------------------------------------------------------------------