TSTP Solution File: GEO030-3 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : GEO030-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 : 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/GEO030-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 3 15)
% (binary-unit 9 #f 3 15)
% (binary-double 9 #f 3 15)
% (binary-double 15 #f)
% (binary-double 15 #t)
% (binary 50 #t 3 15)
% (binary-order 25 #f 3 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(70,40,1,140,0,1)
%
%
% START OF PROOF
% 73 [] -equidistant(X,Y,V,W) | -equidistant(X,Y,Z,U) | equidistant(Z,U,V,W).
% 74 [] -equidistant(X,Y,Z,Z) | equal(X,Y).
% 75 [] between(X,Y,extension(X,Y,Z,U)).
% 76 [] equidistant(X,extension(Y,X,Z,U),Z,U).
% 77 [] -equidistant(X,Y,Z,U) | -equidistant(V,Y,W,U) | -equidistant(X,V,Z,W) | -equidistant(V,X1,W,X2) | equidistant(X1,Y,X2,U) | -between(X,V,X1) | -between(Z,W,X2) | equal(X,V).
% 91 [] equidistant(X,Y,X,Y).
% 92 [] -equidistant(X,Y,Z,U) | equidistant(Z,U,X,Y).
% 110 [] equal(X,extension(Y,Z,Z,X)) | -between(Y,Z,X) | equal(Y,Z).
% 136 [] between(u,v,w).
% 137 [] equidistant(u,w,u,w1).
% 138 [] equidistant(v,w,v,w1).
% 139 [] -equal(u,v).
% 140 [] -equal(w,w1).
% 165 [hyper:110,136,cut:139] equal(w,extension(u,v,v,w)).
% 457 [hyper:92,137] equidistant(u,w1,u,w).
% 701 [hyper:73,138,91] equidistant(v,w1,v,w).
% 3571 [hyper:77,76,75,457,701,136,cut:91,demod:165,cut:139] equidistant(w,w1,w,w).
% 4728 [hyper:74,3571,cut:140] 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 3
% seconds given: 25
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 41
% derived clauses: 10026
% kept clauses: 771
% kept size sum: 11954
% kept mid-nuclei: 3811
% kept new demods: 4
% forw unit-subs: 3221
% forw double-subs: 1952
% forw overdouble-subs: 0
% backward subs: 1
% fast unit cutoff: 1624
% full unit cutoff: 0
% dbl unit cutoff: 3
% real runtime : 0.19
% process. runtime: 0.19
% specific non-discr-tree subsumption statistics:
% tried: 1547
% length fails: 9
% strength fails: 410
% predlist fails: 686
% aux str. fails: 52
% by-lit fails: 0
% full subs tried: 390
% full subs fail: 390
%
% ; 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/GEO030-3+eq_r.in")
%
%------------------------------------------------------------------------------