TSTP Solution File: SWC029-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SWC029-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 : art08.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 49.5s
% Output : Assurance 49.5s
% 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/SWC029-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(201,40,1,402,0,1,54362,4,2201,56381,5,2803,56381,1,2803,56381,50,2805,56381,40,2805,56582,0,2805,133069,3,4235,164072,4,4911)
%
%
% START OF PROOF
% 56382 [] equal(X,X).
% 56390 [] ss^list(nil).
% 56439 [] segment^p(X,X) | -ss^list(X).
% 56453 [] -member^p(nil,X) | -ss^item(X).
% 56455 [] equal(app(X,nil),X) | -ss^list(X).
% 56456 [] equal(app(nil,X),X) | -ss^list(X).
% 56461 [] -equal(nil,X) | segment^p(nil,X) | -ss^list(X).
% 56462 [] -segment^p(nil,X) | equal(nil,X) | -ss^list(X).
% 56464 [] -rearseg^p(nil,X) | equal(nil,X) | -ss^list(X).
% 56482 [] neq(X,Y) | equal(X,Y) | -ss^list(Y) | -ss^list(X).
% 56500 [] -equal(app(X,Y),nil) | equal(nil,X) | -ss^list(X) | -ss^list(Y).
% 56522 [] member^p(app(X,Y),Z) | -member^p(X,Z) | -ss^item(Z) | -ss^list(X) | -ss^list(Y).
% 56525 [] -equal(app(X,Y),Z) | rearseg^p(Z,Y) | -ss^list(Z) | -ss^list(Y) | -ss^list(X).
% 56527 [] equal(app(X,Y),nil) | -equal(nil,X) | -equal(nil,Y) | -ss^list(X) | -ss^list(Y).
% 56557 [] -equal(app(X,cons(Y,Z)),U) | member^p(U,Y) | -ss^item(Y) | -ss^list(U) | -ss^list(Z) | -ss^list(X).
% 56569 [] ss^list(sk2).
% 56570 [] ss^list(sk3).
% 56571 [] ss^list(sk4).
% 56572 [] equal(sk2,sk4).
% 56573 [] equal(sk1,sk3).
% 56574 [] -equal(nil,sk4) | equal(nil,sk3).
% 56575 [] -neq(sk4,nil) | ss^item(sk5).
% 56576 [] -neq(sk4,nil) | ss^list(sk6).
% 56578 [] equal(app(sk6,cons(sk5,nil)),sk3) | -neq(sk4,nil).
% 56579 [] equal(nil,sk2) | equal(nil,sk1).
% 56582 [] -equal(nil,sk1) | -equal(nil,sk2).
% 56623 [input:56525,factor:factor] -equal(app(X,Y),X) | rearseg^p(X,Y) | -ss^list(X) | -ss^list(Y).
% 56630 [input:56527,factor] equal(app(X,X),nil) | -equal(nil,X) | -ss^list(X).
% 57350 [para:56572.1.2,56574.1.2] -equal(nil,sk2) | equal(nil,sk3).
% 57354 [para:56572.1.2,56575.1.1] -neq(sk2,nil) | ss^item(sk5).
% 57356 [para:56572.1.2,56576.1.1] -neq(sk2,nil) | ss^list(sk6).
% 57368 [para:56573.1.2,57350.2.2,binarycut:56579] equal(nil,sk1).
% 57369 [para:57368.1.2,56582.1.2,cut:56382] -equal(nil,sk2).
% 57425 [binary:56570,56439.2] segment^p(sk3,sk3).
% 57520 [para:56573.1.2,57425.1.1] segment^p(sk1,sk3).
% 57596 [para:57368.1.2,57520.1.1] segment^p(nil,sk3).
% 57820 [binary:56569,56455.2] equal(app(sk2,nil),sk2).
% 57856 [binary:56571,56456.2] equal(app(nil,sk4),sk4).
% 57887 [binary:56571,56461.3] -equal(nil,sk4) | segment^p(nil,sk4).
% 57916 [binary:56569,56462.3,cut:57369] -segment^p(nil,sk2).
% 57917 [binary:56570,56462.3,cut:57596] equal(nil,sk3).
% 60740 [para:57820.1.1,56500.1.1,cut:57369,cut:56569,cut:56390] -equal(sk2,nil).
% 60796 [binary:56482.2,60740,cut:56390,cut:56569] neq(sk2,nil).
% 60800 [binary:57354,60796] ss^item(sk5).
% 60801 [binary:57356,60796] ss^list(sk6).
% 65919 [para:56572.1.2,57887.2.2,cut:57916] -equal(nil,sk4).
% 65923 [binary:56464.2,65919,cut:56571] -rearseg^p(nil,sk4).
% 77809 [para:57856.1.1,56623.1.1,cut:65923,cut:56390,cut:56571] -equal(sk4,nil).
% 77881 [binary:56482.2,77809,cut:56390,cut:56571] neq(sk4,nil).
% 77905 [binary:56578.2,77881] equal(app(sk6,cons(sk5,nil)),sk3).
% 78443 [binary:56570,56630.3,cut:57917] equal(app(sk3,sk3),nil).
% 90939 [para:78443.1.1,56522.1.1,cut:56570,binarycut:56453] -member^p(sk3,X) | -ss^item(X).
% 91110 [binary:60800,90939.2] -member^p(sk3,sk5).
% 172578 [binary:77905,56557,cut:91110,cut:60800,cut:56570,cut:56390,cut:60801] 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 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
%
%
% old unit clauses discarded
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 1765
% derived clauses: 237474
% kept clauses: 118223
% kept size sum: 0
% kept mid-nuclei: 23143
% kept new demods: 33122
% forw unit-subs: 13123
% forw double-subs: 6914
% forw overdouble-subs: 3747
% backward subs: 44
% fast unit cutoff: 20898
% full unit cutoff: 0
% dbl unit cutoff: 438
% real runtime : 50.48
% process. runtime: 49.97
% specific non-discr-tree subsumption statistics:
% tried: 1132110
% length fails: 15314
% strength fails: 141525
% predlist fails: 698732
% aux str. fails: 49495
% by-lit fails: 55639
% full subs tried: 136313
% full subs fail: 132299
%
% ; 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/SWC029-1+eq_r.in")
%
%------------------------------------------------------------------------------