TSTP Solution File: SWC384-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SWC384-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 : art07.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.5s
% Output : Assurance 59.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/SWC384-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(208,40,3,416,0,3,81851,4,2314,105838,5,2804,105839,1,2805,105839,50,2810,105839,40,2810,106047,0,2810,191245,3,4211,227085,4,4916,250087,5,5611,250087,5,5613,250088,1,5613,250088,50,5616,250088,40,5616,250296,0,5616,287316,3,6169,306389,4,6443,322203,5,6717,322203,5,6718,322203,1,6718,322203,50,6720,322203,40,6720,322411,0,6720)
%
%
% START OF PROOF
% 254620 [?] ?
% 322320 [] -equal(cons(X,nil),Y) | -ss^item(X) | -ss^list(Y) | singleton^p(Y).
% 322377 [] -equal(app(app(X,Y),Z),U) | segment^p(U,Y) | -ss^list(U) | -ss^list(Y) | -ss^list(Z) | -ss^list(X).
% 322390 [] ss^list(sk1).
% 322392 [] ss^list(sk3).
% 322393 [] ss^list(sk4).
% 322394 [] equal(sk2,sk4).
% 322395 [] equal(sk1,sk3).
% 322397 [] equal(nil,sk4) | ss^item(sk5).
% 322399 [] equal(nil,sk4) | ss^list(sk6).
% 322400 [] equal(nil,sk4) | ss^list(sk7).
% 322401 [] equal(cons(sk5,nil),sk3) | equal(nil,sk4).
% 322402 [] equal(app(app(sk6,sk3),sk7),sk4) | equal(nil,sk4).
% 322411 [] -segment^p(sk2,sk1) | -singleton^p(sk1).
% 322740 [para:322397.1.2,322394.1.2,cut:254620] ss^item(sk5).
% 322742 [para:322399.1.2,322394.1.2,cut:254620] ss^list(sk6).
% 322744 [para:322400.1.2,322394.1.2,cut:254620] ss^list(sk7).
% 322746 [para:322401.2.2,322394.1.2,cut:254620] equal(cons(sk5,nil),sk3).
% 322749 [para:322402.2.2,322394.1.2,cut:254620] equal(app(app(sk6,sk3),sk7),sk4).
% 322769 [para:322395.1.2,322749.1.1.1.2] equal(app(app(sk6,sk1),sk7),sk4).
% 325852 [binary:322746,322320,cut:322740,cut:322392] singleton^p(sk3).
% 325882 [para:322395.1.2,325852.1.1] singleton^p(sk1).
% 325883 [binary:322411.2,325882] -segment^p(sk2,sk1).
% 334789 [binary:322769,322377,cut:322393,cut:322390,cut:322744,cut:322742] segment^p(sk4,sk1).
% 334836 [para:322394.1.2,334789.1.1,cut:325883] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using binary resolution
% not using sos strategy
% using double strategy
% using dynamic demodulation
% using ordered paramodulation
% using kb ordering for equality
% preferring bigger arities for lex ordering
% using clause demodulation
% seconds given: 17
%
%
% old unit clauses discarded
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 3681
% derived clauses: 538672
% kept clauses: 215085
% kept size sum: 0
% kept mid-nuclei: 57443
% kept new demods: 26560
% forw unit-subs: 46257
% forw double-subs: 37113
% forw overdouble-subs: 14399
% backward subs: 248
% fast unit cutoff: 48682
% full unit cutoff: 0
% dbl unit cutoff: 907
% real runtime : 68.73
% process. runtime: 68.16
% specific non-discr-tree subsumption statistics:
% tried: 2751061
% length fails: 55560
% strength fails: 328844
% predlist fails: 1817212
% aux str. fails: 91604
% by-lit fails: 67594
% full subs tried: 328536
% full subs fail: 313509
%
% ; 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/SWC384-1+eq_r.in")
%
%------------------------------------------------------------------------------