TSTP Solution File: GEO032-3 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : GEO032-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 : art08.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/GEO032-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(72,40,0,144,0,0)
%
%
% START OF PROOF
% 109 [] equidistant(X,X,Y,Y).
% 139 [] -equidistant(X,Y,Z,U) | -equidistant(V,X,W,Z) | -equidistant(V,Y,W,U) | -equidistant(V,X1,W,X2) | equidistant(X1,Y,X2,U) | -between(W,X2,Z) | -between(V,X1,X).
% 140 [] between(u,v,w).
% 141 [] between(u1,v1,w1).
% 142 [] equidistant(u,v,u1,v1).
% 143 [] equidistant(u,w,u1,w1).
% 144 [] -equidistant(v,w,v1,w1).
% 1004 [hyper:139,143,143,142,cut:109,cut:141,cut:140] equidistant(v,w,v1,w1).
% 3116 [hyper:144,1004] 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: 38
% derived clauses: 4971
% kept clauses: 324
% kept size sum: 5075
% kept mid-nuclei: 2640
% kept new demods: 3
% forw unit-subs: 1606
% forw double-subs: 220
% forw overdouble-subs: 0
% backward subs: 1
% fast unit cutoff: 496
% full unit cutoff: 0
% dbl unit cutoff: 5
% real runtime : 0.12
% process. runtime: 0.12
% specific non-discr-tree subsumption statistics:
% tried: 1930
% length fails: 65
% strength fails: 1114
% predlist fails: 207
% aux str. fails: 20
% by-lit fails: 0
% full subs tried: 524
% full subs fail: 524
%
% ; 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/GEO032-3+eq_r.in")
%
%------------------------------------------------------------------------------