TSTP Solution File: SWC037-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SWC037-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 : art04.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/SWC/SWC037-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 5 19)
% (binary-unit 28 #f 5 19)
% (binary-double 11 #f 5 19)
% (binary-double 17 #f)
% (binary-double 17 #t)
% (binary 87 #t 5 19)
% (binary-order 28 #f 5 19)
% (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(202,40,2,404,0,2,65013,4,2293,79571,5,2803,79572,1,2804,79572,50,2808,79572,40,2808,79774,0,2808)
%
%
% START OF PROOF
% 79573 [] equal(X,X).
% 79581 [] ss^list(nil).
% 79653 [] -segment^p(nil,X) | equal(nil,X) | -ss^list(X).
% 79688 [] -neq(X,Y) | -equal(X,Y) | -ss^list(Y) | -ss^list(X).
% 79763 [] equal(nil,sk2).
% 79764 [] equal(sk2,sk4).
% 79765 [] equal(sk1,sk3).
% 79766 [] -equal(nil,sk1).
% 79768 [] equal(nil,sk3) | ss^list(sk5).
% 79772 [] neq(sk5,nil) | equal(nil,sk3).
% 79773 [] segment^p(sk4,sk5) | equal(nil,sk3).
% 80106 [para:79765.1.2,79768.1.2,cut:79766] ss^list(sk5).
% 80117 [para:79765.1.2,79772.2.2,cut:79766] neq(sk5,nil).
% 80121 [para:79765.1.2,79773.2.2,cut:79766] segment^p(sk4,sk5).
% 80126 [para:79764.1.2,80121.1.1] segment^p(sk2,sk5).
% 80128 [para:79763.1.2,80126.1.1] segment^p(nil,sk5).
% 80692 [binary:80106,79653.3,cut:80128] equal(nil,sk5).
% 80793 [para:80692.1.2,80117.1.1] neq(nil,nil).
% 83115 [binary:80793,79688,cut:79573,cut:79581] 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 19
% clause depth limited to 5
% seconds given: 28
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 471
% derived clauses: 117296
% kept clauses: 59660
% kept size sum: 845171
% kept mid-nuclei: 16165
% kept new demods: 28791
% forw unit-subs: 10698
% forw double-subs: 17712
% forw overdouble-subs: 725
% backward subs: 26
% fast unit cutoff: 1624
% full unit cutoff: 0
% dbl unit cutoff: 79
% real runtime : 28.21
% process. runtime: 28.19
% specific non-discr-tree subsumption statistics:
% tried: 1190409
% length fails: 250883
% strength fails: 120815
% predlist fails: 45623
% aux str. fails: 260450
% by-lit fails: 50065
% full subs tried: 461625
% full subs fail: 460715
%
% ; 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/SWC/SWC037-1+eq_r.in")
%
%------------------------------------------------------------------------------