TSTP Solution File: GEO010-2 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : GEO010-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 : 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 10.0s
% Output : Assurance 10.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/GEO010-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)
%
%
% SOS clause
% -colinear(a,c,b) | -colinear(b,a,c) | -colinear(b,c,a) | -colinear(c,a,b) | -colinear(c,b,a).
% was split for some strategies as:
% -colinear(a,c,b).
% -colinear(b,a,c).
% -colinear(b,c,a).
% -colinear(c,a,b).
% -colinear(c,b,a).
%
% ********* EMPTY CLAUSE DERIVED *********
%
%
% timer checkpoints: c(25,40,2,50,0,2,93974,4,990,100077,5,1203,100077,1,1203,100077,50,1203,100077,40,1203,100102,0,1203,107913,3,1404,108939,4,1504,111331,5,1604,111332,5,1604,111332,1,1604,111332,50,1604,111332,40,1604,111357,0,1604)
%
%
% START OF PROOF
% 111336 [] -equidistant(X,Y,Z,Z) | equal(X,Y).
% 111337 [] between(X,Y,extension(X,Y,Z,U)).
% 111338 [] equidistant(X,extension(Y,X,Z,U),Z,U).
% 111340 [] -between(X,Y,X) | equal(X,Y).
% 111341 [] between(X,inner_pasch(Y,X,Z,U,V),V) | -between(V,U,Z) | -between(Y,X,Z).
% 111342 [] between(X,inner_pasch(Y,Z,U,X,V),Y) | -between(V,X,U) | -between(Y,Z,U).
% 111352 [] -between(X,Y,Z) | colinear(X,Y,Z).
% 111353 [] -between(X,Y,Z) | colinear(Z,X,Y).
% 111354 [] -between(X,Y,Z) | colinear(Y,Z,X).
% 111355 [] -colinear(X,Y,Z) | between(Y,Z,X) | between(Z,X,Y) | between(X,Y,Z).
% 111356 [] colinear(a,b,c).
% 111357 [] -colinear(c,a,b) | -colinear(c,b,a) | -colinear(b,c,a) | -colinear(a,c,b) | -colinear(b,a,c).
% 111410 [binary:111336,111338] equal(X,extension(Y,X,Z,Z)).
% 111413 [para:111410.1.2,111337.1.3] between(X,Y,Y).
% 111457 [binary:111413,111341.2] between(X,inner_pasch(Y,X,Z,Z,U),U) | -between(Y,X,Z).
% 111941 [binary:111356,111355] between(c,a,b) | between(a,b,c) | between(b,c,a).
% 111946 [binary:111352,111355.2,binarycut:111354,binarycut:111353] -colinear(X,Y,Z) | colinear(Y,Z,X).
% 111959 [binary:111352,111941,binarycut:111354,binarycut:111353] colinear(c,a,b).
% 111961 [binary:111352,111941.3,binarycut:111353,binarycut:111354] colinear(b,c,a).
% 111965 [binary:111357,111959,cut:111961] -colinear(a,c,b) | -colinear(b,a,c) | -colinear(c,b,a).
% 112055 [binary:111946.2,111965] -colinear(c,b,a) | -colinear(b,a,c).
% 112065 [binary:111946.2,112055.2] -colinear(c,b,a).
% 112067 [binary:111352.2,112065] -between(c,b,a).
% 112068 [binary:111353.2,112065] -between(b,a,c).
% 112069 [binary:111354.2,112065] -between(a,c,b).
% 112345 [binary:111340,111457] equal(X,inner_pasch(Y,X,Z,Z,X)) | -between(Y,X,Z).
% 112388 [para:112345.1.2,111342.1.2,cut:111413] -between(X,Y,Z) | between(Z,Y,X).
% 112452 [binary:112067,112388.2] -between(a,b,c).
% 112453 [binary:112068,112388.2] -between(c,a,b).
% 112454 [binary:112069,112388.2] -between(b,c,a).
% 112468 [binary:111355.2,112452,cut:111959,cut:112454,cut:112453] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using binary resolution
% not 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
% clause length limited to 15
% clause depth limited to 2
% seconds given: 4
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 1402
% derived clauses: 379032
% kept clauses: 16047
% kept size sum: 626111
% kept mid-nuclei: 94971
% kept new demods: 22
% forw unit-subs: 104187
% forw double-subs: 5508
% forw overdouble-subs: 41669
% backward subs: 105
% fast unit cutoff: 35035
% full unit cutoff: 8
% dbl unit cutoff: 35
% real runtime : 16.14
% process. runtime: 16.13
% specific non-discr-tree subsumption statistics:
% tried: 9664357
% length fails: 401998
% strength fails: 1505987
% predlist fails: 2046943
% aux str. fails: 72834
% by-lit fails: 2328526
% full subs tried: 2524487
% full subs fail: 2493108
%
% ; 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/GEO010-2+eq_r.in")
%
%------------------------------------------------------------------------------