TSTP Solution File: GEO083-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : GEO083-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 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/GEO083-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,0,106,0,1,101444,4,1890,153126,5,2502,153126,1,2502,153126,50,2503,153126,40,2503,153179,0,2503)
%
%
% START OF PROOF
% 153127 [] equal(X,X).
% 153128 [] -incident_c(X,Y) | -part_of(Y,Z) | incident_c(X,Z).
% 153129 [] incident_c(ax0_sk1(X,Y),X) | part_of(X,Y).
% 153130 [] -incident_c(ax0_sk1(X,Y),Y) | part_of(X,Y).
% 153131 [] -equal(X,sum(Y,Z)) | -incident_c(U,X) | incident_c(U,Y) | incident_c(U,Z).
% 153132 [] -equal(X,sum(Y,Z)) | -incident_c(U,Y) | incident_c(U,X).
% 153133 [] -equal(X,sum(Y,Z)) | -incident_c(U,Z) | incident_c(U,X).
% 153176 [] part_of(sk15,sk16).
% 153179 [] -part_of(sum(sk14,sk15),sum(sk14,sk16)).
% 153203 [binary:153176,153128.2] -incident_c(X,sk15) | incident_c(X,sk16).
% 153210 [binary:153179,153129.2] incident_c(ax0_sk1(sum(sk14,sk15),sum(sk14,sk16)),sum(sk14,sk15)).
% 153219 [binary:153179,153130.2] -incident_c(ax0_sk1(sum(sk14,sk15),sum(sk14,sk16)),sum(sk14,sk16)).
% 153228 [binary:153127,153131] -incident_c(X,sum(Y,Z)) | incident_c(X,Y) | incident_c(X,Z).
% 153243 [binary:153127,153132] incident_c(X,sum(Y,Z)) | -incident_c(X,Y).
% 153256 [binary:153127,153133] incident_c(X,sum(Y,Z)) | -incident_c(X,Z).
% 155397 [binary:153243,153219] -incident_c(ax0_sk1(sum(sk14,sk15),sum(sk14,sk16)),sk14).
% 155398 [binary:153256,153219] -incident_c(ax0_sk1(sum(sk14,sk15),sum(sk14,sk16)),sk16).
% 155449 [binary:153210,153228,cut:155397] incident_c(ax0_sk1(sum(sk14,sk15),sum(sk14,sk16)),sk15).
% 167717 [binary:153203.2,155398,cut:155449] 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: 9
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 2221
% derived clauses: 499814
% kept clauses: 71784
% kept size sum: 249857
% kept mid-nuclei: 77773
% kept new demods: 8
% forw unit-subs: 57490
% forw double-subs: 43496
% forw overdouble-subs: 136018
% backward subs: 96
% fast unit cutoff: 51011
% full unit cutoff: 2952
% dbl unit cutoff: 308
% real runtime : 29.67
% process. runtime: 29.32
% specific non-discr-tree subsumption statistics:
% tried: 9938129
% length fails: 711433
% strength fails: 1343320
% predlist fails: 4439733
% aux str. fails: 89958
% by-lit fails: 355678
% full subs tried: 2713001
% full subs fail: 2630391
%
% ; 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/GEO083-1+eq_r.in")
%
%------------------------------------------------------------------------------