TSTP Solution File: GEO089-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : GEO089-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 : art07.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 40.0s
% Output : Assurance 40.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/GEO089-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(52,40,1,104,0,1,80611,5,2502,80611,1,2502,80611,50,2502,80611,40,2502,80663,0,2502,100599,3,2953,102916,4,3178,113215,5,3403,113215,5,3403,113215,1,3403,113215,50,3404,113215,40,3404,113267,0,3404,137956,3,3855,143429,4,4080)
%
%
% START OF PROOF
% 113217 [] -incident_c(X,Y) | -part_of(Y,Z) | incident_c(X,Z).
% 113218 [] incident_c(ax0_sk1(X,Y),X) | part_of(X,Y).
% 113219 [] -incident_c(ax0_sk1(X,Y),Y) | part_of(X,Y).
% 113230 [] -end_point(X,Y) | -incident_c(X,Z) | -incident_c(X,U) | -part_of(Z,Y) | -part_of(U,Y) | part_of(Z,U) | part_of(U,Z).
% 113231 [] part_of(ax0_sk3(X,Y),X) | -incident_c(Y,X) | end_point(Y,X).
% 113232 [] part_of(ax0_sk4(X,Y),X) | -incident_c(Y,X) | end_point(Y,X).
% 113233 [] incident_c(X,ax0_sk3(Y,X)) | -incident_c(X,Y) | end_point(X,Y).
% 113234 [] incident_c(X,ax0_sk4(Y,X)) | -incident_c(X,Y) | end_point(X,Y).
% 113235 [] -part_of(ax0_sk3(X,Y),ax0_sk4(X,Y)) | -incident_c(Y,X) | end_point(Y,X).
% 113236 [] -part_of(ax0_sk4(X,Y),ax0_sk3(X,Y)) | -incident_c(Y,X) | end_point(Y,X).
% 113237 [] -inner_point(X,Y) | incident_c(X,Y).
% 113238 [] -inner_point(X,Y) | -end_point(X,Y).
% 113239 [] -incident_c(X,Y) | inner_point(X,Y) | end_point(X,Y).
% 113265 [] part_of(sk16,sk14).
% 113266 [] inner_point(sk15,sk16).
% 113267 [] -inner_point(sk15,sk14).
% 113284 [binary:113265,113217.2] -incident_c(X,sk16) | incident_c(X,sk14).
% 113290 [binary:113266,113237] incident_c(sk15,sk16).
% 113295 [binary:113217,113218] incident_c(ax0_sk1(X,Y),Z) | -part_of(X,Z) | part_of(X,Y).
% 113299 [binary:113266,113238] -end_point(sk15,sk16).
% 113324 [binary:113290,113284] incident_c(sk15,sk14).
% 113327 [binary:113219,113284.2] -incident_c(ax0_sk1(X,sk14),sk16) | part_of(X,sk14).
% 113689 [binary:113290,113231.2,cut:113299] part_of(ax0_sk3(sk16,sk15),sk16).
% 113725 [binary:113290,113232.2,cut:113299] part_of(ax0_sk4(sk16,sk15),sk16).
% 113771 [binary:113290,113233.2,cut:113299] incident_c(sk15,ax0_sk3(sk16,sk15)).
% 113829 [binary:113290,113234.2,cut:113299] incident_c(sk15,ax0_sk4(sk16,sk15)).
% 113889 [binary:113290,113235.2,cut:113299] -part_of(ax0_sk3(sk16,sk15),ax0_sk4(sk16,sk15)).
% 113955 [binary:113290,113236.2,cut:113299] -part_of(ax0_sk4(sk16,sk15),ax0_sk3(sk16,sk15)).
% 113997 [binary:113267,113239.2,cut:113324] end_point(sk15,sk14).
% 114044 [binary:113230,113997] -incident_c(sk15,X) | -incident_c(sk15,Y) | -part_of(X,sk14) | -part_of(Y,sk14) | part_of(Y,X) | part_of(X,Y).
% 116809 [binary:113295,113327] -part_of(X,sk16) | part_of(X,sk14).
% 116823 [binary:113689,116809] part_of(ax0_sk3(sk16,sk15),sk14).
% 116824 [binary:113725,116809] part_of(ax0_sk4(sk16,sk15),sk14).
% 146227 [binary:113955,114044.5,cut:116824,cut:116823,cut:113829,cut:113771,cut:113889] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using binary resolution
% not using sos strategy
% using unit paramodulation strategy
% using unit 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
%
%
% old unit clauses discarded
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 3504
% derived clauses: 484058
% kept clauses: 61042
% kept size sum: 0
% kept mid-nuclei: 78717
% kept new demods: 9
% forw unit-subs: 95228
% forw double-subs: 42454
% forw overdouble-subs: 107762
% backward subs: 161
% fast unit cutoff: 9198
% full unit cutoff: 400
% dbl unit cutoff: 748
% real runtime : 41.12
% process. runtime: 41.8
% specific non-discr-tree subsumption statistics:
% tried: 7220394
% length fails: 265888
% strength fails: 746508
% predlist fails: 2448398
% aux str. fails: 81255
% by-lit fails: 710061
% full subs tried: 2798877
% full subs fail: 2699933
%
% ; 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/GEO089-1+eq_r.in")
%
%------------------------------------------------------------------------------