TSTP Solution File: GEO029-3 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : GEO029-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 : art05.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/GEO029-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(41,40,1,82,0,1)
%
%
% START OF PROOF
% 44 [] -equidistant(X,Y,V,W) | -equidistant(X,Y,Z,U) | equidistant(Z,U,V,W).
% 46 [] between(X,Y,extension(X,Y,Z,U)).
% 47 [] equidistant(X,extension(Y,X,Z,U),Z,U).
% 62 [] equidistant(X,Y,X,Y).
% 65 [] -equidistant(X,Y,Z,U) | equidistant(X,Y,U,Z).
% 70 [] -equidistant(Z,U,V,W) | -equidistant(X,Y,Z,U) | equidistant(X,Y,V,W).
% 80 [] -equidistant(X,Y,X,Z) | -between(U,X,Y) | -between(U,X,Z) | equal(U,X) | equal(Y,Z).
% 81 [] -equal(u,v).
% 82 [] -equal(extension(u,v,u,v),extension(u,v,v,u)).
% 1121 [hyper:44,47,62] equidistant(X,Y,Z,extension(U,Z,X,Y)).
% 1282 [hyper:65,47] equidistant(X,extension(Y,X,Z,U),U,Z).
% 4876 [hyper:70,1282,1121] equidistant(X,extension(Y,X,Z,U),V,extension(W,V,U,Z)).
% 37571 [hyper:80,4876,46,46] equal(extension(X,Y,Z,U),extension(X,Y,U,Z)) | equal(X,Y).
% 146754 [hyper:81,37571,slowcut:82] 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: 230
% derived clauses: 1185464
% kept clauses: 551
% kept size sum: 9592
% kept mid-nuclei: 145535
% kept new demods: 11
% forw unit-subs: 385506
% forw double-subs: 25960
% forw overdouble-subs: 884
% backward subs: 41
% fast unit cutoff: 35056
% full unit cutoff: 6
% dbl unit cutoff: 528
% real runtime : 14.99
% process. runtime: 14.99
% specific non-discr-tree subsumption statistics:
% tried: 32851
% length fails: 0
% strength fails: 1662
% predlist fails: 16627
% aux str. fails: 444
% by-lit fails: 0
% full subs tried: 14118
% full subs fail: 13234
%
% ; 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-3+eq_r.in")
%
%------------------------------------------------------------------------------