TSTP Solution File: GEO025-2 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : GEO025-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 : art04.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/GEO025-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(24,40,1,48,0,1,257075,4,1879)
%
%
% START OF PROOF
% 26 [] equidistant(X,Y,Y,X).
% 27 [] -equidistant(X,Y,V,W) | -equidistant(X,Y,Z,U) | equidistant(Z,U,V,W).
% 28 [] -equidistant(X,Y,Z,Z) | equal(X,Y).
% 29 [] between(X,Y,extension(X,Y,Z,U)).
% 30 [] equidistant(X,extension(Y,X,Z,U),Z,U).
% 31 [] -equidistant(X,X1,Z,X2) | -equidistant(Y,X1,U,X2) | -equidistant(X,Y,Z,U) | -equidistant(Y,V,U,W) | equidistant(V,X1,W,X2) | -between(X,Y,V) | -between(Z,U,W) | equal(X,Y).
% 32 [] -between(X,Y,X) | equal(X,Y).
% 33 [] between(X,inner_pasch(Y,X,Z,U,V),V) | -between(V,U,Z) | -between(Y,X,Z).
% 34 [] between(X,inner_pasch(Y,Z,U,X,V),Y) | -between(V,X,U) | -between(Y,Z,U).
% 44 [] equidistant(u,v,u1,v1).
% 45 [] equidistant(v,w,v1,w1).
% 46 [] between(u,v,w).
% 47 [] between(u1,v1,w1).
% 48 [] -equidistant(u,w,u1,w1).
% 100 [hyper:27,26,44] equidistant(u1,v1,v,u).
% 101 [hyper:27,26,26] equidistant(X,Y,X,Y).
% 236 [hyper:27,45,26] equidistant(w,v,v1,w1).
% 238 [hyper:27,45,26] equidistant(v1,w1,w,v).
% 239 [hyper:27,45,101] equidistant(v1,w1,v,w).
% 296 [hyper:27,100,26] equidistant(v,u,v1,u1).
% 882 [hyper:27,30,26] equidistant(X,Y,extension(Z,U,X,Y),U).
% 883 [hyper:27,30,101] equidistant(X,Y,Z,extension(U,Z,X,Y)).
% 884 [hyper:28,30] equal(X,extension(Y,X,Z,Z)).
% 1410 [para:884.1.2,29.1.3] between(X,Y,Y).
% 1411 [para:884.1.2,30.1.2] equidistant(X,X,Y,Y).
% 1685 [hyper:33,1410,47] between(v1,inner_pasch(u1,v1,w1,w1,X),X).
% 1692 [hyper:34,1410,47] between(w1,inner_pasch(u1,v1,w1,w1,X),u1).
% 1923 [hyper:31,1411,47,46,cut:45,cut:296,cut:44] equidistant(w,u,w1,u1) | equal(u,v).
% 2703 [hyper:27,1923,26] equidistant(w1,u1,u,w) | equal(u,v).
% 8638 [hyper:27,2703,26,cut:48] equal(u,v).
% 8647 [para:8638.1.2,44.1.2] equidistant(u,u,u1,v1).
% 8652 [para:8638.1.2,239.1.3] equidistant(v1,w1,u,w).
% 8766 [hyper:27,8647,1411] equidistant(u1,v1,X,X).
% 19140 [hyper:27,882,238] equidistant(w,v,extension(X,Y,v1,w1),Y).
% 19189 [hyper:27,882,8766] equidistant(extension(X,Y,u1,v1),Y,Z,Z).
% 19573 [hyper:27,883,26] equidistant(X,extension(Y,X,Z,U),U,Z).
% 35020 [hyper:28,19189] equal(extension(X,Y,u1,v1),Y).
% 132362 [hyper:32,1685] equal(v1,inner_pasch(u1,v1,w1,w1,v1)).
% 183650 [para:132362.1.2,1692.1.2] between(w1,v1,u1).
% 184936 [hyper:31,183650,19573,101,101,demod:35020,cut:1410,cut:101] equal(w1,v1) | equidistant(v1,X,u1,X).
% 193573 [hyper:27,184936,8652,cut:48] equal(w1,v1).
% 193584 [para:193573.1.1,19140.1.3.4,demod:884] equidistant(w,v,X,X).
% 193597 [hyper:27,193584,236] equidistant(v1,w1,X,X).
% 193620 [hyper:28,193584] equal(w,v).
% 196613 [para:193620.1.2,44.1.2] equidistant(u,w,u1,v1).
% 200124 [hyper:28,193597] equal(v1,w1).
% 257190 [para:200124.1.2,48.1.4,cut:196613] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using binary resolution
% not using sos 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: 236
% derived clauses: 1046991
% kept clauses: 1594
% kept size sum: 16027
% kept mid-nuclei: 255415
% kept new demods: 39
% forw unit-subs: 540342
% forw double-subs: 32281
% forw overdouble-subs: 91
% backward subs: 50
% fast unit cutoff: 83125
% full unit cutoff: 0
% dbl unit cutoff: 97
% real runtime : 18.84
% process. runtime: 18.79
% specific non-discr-tree subsumption statistics:
% tried: 12040
% length fails: 80
% strength fails: 5684
% predlist fails: 1547
% aux str. fails: 1370
% by-lit fails: 0
% full subs tried: 3279
% full subs fail: 3268
%
% ; 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/GEO025-2+eq_r.in")
%
%------------------------------------------------------------------------------