TSTP Solution File: GEO088-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : GEO088-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 : art02.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/GEO088-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(53,40,1,106,0,1,111059,5,2502,111059,1,2502,111059,50,2502,111059,40,2502,111112,0,2502,131186,3,2954,133511,4,3178,143809,5,3403,143810,1,3403,143810,50,3404,143810,40,3404,143863,0,3404,168287,3,3855,174311,4,4080)
%
%
% START OF PROOF
% 143812 [] -incident_c(X,Y) | -part_of(Y,Z) | incident_c(X,Z).
% 143813 [] incident_c(ax0_sk1(X,Y),X) | part_of(X,Y).
% 143814 [] -incident_c(ax0_sk1(X,Y),Y) | part_of(X,Y).
% 143825 [] -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).
% 143826 [] part_of(ax0_sk3(X,Y),X) | -incident_c(Y,X) | end_point(Y,X).
% 143827 [] part_of(ax0_sk4(X,Y),X) | -incident_c(Y,X) | end_point(Y,X).
% 143828 [] incident_c(X,ax0_sk3(Y,X)) | -incident_c(X,Y) | end_point(X,Y).
% 143829 [] incident_c(X,ax0_sk4(Y,X)) | -incident_c(X,Y) | end_point(X,Y).
% 143830 [] -part_of(ax0_sk3(X,Y),ax0_sk4(X,Y)) | -incident_c(Y,X) | end_point(Y,X).
% 143831 [] -part_of(ax0_sk4(X,Y),ax0_sk3(X,Y)) | -incident_c(Y,X) | end_point(Y,X).
% 143860 [] part_of(sk15,sk14).
% 143861 [] end_point(sk16,sk14).
% 143862 [] incident_c(sk16,sk15).
% 143863 [] -end_point(sk16,sk15).
% 143882 [binary:143860,143812.2] -incident_c(X,sk15) | incident_c(X,sk14).
% 143889 [binary:143812,143813] incident_c(ax0_sk1(X,Y),Z) | -part_of(X,Z) | part_of(X,Y).
% 143915 [binary:143814,143882.2] -incident_c(ax0_sk1(X,sk14),sk15) | part_of(X,sk14).
% 144180 [binary:143861,143825] -incident_c(sk16,X) | -incident_c(sk16,Y) | -part_of(X,sk14) | -part_of(Y,sk14) | part_of(Y,X) | part_of(X,Y).
% 144249 [binary:143862,143826.2,cut:143863] part_of(ax0_sk3(sk15,sk16),sk15).
% 144282 [binary:143862,143827.2,cut:143863] part_of(ax0_sk4(sk15,sk16),sk15).
% 144319 [binary:143862,143828.2,cut:143863] incident_c(sk16,ax0_sk3(sk15,sk16)).
% 144378 [binary:143862,143829.2,cut:143863] incident_c(sk16,ax0_sk4(sk15,sk16)).
% 144451 [binary:143862,143830.2,cut:143863] -part_of(ax0_sk3(sk15,sk16),ax0_sk4(sk15,sk16)).
% 144558 [binary:143862,143831.2,cut:143863] -part_of(ax0_sk4(sk15,sk16),ax0_sk3(sk15,sk16)).
% 148663 [binary:143889,143915] -part_of(X,sk15) | part_of(X,sk14).
% 148691 [binary:144249,148663] part_of(ax0_sk3(sk15,sk16),sk14).
% 148693 [binary:144282,148663] part_of(ax0_sk4(sk15,sk16),sk14).
% 175098 [binary:144558,144180.5,cut:148693,cut:148691,cut:144378,cut:144319,cut:144451] 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
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 3363
% derived clauses: 566175
% kept clauses: 70855
% kept size sum: 438282
% kept mid-nuclei: 96716
% kept new demods: 44
% forw unit-subs: 114457
% forw double-subs: 52282
% forw overdouble-subs: 107055
% backward subs: 207
% fast unit cutoff: 11058
% full unit cutoff: 41
% dbl unit cutoff: 1092
% real runtime : 41.9
% process. runtime: 41.9
% specific non-discr-tree subsumption statistics:
% tried: 8706271
% length fails: 494727
% strength fails: 1137432
% predlist fails: 3842368
% aux str. fails: 190043
% by-lit fails: 363340
% full subs tried: 2498615
% full subs fail: 2414963
%
% ; 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/GEO088-1+eq_r.in")
%
%------------------------------------------------------------------------------