TSTP Solution File: GEO042-2 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : GEO042-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 : art10.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/GEO042-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(22,40,1,44,0,1)
%
%
% START OF PROOF
% 26 [] -equidistant(X,Y,Z,Z) | equal(X,Y).
% 27 [] between(X,Y,extension(X,Y,Z,U)).
% 28 [] equidistant(X,extension(Y,X,Z,U),Z,U).
% 30 [] -between(X,Y,X) | equal(X,Y).
% 31 [] between(X,inner_pasch(Y,X,Z,U,V),V) | -between(V,U,Z) | -between(Y,X,Z).
% 32 [] between(X,inner_pasch(Y,Z,U,X,V),Y) | -between(V,X,U) | -between(Y,Z,U).
% 42 [] between(u,v,x).
% 43 [] between(v,w,x).
% 44 [] -between(u,v,w).
% 68 [hyper:31,43,42] between(v,inner_pasch(u,v,x,w,v),v).
% 73 [hyper:32,43,42] between(w,inner_pasch(u,v,x,w,v),u).
% 223 [hyper:26,28] equal(X,extension(Y,X,Z,Z)).
% 288 [para:223.1.2,27.1.3] between(X,Y,Y).
% 5284 [hyper:30,68] equal(v,inner_pasch(u,v,x,w,v)).
% 7123 [hyper:31,73,288,demod:5284] between(u,inner_pasch(X,u,u,v,w),w).
% 7132 [hyper:32,73,288,demod:5284] between(v,inner_pasch(X,u,u,v,w),X).
% 9233 [hyper:30,7132] equal(v,inner_pasch(v,u,u,v,w)).
% 9777 [para:9233.1.2,7123.1.2,cut:44] 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: 133
% derived clauses: 30408
% kept clauses: 309
% kept size sum: 3418
% kept mid-nuclei: 9391
% kept new demods: 38
% forw unit-subs: 9795
% forw double-subs: 970
% forw overdouble-subs: 0
% backward subs: 2
% fast unit cutoff: 1904
% full unit cutoff: 0
% dbl unit cutoff: 16
% real runtime : 0.53
% process. runtime: 0.53
% specific non-discr-tree subsumption statistics:
% tried: 4073
% length fails: 0
% strength fails: 671
% predlist fails: 1740
% aux str. fails: 217
% by-lit fails: 0
% full subs tried: 1445
% full subs fail: 1445
%
% ; 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/GEO042-2+eq_r.in")
%
%------------------------------------------------------------------------------