TSTP Solution File: GEO059-3 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : GEO059-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 : 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/GEO059-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(43,40,1,86,0,2)
%
%
% START OF PROOF
% 46 [] -equidistant(X,Y,V,W) | -equidistant(X,Y,Z,U) | equidistant(Z,U,V,W).
% 64 [] equidistant(X,Y,X,Y).
% 68 [] -equidistant(X,Y,Z,U) | equidistant(Y,X,U,Z).
% 76 [] equidistant(X,reflection(Y,X),Y,X).
% 86 [] -equidistant(v,u,v,reflection(reflection(u,v),v)).
% 619 [hyper:46,76,64] equidistant(X,Y,Y,reflection(X,Y)).
% 740 [hyper:68,76] equidistant(reflection(X,Y),Y,Y,X).
% 1280 [hyper:46,740,619,slowcut: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 3
% seconds given: 25
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 22
% derived clauses: 2681
% kept clauses: 82
% kept size sum: 1095
% kept mid-nuclei: 1107
% kept new demods: 2
% forw unit-subs: 1223
% forw double-subs: 105
% forw overdouble-subs: 0
% backward subs: 2
% fast unit cutoff: 226
% full unit cutoff: 0
% dbl unit cutoff: 0
% real runtime : 0.7
% process. runtime: 0.7
% specific non-discr-tree subsumption statistics:
% tried: 441
% length fails: 0
% strength fails: 91
% predlist fails: 160
% aux str. fails: 28
% by-lit fails: 0
% full subs tried: 162
% full subs fail: 162
%
% ; 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/GEO059-3+eq_r.in")
%
%------------------------------------------------------------------------------