TSTP Solution File: SWC106-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SWC106-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 19.5s
% Output : Assurance 19.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/SWC106-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(204,40,1,408,0,1,55025,4,2224,56872,5,2802,56873,1,2802,56873,50,2805,56873,40,2805,57077,0,2805)
%
%
% START OF PROOF
% 56882 [] ss^list(nil).
% 56972 [] -equal(cons(X,Y),nil) | -ss^item(X) | -ss^list(Y).
% 56974 [] neq(X,Y) | equal(X,Y) | -ss^list(Y) | -ss^list(X).
% 57017 [] -equal(app(X,Y),Z) | rearseg^p(Z,Y) | -ss^list(Z) | -ss^list(Y) | -ss^list(X).
% 57060 [] ss^list(sk1).
% 57063 [] ss^list(sk4).
% 57064 [] equal(sk2,sk4).
% 57065 [] equal(sk1,sk3).
% 57066 [] neq(sk2,nil).
% 57073 [] -neq(sk4,nil) | ss^item(sk5).
% 57074 [] -neq(sk4,nil) | ss^list(sk6).
% 57075 [] equal(cons(sk5,nil),sk3) | -neq(sk4,nil).
% 57076 [] equal(app(sk6,cons(sk5,nil)),sk4) | -neq(sk4,nil).
% 57077 [] -neq(sk4,nil) | -neq(sk1,nil) | -rearseg^p(sk2,sk1).
% 57845 [para:57064.1.2,57073.1.1,cut:57066] ss^item(sk5).
% 57847 [para:57064.1.2,57074.1.1,cut:57066] ss^list(sk6).
% 57849 [para:57064.1.2,57075.2.1,cut:57066] equal(cons(sk5,nil),sk3).
% 57851 [para:57064.1.2,57076.2.1,demod:57849,cut:57066] equal(app(sk6,sk3),sk4).
% 57853 [para:57064.1.2,57077.1.1,cut:57066] -neq(sk1,nil) | -rearseg^p(sk2,sk1).
% 57854 [para:57065.1.2,57851.1.1.2] equal(app(sk6,sk1),sk4).
% 59573 [para:57849.1.1,56972.1.1,cut:57845,cut:56882] -equal(sk3,nil).
% 59594 [para:57065.1.2,59573.1.1] -equal(sk1,nil).
% 59725 [binary:59594,56974.2,cut:56882,cut:57060] neq(sk1,nil).
% 59732 [binary:57853,59725] -rearseg^p(sk2,sk1).
% 65284 [binary:57854,57017,cut:57063,cut:57060,cut:57847] rearseg^p(sk4,sk1).
% 65365 [para:57064.1.2,65284.1.1,cut:59732] 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: 619
% derived clauses: 101484
% kept clauses: 49149
% kept size sum: 693864
% kept mid-nuclei: 14885
% kept new demods: 32554
% forw unit-subs: 4471
% forw double-subs: 447
% forw overdouble-subs: 720
% backward subs: 23
% fast unit cutoff: 1661
% full unit cutoff: 0
% dbl unit cutoff: 144
% real runtime : 29.23
% process. runtime: 28.69
% specific non-discr-tree subsumption statistics:
% tried: 88201
% length fails: 3013
% strength fails: 16971
% predlist fails: 39377
% aux str. fails: 2931
% by-lit fails: 964
% full subs tried: 22852
% full subs fail: 21811
%
% ; 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/SWC106-1+eq_r.in")
%
%------------------------------------------------------------------------------