TSTP Solution File: SWC322-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SWC322-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 189.6s
% Output : Assurance 189.6s
% 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/SWC322-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,59356,4,2284,67221,5,2804,67222,1,2806,67222,50,2809,67222,40,2809,67424,0,2809,137240,3,4210,154633,4,4910,166363,5,5610,166364,5,5611,166364,1,5611,166364,50,5615,166364,40,5615,166566,0,5615,215989,3,6166,230582,4,6441,241109,5,6716,241109,5,6717,241109,1,6717,241109,50,6720,241109,40,6720,241311,0,6720,308692,3,7573,329266,4,7999,344334,62,8421,344334,5,8423,344334,1,8423,344334,50,8426,344334,40,8426,344536,0,8426,422015,3,9280,451906,4,9703,471035,5,10127,471036,5,10128,471037,1,10128,471037,50,10131,471037,40,10131,471239,0,10131,817597,3,14485,898877,4,16658,999299,5,18832,999300,1,18832,999300,50,18834,999300,40,18834,999502,0,18835)
%
%
% START OF PROOF
% 999301 [] equal(X,X).
% 999309 [] ss^list(nil).
% 999372 [] -member^p(nil,X) | -ss^item(X).
% 999380 [] -equal(nil,X) | segment^p(nil,X) | -ss^list(X).
% 999381 [] -segment^p(nil,X) | equal(nil,X) | -ss^list(X).
% 999401 [] neq(X,Y) | equal(X,Y) | -ss^list(Y) | -ss^list(X).
% 999416 [] -neq(X,Y) | -equal(X,Y) | -ss^list(Y) | -ss^list(X).
% 999476 [] -equal(app(X,cons(Y,Z)),U) | member^p(U,Y) | -ss^item(Y) | -ss^list(U) | -ss^list(Z) | -ss^list(X).
% 999487 [] ss^list(sk1).
% 999488 [] ss^list(sk2).
% 999489 [] ss^list(sk3).
% 999491 [] equal(sk2,sk4).
% 999492 [] equal(sk1,sk3).
% 999493 [] -equal(app(X,cons(Y,nil)),sk4) | equal(app(cons(Y,nil),X),sk3) | -ss^item(Y) | -ss^list(X).
% 999494 [] -equal(nil,sk4) | equal(nil,sk3).
% 999495 [] equal(nil,sk2) | ss^item(sk5).
% 999496 [] -equal(nil,sk1) | ss^item(sk5).
% 999497 [] equal(nil,sk2) | ss^list(sk6).
% 999498 [] equal(app(sk6,cons(sk5,nil)),sk2) | equal(nil,sk2).
% 999499 [] -equal(app(cons(sk5,nil),sk6),sk1) | equal(nil,sk2).
% 999500 [] -equal(nil,sk1) | ss^list(sk6).
% 999516 [input:999416,factor:cut:999301] -neq(X,X) | -ss^list(X).
% 1000274 [para:999491.1.2,999494.1.2] -equal(nil,sk2) | equal(nil,sk3).
% 1000289 [para:999492.1.2,1000274.2.2] -equal(nil,sk2) | equal(nil,sk1).
% 1000290 [para:999495.1.2,1000274.1.2,cut:999301] equal(nil,sk3) | ss^item(sk5).
% 1000291 [para:999497.1.2,1000274.1.2,cut:999301] equal(nil,sk3) | ss^list(sk6).
% 1000297 [para:999492.1.2,1000290.1.2,binarycut:999496] ss^item(sk5).
% 1000301 [para:999492.1.2,1000291.1.2,binarycut:999500] ss^list(sk6).
% 1000604 [binary:1000297,999372.2] -member^p(nil,sk5).
% 1000707 [binary:999488,999381.3] -segment^p(nil,sk2) | equal(nil,sk2).
% 1001413 [binary:999489,999516.2] -neq(sk3,sk3).
% 1001448 [para:999492.1.2,1001413.1.2] -neq(sk3,sk1).
% 1001597 [binary:1001448,999401,cut:999487,cut:999489] equal(sk3,sk1).
% 1008176 [binary:999498,999476,cut:1000297,cut:999488,cut:999309,cut:1000301] member^p(sk2,sk5) | equal(nil,sk2).
% 1008180 [?] ?
% 1023390 [para:1008176.2.2,1000289.1.2,cut:999301,binarycut:1008180] member^p(sk2,sk5).
% 1023391 [para:1000707.2.2,1023390.1.1,cut:1000604] -segment^p(nil,sk2).
% 1023394 [binary:999380.2,1023391,cut:999488] -equal(nil,sk2).
% 1037928 [para:999493.2.1,999499.1.1,cut:1001597,cut:1023394,cut:1000297,cut:1000301] -equal(app(sk6,cons(sk5,nil)),sk4).
% 1037929 [para:999498.1.1,1037928.1.1,cut:999491,cut:1023394] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using binary resolution
% using term-depth-order strategy
% not using sos 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: 9127
% derived clauses: 1664311
% kept clauses: 445280
% kept size sum: 710003
% kept mid-nuclei: 140412
% kept new demods: 36559
% forw unit-subs: 121479
% forw double-subs: 51971
% forw overdouble-subs: 37343
% backward subs: 824
% fast unit cutoff: 151225
% full unit cutoff: 86
% dbl unit cutoff: 9104
% real runtime : 198.60
% process. runtime: 198.1
% specific non-discr-tree subsumption statistics:
% tried: 8032291
% length fails: 143494
% strength fails: 1203965
% predlist fails: 4693557
% aux str. fails: 226570
% by-lit fails: 186796
% full subs tried: 1453362
% full subs fail: 1405957
%
% ; 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/SWC322-1+eq_r.in")
%
%------------------------------------------------------------------------------