TSTP Solution File: GEO026-3 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : GEO026-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 : 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/GEO026-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 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(43,40,0,86,0,0)
%
%
% START OF PROOF
% 45 [] equidistant(X,Y,Y,X).
% 46 [] -equidistant(X,Y,V,W) | -equidistant(X,Y,Z,U) | equidistant(Z,U,V,W).
% 47 [] -equidistant(X,Y,Z,Z) | equal(X,Y).
% 50 [] -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).
% 64 [] equidistant(X,Y,X,Y).
% 65 [] -equidistant(X,Y,Z,U) | equidistant(Z,U,X,Y).
% 82 [] between(u,v,w).
% 83 [] between(u,v,x).
% 84 [] equidistant(v,w,v,x).
% 85 [] -equal(u,v).
% 86 [] -equal(w,x).
% 161 [hyper:65,84] equidistant(v,x,v,w).
% 20454 [hyper:50,64,64,161,82,cut:64,cut:83,cut:85] equidistant(x,X,w,X).
% 20456 [hyper:46,20454,45] equidistant(X,x,w,X).
% 23440 [hyper:47,20456,cut:86] 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: 135
% derived clauses: 68546
% kept clauses: 495
% kept size sum: 4427
% kept mid-nuclei: 22834
% kept new demods: 4
% forw unit-subs: 27898
% forw double-subs: 2781
% forw overdouble-subs: 14
% backward subs: 2
% fast unit cutoff: 6125
% full unit cutoff: 0
% dbl unit cutoff: 0
% real runtime : 1.15
% process. runtime: 1.15
% specific non-discr-tree subsumption statistics:
% tried: 5736
% length fails: 90
% strength fails: 928
% predlist fails: 885
% aux str. fails: 1026
% by-lit fails: 0
% full subs tried: 2793
% full subs fail: 2793
%
% ; 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/GEO026-3+eq_r.in")
%
%------------------------------------------------------------------------------