TSTP Solution File: GEO127-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : GEO127-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 : art06.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 19.5s
% Output : Assurance 19.5s
% 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/GEO127-1+eq_r.in
% Using automatic strategy selection.
% Time limit in seconds: 600
%
% prove-all-passes started
%
% detected problem class: neq
% detected subclass: big
%
% strategies selected:
% (hyper 28 #f 3 23)
% (binary-unit 28 #f 3 23)
% (binary-double 11 #f 3 23)
% (binary-double 17 #f)
% (binary-double 17 #t)
% (binary 87 #t 3 23)
% (binary-order 28 #f 3 23)
% (binary-posweight-order 58 #f)
% (binary-posweight-lex-big-order 28 #f)
% (binary-posweight-lex-small-order 11 #f)
% (binary-order-sos 28 #t)
% (binary-unit-uniteq 28 #f)
% (binary-weightorder 28 #f)
% (binary-weightorder-sos 17 #f)
% (binary-order 28 #f)
% (hyper-order 17 #f)
% (binary 141 #t)
%
%
% ********* EMPTY CLAUSE DERIVED *********
%
%
% timer checkpoints: c(103,40,1,206,0,1,89970,4,2303,138466,5,2815,138467,1,2815,138467,50,2816,138467,40,2816,138570,0,2817)
%
%
% START OF PROOF
% 138481 [] -end_point(X,Y) | incident_c(X,Y).
% 138489 [] -inner_point(X,Y) | incident_c(X,Y).
% 138490 [] -inner_point(X,Y) | -end_point(X,Y).
% 138501 [] end_point(ax0_sk7(X),X) | -open(X).
% 138505 [] inner_point(ax0_sk8(X),X).
% 138530 [] ordered_by(X,Y,Z) | -incident_o(Z,X) | -start_point(Y,X) | equal(Y,Z).
% 138539 [] -ordered_by(X,Y,Z) | incident_o(Y,X).
% 138540 [] -ordered_by(X,Y,Z) | incident_o(Z,X).
% 138541 [] open(ax2_sk3(X)).
% 138543 [] -incident_c(X,ax2_sk3(Y)) | incident_o(X,Y).
% 138551 [] start_point(ax2_sk6(X),X).
% 138565 [?] ?
% 138566 [] -incident_o(sk26,sk25) | incident_o(sk26,sk25).
% 138567 [] ordered_by(sk25,sk26,sk27) | ordered_by(sk25,sk27,sk26) | -ordered_by(sk25,sk26,X).
% 138568 [] ordered_by(sk25,sk26,sk27) | ordered_by(sk25,sk27,sk26) | -ordered_by(sk25,X,sk26).
% 138569 [?] ?
% 138570 [?] ?
% 138598 [input:138565,binarycut:138540,binarycut:138539] incident_o(sk26,sk25).
% 138602 [binary:138505,138489] incident_c(ax0_sk8(X),X).
% 138603 [binary:138598,138566] incident_o(sk26,sk25).
% 138606 [binary:138505,138490] -end_point(ax0_sk8(X),X).
% 138610 [binary:138541,138501.2] end_point(ax0_sk7(ax2_sk3(X)),ax2_sk3(X)).
% 138613 [input:138569,cut:138603] -ordered_by(sk25,sk26,X).
% 138614 [binary:138567,138613] ordered_by(sk25,sk27,sk26) | -ordered_by(sk25,sk26,X).
% 138615 [binary:138568,138613] ordered_by(sk25,sk27,sk26) | -ordered_by(sk25,X,sk26).
% 138617 [input:138570,cut:138603] -ordered_by(sk25,X,sk26).
% 138619 [binary:138481,138610] incident_c(ax0_sk7(ax2_sk3(X)),ax2_sk3(X)).
% 138629 [binary:138617,138614] -ordered_by(sk25,sk26,X).
% 138651 [binary:138602,138543] incident_o(ax0_sk8(ax2_sk3(X)),X).
% 138652 [binary:138619,138543] incident_o(ax0_sk7(ax2_sk3(X)),X).
% 138673 [binary:138617,138615] -ordered_by(sk25,X,sk26).
% 139735 [binary:138603,138530.2,cut:138673] -start_point(X,sk25) | equal(X,sk26).
% 139745 [binary:138551,139735] equal(ax2_sk6(sk25),sk26).
% 139769 [para:139745.1.1,138551.1.1] start_point(sk26,sk25).
% 139770 [binary:138530.3,139769,cut:138629] -incident_o(X,sk25) | equal(sk26,X).
% 139774 [binary:138651,139770] equal(sk26,ax0_sk8(ax2_sk3(sk25))).
% 139775 [binary:138652,139770] equal(sk26,ax0_sk7(ax2_sk3(sk25))).
% 139800 [para:139774.1.2,138606.1.1] -end_point(sk26,ax2_sk3(sk25)).
% 139825 [para:139775.1.2,138501.1.1,cut:139800,cut:138541] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using binary resolution
% not using sos strategy
% using unit 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: 28
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 463
% derived clauses: 658086
% kept clauses: 51014
% kept size sum: 16205
% kept mid-nuclei: 37971
% kept new demods: 13
% forw unit-subs: 60397
% forw double-subs: 29959
% forw overdouble-subs: 64949
% backward subs: 37
% fast unit cutoff: 1300
% full unit cutoff: 152
% dbl unit cutoff: 170
% real runtime : 28.73
% process. runtime: 28.21
% specific non-discr-tree subsumption statistics:
% tried: 4231847
% length fails: 124396
% strength fails: 892430
% predlist fails: 808199
% aux str. fails: 47095
% by-lit fails: 12100
% full subs tried: 2335653
% full subs fail: 2243493
%
% ; 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/GEO127-1+eq_r.in")
%
%------------------------------------------------------------------------------