TSTP Solution File: GEO068-3 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : GEO068-3 : TPTP v3.4.2. Bugfixed v1.2.1.
% Transfm : add_equality:r
% Format : otter:hypothesis:set(auto),clear(print_given)
% Command : gandalf-wrapper -time %d %s
% Computer : art01.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 79.5s
% Output : Assurance 79.5s
% 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/GEO068-3+eq_r.in
% Using automatic strategy selection.
% Time limit in seconds: 600
%
% prove-all-passes started
%
% detected problem class: neq
% detected subclass: big
%
% strategies selected:
% (hyper 28 #f 3 15)
% (binary-unit 28 #f 3 15)
% (binary-double 11 #f 3 15)
% (binary-double 17 #f)
% (binary-double 17 #t)
% (binary 87 #t 3 15)
% (binary-order 28 #f 3 15)
% (binary-posweight-order 58 #f)
% (binary-posweight-lex-big-order 28 #f)
% (binary-posweight-lex-small-order 11 #f)
% (binary-order-sos 28 #t)
% (binary-unit-uniteq 28 #f)
% (binary-weightorder 28 #f)
% (binary-weightorder-sos 17 #f)
% (binary-order 28 #f)
% (hyper-order 17 #f)
% (binary 141 #t)
%
%
% ********* EMPTY CLAUSE DERIVED *********
%
%
% timer checkpoints: c(106,40,0,212,0,0,273893,4,2154,342974,5,2801,342975,1,2801,342975,50,2801,342975,40,2801,343081,0,2805,392392,3,4206,398180,4,4907,460889,5,5606,460890,5,5607,460890,1,5607,460890,50,5610,460890,40,5610,460996,0,5610,486169,3,6161,494006,4,6478,502722,5,6723,502723,5,6724,502723,1,6724,502723,50,6725,502723,40,6725,502829,0,6726,533071,3,7577,541064,4,8016,554183,5,8427,554184,5,8427,554185,1,8427,554185,50,8429,554185,40,8429,554291,0,8429)
%
%
% START OF PROOF
% 554205 [] -between(X,Y,Z) | colinear(X,Y,Z).
% 554207 [] -between(X,Y,Z) | colinear(Y,Z,X).
% 554208 [] -colinear(X,Y,Z) | between(Y,Z,X) | between(Z,X,Y) | between(X,Y,Z).
% 554215 [] -equidistant(X,Y,Z,U) | equidistant(Y,X,U,Z).
% 554237 [] -between(X,Y,Z) | between(Z,Y,X).
% 554266 [] -equidistant(X,Y,Z,U) | -equidistant(X,V,Z,W) | -equidistant(V,Y,W,U) | -between(X,V,Y) | between(Z,W,U).
% 554275 [] -between(X,Y,Z) | colinear(X,Z,Y).
% 554280 [] -colinear(X,Y,Z) | colinear(Z,X,Y).
% 554287 [] equidistant(u,v,u1,v1).
% 554288 [] equidistant(v,w,v1,w1).
% 554289 [] equidistant(u,w,u1,w1).
% 554290 [] colinear(u,v,w).
% 554291 [] -colinear(u1,v1,w1).
% 554296 [binary:554280,554290] colinear(w,u,v).
% 554298 [binary:554205.2,554291] -between(u1,v1,w1).
% 554300 [binary:554207.2,554291] -between(w1,u1,v1).
% 554302 [binary:554275.2,554291] -between(u1,w1,v1).
% 554366 [binary:554266,554287] -equidistant(u,X,u1,Y) | -equidistant(X,v,Y,v1) | -between(u,X,v) | between(u1,Y,v1).
% 554367 [binary:554266.2,554287] -equidistant(u,X,u1,Y) | -equidistant(v,X,v1,Y) | -between(u,v,X) | between(u1,v1,Y).
% 554368 [binary:554266.3,554287] -equidistant(X,u,Y,u1) | -equidistant(X,v,Y,v1) | -between(X,u,v) | between(Y,u1,v1).
% 554407 [binary:554215,554288] equidistant(w,v,w1,v1).
% 554483 [binary:554215,554289] equidistant(w,u,w1,u1).
% 561528 [binary:554289,554366,cut:554407,cut:554302] -between(u,w,v).
% 561535 [binary:554237.2,561528] -between(v,w,u).
% 561681 [binary:554288,554367.2,cut:554289,cut:554298] -between(u,v,w).
% 561703 [binary:554208.2,561681,cut:554296,cut:561535] between(w,u,v).
% 561890 [binary:554407,554368.2,cut:554483,cut:561703,cut:554300] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using binary resolution
% using sos strategy
% using double strategy
% using dynamic demodulation
% using ordered paramodulation
% using kb ordering for equality
% preferring bigger arities for lex ordering
% using clause demodulation
% seconds given: 17
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 3895
% derived clauses: 936508
% kept clauses: 140558
% kept size sum: 152767
% kept mid-nuclei: 415518
% kept new demods: 727
% forw unit-subs: 224224
% forw double-subs: 40298
% forw overdouble-subs: 62936
% backward subs: 49
% fast unit cutoff: 77101
% full unit cutoff: 131
% dbl unit cutoff: 712
% real runtime : 85.65
% process. runtime: 85.6
% specific non-discr-tree subsumption statistics:
% tried: 32778946
% length fails: 1666110
% strength fails: 8978859
% predlist fails: 14122848
% aux str. fails: 756825
% by-lit fails: 2432508
% full subs tried: 4716280
% full subs fail: 4683680
%
% ; 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/GEO068-3+eq_r.in")
%
%------------------------------------------------------------------------------