TSTP Solution File: GEO060-2 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : GEO060-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 20.0s
% Output : Assurance 20.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/GEO060-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 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(21,40,0,42,0,0,186092,4,1881)
%
%
% START OF PROOF
% 23 [] equidistant(X,Y,Y,X).
% 24 [] -equidistant(X,Y,V,W) | -equidistant(X,Y,Z,U) | equidistant(Z,U,V,W).
% 25 [] -equidistant(X,Y,Z,Z) | equal(X,Y).
% 26 [] between(X,Y,extension(X,Y,Z,U)).
% 27 [] equidistant(X,extension(Y,X,Z,U),Z,U).
% 28 [] -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).
% 29 [] -between(X,Y,X) | equal(X,Y).
% 30 [] between(X,inner_pasch(Y,X,Z,U,V),V) | -between(V,U,Z) | -between(Y,X,Z).
% 31 [] between(X,inner_pasch(Y,Z,U,X,V),Y) | -between(V,X,U) | -between(Y,Z,U).
% 39 [] between(X,continuous(Y,Z,X,U,V,W),W) | -equidistant(Y,Z,Y,X) | -equidistant(Y,V,Y,W) | -between(Z,U,V) | -between(Y,Z,V).
% 40 [] equidistant(X,Y,X,continuous(X,Z,U,Y,V,W)) | -equidistant(X,Z,X,U) | -equidistant(X,V,X,W) | -between(Z,Y,V) | -between(X,Z,V).
% 41 [] equal(reflection(X,Y),extension(X,Y,X,Y)).
% 42 [] -equal(u,reflection(reflection(u,v),v)).
% 44 [hyper:24,23,23] equidistant(X,Y,X,Y).
% 211 [hyper:24,27,44] equidistant(X,Y,Z,extension(U,Z,X,Y)).
% 212 [hyper:25,27] equal(X,extension(Y,X,Z,Z)).
% 387 [para:212.1.2,26.1.3] between(X,Y,Y).
% 388 [para:212.1.2,27.1.2] equidistant(X,X,Y,Y).
% 427 [hyper:30,387,387] between(X,inner_pasch(Y,X,X,X,Z),Z).
% 432 [hyper:31,387,387] between(X,inner_pasch(Y,X,X,X,Z),Y).
% 468 [hyper:39,387,387,44,44] between(X,continuous(Y,X,X,X,X,X),X).
% 831 [para:41.1.2,26.1.3] between(X,Y,reflection(X,Y)).
% 832 [para:41.1.2,27.1.2] equidistant(X,reflection(Y,X),Y,X).
% 833 [para:41.1.2,212.1.2] equal(X,reflection(X,X)).
% 1903 [hyper:24,832,23] equidistant(reflection(X,Y),Y,X,Y).
% 1906 [hyper:24,832,44] equidistant(X,Y,Y,reflection(X,Y)).
% 2978 [hyper:24,1906,23] equidistant(X,Y,X,reflection(Y,X)).
% 2983 [hyper:24,1906,23] equidistant(X,reflection(Y,X),X,Y).
% 4931 [hyper:28,2983,831,1903,23,cut:831,cut:2978] equidistant(reflection(reflection(X,Y),Y),X,reflection(X,Y),reflection(X,Y)) | equal(reflection(X,Y),Y).
% 11113 [hyper:29,427] equal(X,inner_pasch(Y,X,X,X,X)).
% 15609 [para:11113.1.2,432.1.2] between(X,X,Y).
% 16250 [hyper:40,15609,211,387,44,demod:212] equidistant(X,Y,X,continuous(X,X,X,Y,Y,Y)).
% 67868 [hyper:29,468] equal(X,continuous(Y,X,X,X,X,X)).
% 163945 [hyper:24,16250,2983] equidistant(X,continuous(X,X,X,reflection(Y,X),reflection(Y,X),reflection(Y,X)),X,Y).
% 187653 [binary:25.2,42] -equidistant(u,reflection(reflection(u,v),v),X,X).
% 188245 [binary:24.3,187653] -equidistant(X,Y,u,reflection(reflection(u,v),v)) | -equidistant(X,Y,Z,Z).
% 191277 [binary:23,188245] -equidistant(reflection(reflection(u,v),v),u,X,X).
% 193463 [binary:4931,191277] equal(reflection(u,v),v).
% 195714 [binary:24.3,191277,demod:833,193463] -equidistant(X,Y,v,u) | -equidistant(X,Y,Z,Z).
% 195718 [binary:163945,195714,demod:67868,193463,cut:388] 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 3
% seconds given: 25
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 179
% derived clauses: 1124084
% kept clauses: 5487
% kept size sum: 150179
% kept mid-nuclei: 190025
% kept new demods: 19
% forw unit-subs: 350188
% forw double-subs: 22762
% forw overdouble-subs: 962
% backward subs: 17
% fast unit cutoff: 27855
% full unit cutoff: 4
% dbl unit cutoff: 132
% real runtime : 20.0
% process. runtime: 19.98
% specific non-discr-tree subsumption statistics:
% tried: 29575
% length fails: 2419
% strength fails: 2961
% predlist fails: 7397
% aux str. fails: 2602
% by-lit fails: 1447
% full subs tried: 12748
% full subs fail: 11778
%
% ; 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/GEO060-2+eq_r.in")
%
%------------------------------------------------------------------------------