TSTP Solution File: GEO002-2 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : GEO002-2 : 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 : art07.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/GEO002-2+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(20,40,0,40,0,0)
%
%
% START OF PROOF
% 24 [] -equidistant(X,Y,Z,Z) | equal(X,Y).
% 25 [] between(X,Y,extension(X,Y,Z,U)).
% 26 [] equidistant(X,extension(Y,X,Z,U),Z,U).
% 28 [] -between(X,Y,X) | equal(X,Y).
% 29 [] between(X,inner_pasch(Y,X,Z,U,V),V) | -between(V,U,Z) | -between(Y,X,Z).
% 30 [] between(X,inner_pasch(Y,Z,U,X,V),Y) | -between(V,X,U) | -between(Y,Z,U).
% 40 [] -between(a,a,b).
% 162 [hyper:24,26] equal(X,extension(Y,X,Z,Z)).
% 253 [para:162.1.2,25.1.3] between(X,Y,Y).
% 291 [hyper:29,253,253] between(X,inner_pasch(Y,X,X,X,Z),Z).
% 294 [hyper:30,253,253] between(X,inner_pasch(Y,X,X,X,Z),Y).
% 1757 [hyper:28,291] equal(X,inner_pasch(Y,X,X,X,X)).
% 1871 [para:1757.1.2,294.1.2,slowcut:40] 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: 22
% derived clauses: 5175
% kept clauses: 27
% kept size sum: 264
% kept mid-nuclei: 1798
% kept new demods: 3
% forw unit-subs: 1982
% forw double-subs: 11
% forw overdouble-subs: 0
% backward subs: 0
% fast unit cutoff: 465
% full unit cutoff: 0
% dbl unit cutoff: 0
% real runtime : 0.11
% process. runtime: 0.11
% specific non-discr-tree subsumption statistics:
% tried: 370
% length fails: 0
% strength fails: 61
% predlist fails: 115
% aux str. fails: 55
% by-lit fails: 0
% full subs tried: 139
% full subs fail: 139
%
% ; 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/GEO002-2+eq_r.in")
%
%------------------------------------------------------------------------------