TSTP Solution File: SWC105-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SWC105-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 59.4s
% Output : Assurance 59.4s
% 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/SWC105-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,55522,4,2196,57532,5,2803,57533,1,2804,57533,50,2807,57533,40,2807,57733,0,2807,150931,3,4210,175037,4,4910,192269,5,5608,192270,5,5610,192271,1,5610,192271,50,5614,192271,40,5614,192471,0,5614,234422,3,6165,246028,4,6443)
%
%
% START OF PROOF
% 192272 [] equal(X,X).
% 192280 [] ss^list(nil).
% 192328 [] segment^p(X,nil) | -ss^list(X).
% 192330 [] rearseg^p(X,nil) | -ss^list(X).
% 192351 [] -equal(nil,X) | segment^p(nil,X) | -ss^list(X).
% 192387 [] -neq(X,Y) | -equal(X,Y) | -ss^list(Y) | -ss^list(X).
% 192399 [] -segment^p(X,Y) | -segment^p(Y,X) | equal(Y,X) | -ss^list(Y) | -ss^list(X).
% 192400 [] -rearseg^p(X,Y) | -rearseg^p(Y,X) | equal(Y,X) | -ss^list(Y) | -ss^list(X).
% 192459 [] ss^list(sk2).
% 192460 [] ss^list(sk3).
% 192462 [] equal(sk2,sk4).
% 192463 [] equal(sk1,sk3).
% 192464 [] neq(sk2,nil) | equal(nil,sk2).
% 192465 [] -neq(sk1,nil) | -rearseg^p(sk2,sk1) | equal(nil,sk2).
% 192466 [] -equal(nil,sk1) | neq(sk2,nil).
% 192468 [] neq(sk3,nil) | equal(nil,sk4).
% 192470 [] neq(sk3,nil) | equal(nil,sk3).
% 192471 [] rearseg^p(sk4,sk3) | equal(nil,sk3).
% 192485 [input:192387,factor:cut:192272] -neq(X,X) | -ss^list(X).
% 193243 [para:192468.2.2,192462.1.2] neq(sk3,nil) | equal(sk2,nil).
% 193253 [para:192470.2.2,192463.1.2] neq(sk3,nil) | equal(sk1,nil).
% 193329 [binary:192459,192328.2] segment^p(sk2,nil).
% 193362 [binary:192460,192330.2] rearseg^p(sk3,nil).
% 194842 [binary:192459,192485.2] -neq(sk2,sk2).
% 194845 [binary:192280,192485.2] -neq(nil,nil).
% 194879 [para:193243.2.1,194842.1.2] -neq(sk2,nil) | neq(sk3,nil).
% 221818 [para:193253.2.1,192466.1.2,cut:192272,binarycut:194879] neq(sk3,nil).
% 221836 [para:192463.1.2,221818.1.1] neq(sk1,nil).
% 221837 [para:192471.2.2,221818.1.1,cut:194845] rearseg^p(sk4,sk3).
% 221843 [binary:192387,221818,cut:192280,cut:192460] -equal(sk3,nil).
% 222100 [para:192462.1.2,221837.1.1] rearseg^p(sk2,sk3).
% 222120 [binary:192400.3,221843,cut:193362,cut:192460,cut:192280] -rearseg^p(nil,sk3).
% 222166 [para:192463.1.2,222100.1.2] rearseg^p(sk2,sk1).
% 222167 [para:192464.2.2,222100.1.1,cut:222120] neq(sk2,nil).
% 222532 [binary:192387,222167,cut:192280,cut:192459] -equal(sk2,nil).
% 222761 [binary:192399.3,222532,cut:193329,cut:192459,cut:192280] -segment^p(nil,sk2).
% 222812 [binary:192351.2,222761,cut:192459] -equal(nil,sk2).
% 246029 [binary:221836,192465,cut:222166,cut:222812] 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 19
% clause depth limited to 5
% seconds given: 11
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 2718
% derived clauses: 336070
% kept clauses: 170461
% kept size sum: 841856
% kept mid-nuclei: 32295
% kept new demods: 34022
% forw unit-subs: 25860
% forw double-subs: 7977
% forw overdouble-subs: 5115
% backward subs: 50
% fast unit cutoff: 23904
% full unit cutoff: 1
% dbl unit cutoff: 610
% real runtime : 65.30
% process. runtime: 64.67
% specific non-discr-tree subsumption statistics:
% tried: 1584519
% length fails: 22755
% strength fails: 141949
% predlist fails: 1104436
% aux str. fails: 42512
% by-lit fails: 32784
% full subs tried: 200194
% full subs fail: 194274
%
% ; 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/SWC105-1+eq_r.in")
%
%------------------------------------------------------------------------------