TSTP Solution File: GEO053-2 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : GEO053-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 9.6s
% Output : Assurance 9.6s
% 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/GEO053-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(22,40,1,44,0,1)
%
%
% START OF PROOF
% 24 [] equidistant(X,Y,Y,X).
% 25 [] -equidistant(X,Y,V,W) | -equidistant(X,Y,Z,U) | equidistant(Z,U,V,W).
% 26 [] -equidistant(X,Y,Z,Z) | equal(X,Y).
% 27 [] between(X,Y,extension(X,Y,Z,U)).
% 28 [] equidistant(X,extension(Y,X,Z,U),Z,U).
% 29 [] -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).
% 30 [] -between(X,Y,X) | equal(X,Y).
% 31 [] between(X,inner_pasch(Y,X,Z,U,V),V) | -between(V,U,Z) | -between(Y,X,Z).
% 32 [] between(X,inner_pasch(Y,Z,U,X,V),Y) | -between(V,X,U) | -between(Y,Z,U).
% 42 [] between(u,v,w).
% 43 [] equidistant(u,v,u,w).
% 44 [] -equal(v,w).
% 108 [hyper:25,24,43] equidistant(u,w,v,u).
% 332 [hyper:25,108,24] equidistant(w,u,v,u).
% 334 [hyper:25,108,24] equidistant(v,u,w,u).
% 619 [hyper:26,28] equal(X,extension(Y,X,Z,Z)).
% 3531 [para:619.1.2,27.1.3] between(X,Y,Y).
% 3687 [hyper:31,3531,3531] between(X,inner_pasch(Y,X,X,X,Z),Z).
% 3689 [hyper:31,3531,42] between(w,inner_pasch(X,w,w,v,u),u).
% 3693 [hyper:32,3531,3531] between(X,inner_pasch(Y,X,X,X,Z),Y).
% 3695 [hyper:32,3531,42] between(v,inner_pasch(X,w,w,v,u),X).
% 6063 [hyper:30,3687] equal(X,inner_pasch(Y,X,X,X,X)).
% 6176 [para:6063.1.2,3693.1.2] between(X,X,Y).
% 24087 [hyper:30,3695] equal(v,inner_pasch(v,w,w,v,u)).
% 24174 [para:24087.1.2,3689.1.2] between(w,v,u).
% 25379 [hyper:29,24174,24,332,27,28,cut:334,cut:44] equidistant(extension(v,w,v,u),u,u,u).
% 25484 [hyper:31,24174,6176] between(X,inner_pasch(X,X,u,v,w),w).
% 25485 [hyper:31,24174,24174] between(v,inner_pasch(w,v,u,v,w),w).
% 27046 [hyper:30,25484] equal(w,inner_pasch(w,w,u,v,w)).
% 27959 [hyper:26,25379] equal(extension(v,w,v,u),u).
% 28333 [para:27959.1.1,27.1.3] between(v,w,u).
% 29754 [hyper:31,28333,24174] between(v,inner_pasch(w,v,u,w,v),v).
% 29765 [hyper:32,28333,24174] between(w,inner_pasch(w,v,u,w,v),w).
% 231693 [hyper:30,29754] equal(v,inner_pasch(w,v,u,w,v)).
% 232990 [hyper:30,29765,demod:231693] equal(w,v).
% 233286 [para:232990.1.1,27046.1.2.2] equal(w,inner_pasch(w,v,u,v,w)).
% 233358 [para:232990.1.1,25485.1.3,demod:233286] between(v,w,v).
% 234026 [hyper:30,233358,cut:44] 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: 251
% derived clauses: 1150653
% kept clauses: 862
% kept size sum: 9430
% kept mid-nuclei: 232537
% kept new demods: 68
% forw unit-subs: 459618
% forw double-subs: 41966
% forw overdouble-subs: 0
% backward subs: 26
% fast unit cutoff: 71143
% full unit cutoff: 0
% dbl unit cutoff: 556
% real runtime : 17.48
% process. runtime: 16.90
% specific non-discr-tree subsumption statistics:
% tried: 15581
% length fails: 0
% strength fails: 3595
% predlist fails: 4960
% aux str. fails: 2160
% by-lit fails: 0
% full subs tried: 4866
% full subs fail: 4866
%
% ; 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/GEO053-2+eq_r.in")
%
%------------------------------------------------------------------------------