TSTP Solution File: SWC017-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SWC017-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 : art01.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/SWC017-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(200,40,1,400,0,1,55760,4,2221,57790,5,2805,57791,1,2805,57791,50,2807,57791,40,2807,57991,0,2807)
%
%
% START OF PROOF
% 407 [?] ?
% 591 [?] ?
% 57800 [] ss^list(nil).
% 57849 [] segment^p(X,X) | -ss^list(X).
% 57853 [] frontseg^p(X,X) | -ss^list(X).
% 57872 [] -segment^p(nil,X) | equal(nil,X) | -ss^list(X).
% 57876 [] -frontseg^p(nil,X) | equal(nil,X) | -ss^list(X).
% 57980 [] ss^list(sk3).
% 57981 [] ss^list(sk4).
% 57982 [] equal(sk2,sk4).
% 57983 [] equal(sk1,sk3).
% 57985 [] equal(nil,sk2) | -neq(X,nil) | -frontseg^p(sk2,X) | -frontseg^p(sk1,X) | -ss^list(X).
% 57986 [] -equal(nil,sk1) | neq(sk2,nil).
% 57987 [] -equal(nil,sk1) | -neq(X,nil) | -frontseg^p(sk2,X) | -frontseg^p(sk1,X) | -ss^list(X).
% 57988 [] neq(sk3,nil) | equal(nil,sk4).
% 57989 [] frontseg^p(sk4,sk3) | equal(nil,sk4).
% 57991 [] frontseg^p(sk4,sk3) | equal(nil,sk3).
% 58773 [binary:57800,57987.5,cut:407,cut:591] -neq(nil,nil) | -equal(nil,sk1).
% 58783 [para:57982.1.2,57988.2.2] neq(sk3,nil) | equal(nil,sk2).
% 58790 [para:57982.1.2,57989.1.1] frontseg^p(sk2,sk3) | equal(nil,sk4).
% 58872 [binary:57981,57849.2] segment^p(sk4,sk4).
% 58975 [para:57982.1.2,58872.1.1] segment^p(sk2,sk4).
% 59047 [binary:57980,57853.2] frontseg^p(sk3,sk3).
% 59155 [para:57983.1.2,59047.1.1] frontseg^p(sk1,sk3).
% 59207 [binary:57985.4,59155,cut:57980,binarycut:58783] -frontseg^p(sk2,sk3) | equal(nil,sk2).
% 59761 [binary:57980,57876.3] -frontseg^p(nil,sk3) | equal(nil,sk3).
% 60037 [para:57982.1.2,58790.2.2,binarycut:59207] equal(nil,sk2).
% 60046 [para:60037.1.2,57986.2.1,binarycut:58773] -equal(nil,sk1).
% 60048 [para:60037.1.2,58975.1.1] segment^p(nil,sk4).
% 60095 [binary:57872,60048,cut:57981] equal(nil,sk4).
% 60186 [para:60095.1.2,57991.1.1,binarycut:59761] equal(nil,sk3).
% 60188 [para:57983.1.2,60186.1.2,cut:60046] 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: 329
% derived clauses: 90711
% kept clauses: 43641
% kept size sum: 621123
% kept mid-nuclei: 15304
% kept new demods: 32383
% forw unit-subs: 4107
% forw double-subs: 2209
% forw overdouble-subs: 450
% backward subs: 27
% fast unit cutoff: 1480
% full unit cutoff: 0
% dbl unit cutoff: 142
% real runtime : 28.17
% process. runtime: 28.16
% specific non-discr-tree subsumption statistics:
% tried: 46837
% length fails: 242
% strength fails: 16177
% predlist fails: 6425
% aux str. fails: 2089
% by-lit fails: 934
% full subs tried: 20046
% full subs fail: 19292
%
% ; 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/SWC017-1+eq_r.in")
%
%------------------------------------------------------------------------------