TSTP Solution File: GEO126-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : GEO126-1 : TPTP v3.4.2. Released v2.4.0.
% Transfm : add_equality:r
% Format : otter:hypothesis:set(auto),clear(print_given)
% Command : gandalf-wrapper -time %d %s
% Computer : art03.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 29.9s
% Output : Assurance 29.9s
% 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/GEO126-1+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 23)
% (binary-unit 9 #f 3 23)
% (binary-double 9 #f 3 23)
% (binary-double 15 #f)
% (binary-double 15 #t)
% (binary 50 #t 3 23)
% (binary-order 25 #f 3 23)
% (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(98,40,0,196,0,0,75481,4,2060,116227,5,2501,116228,1,2501,116228,50,2502,116228,40,2502,116326,0,2502,129120,3,2953,130222,4,3178,131410,5,3403,131410,1,3403,131410,50,3403,131410,40,3403,131508,0,3403)
%
%
% START OF PROOF
% 131424 [] -end_point(X,Y) | incident_c(X,Y).
% 131432 [] -inner_point(X,Y) | incident_c(X,Y).
% 131433 [] -inner_point(X,Y) | -end_point(X,Y).
% 131442 [] -end_point(X,Y) | -closed(Y).
% 131443 [] end_point(ax0_sk6(X),X) | closed(X).
% 131444 [] end_point(ax0_sk7(X),X) | -open(X).
% 131448 [] inner_point(ax0_sk8(X),X).
% 131473 [] ordered_by(X,Y,Z) | -incident_o(Z,X) | -start_point(Y,X) | equal(Y,Z).
% 131484 [] open(ax2_sk3(X)).
% 131486 [] -incident_c(X,ax2_sk3(Y)) | incident_o(X,Y).
% 131494 [] start_point(ax2_sk6(X),X).
% 131508 [] -ordered_by(sk25,X,Y) | equal(X,Y).
% 131540 [binary:131448,131432] incident_c(ax0_sk8(X),X).
% 131544 [binary:131448,131433] -end_point(ax0_sk8(X),X).
% 131551 [binary:131424,131443] incident_c(ax0_sk6(X),X) | closed(X).
% 131556 [binary:131442,131444] -open(X) | -closed(X).
% 131562 [binary:131484,131556] -closed(ax2_sk3(X)).
% 131724 [binary:131540,131486] incident_o(ax0_sk8(ax2_sk3(X)),X).
% 131726 [binary:131551,131486,cut:131562] incident_o(ax0_sk6(ax2_sk3(X)),X).
% 135142 [binary:131508,131473] -incident_o(X,sk25) | -start_point(Y,sk25) | equal(Y,X).
% 137097 [binary:131494,135142.2] equal(ax2_sk6(sk25),X) | -incident_o(X,sk25).
% 137195 [binary:131724,137097.2] equal(ax2_sk6(sk25),ax0_sk8(ax2_sk3(sk25))).
% 137196 [binary:131726,137097.2] equal(ax2_sk6(sk25),ax0_sk6(ax2_sk3(sk25))).
% 137258 [para:137195.1.2,131544.1.1] -end_point(ax2_sk6(sk25),ax2_sk3(sk25)).
% 137494 [para:137196.1.2,131443.1.1,cut:137258,cut:131562] 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 23
% clause depth limited to 3
% seconds given: 9
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 5297
% derived clauses: 672992
% kept clauses: 61955
% kept size sum: 327651
% kept mid-nuclei: 25621
% kept new demods: 9
% forw unit-subs: 38170
% forw double-subs: 30624
% forw overdouble-subs: 71130
% backward subs: 79
% fast unit cutoff: 777
% full unit cutoff: 109
% dbl unit cutoff: 176
% real runtime : 34.53
% process. runtime: 34.43
% specific non-discr-tree subsumption statistics:
% tried: 4071586
% length fails: 90066
% strength fails: 775195
% predlist fails: 795235
% aux str. fails: 17225
% by-lit fails: 6903
% full subs tried: 2380436
% full subs fail: 2279346
%
% ; 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/GEO126-1+eq_r.in")
%
%------------------------------------------------------------------------------