TSTP Solution File: SWC325-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SWC325-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 : art01.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 60.0s
% Output : Assurance 60.0s
% 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/SWC325-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(198,40,0,396,0,1,53422,4,2222,55345,5,2803,55346,1,2805,55346,50,2808,55346,40,2808,55544,0,2808,138552,3,4211,178077,4,4909,202476,5,5609,202476,5,5611,202476,1,5611,202476,50,5615,202476,40,5615,202674,0,5615,247552,3,6190,262609,4,6441,276251,5,6717,276251,5,6719,276251,1,6719,276251,50,6721,276251,40,6721,276449,0,6721)
%
%
% START OF PROOF
% 209857 [?] ?
% 276260 [] ss^list(nil).
% 276309 [] segment^p(X,X) | -ss^list(X).
% 276338 [] ss^list(cons(X,Y)) | -ss^item(X) | -ss^list(Y).
% 276379 [] -segment^p(X,Y) | -segment^p(Y,X) | equal(Y,X) | -ss^list(Y) | -ss^list(X).
% 276438 [] ss^list(sk1).
% 276439 [] ss^list(sk2).
% 276440 [] ss^list(sk3).
% 276441 [] ss^list(sk4).
% 276442 [] equal(sk2,sk4).
% 276443 [] equal(sk1,sk3).
% 276444 [] -equal(app(X,Y),sk2) | -equal(app(Y,X),sk1) | -ss^list(X) | -ss^list(Y).
% 276446 [] -neq(sk4,nil) | ss^item(sk5).
% 276447 [] -neq(sk4,nil) | ss^list(sk6).
% 276448 [] equal(app(cons(sk5,nil),sk6),sk3) | -neq(sk4,nil).
% 276449 [] equal(app(sk6,cons(sk5,nil)),sk4) | -neq(sk4,nil).
% 276794 [para:276442.1.2,276446.1.1,cut:209857] ss^item(sk5).
% 276796 [para:276442.1.2,276447.1.1,cut:209857] ss^list(sk6).
% 276808 [para:276442.1.2,276448.2.1,cut:209857] equal(app(cons(sk5,nil),sk6),sk3).
% 276821 [para:276442.1.2,276449.2.1,cut:209857] equal(app(sk6,cons(sk5,nil)),sk4).
% 276926 [binary:276440,276309.2] segment^p(sk3,sk3).
% 276927 [binary:276441,276309.2] segment^p(sk4,sk4).
% 276992 [para:276443.1.2,276926.1.1] segment^p(sk1,sk3).
% 276993 [para:276443.1.2,276926.1.2] segment^p(sk3,sk1).
% 277029 [para:276442.1.2,276927.1.1] segment^p(sk2,sk4).
% 277030 [para:276442.1.2,276927.1.2] segment^p(sk4,sk2).
% 278128 [binary:276794,276338.2] ss^list(cons(sk5,X)) | -ss^list(X).
% 281446 [binary:276992,276379,cut:276993,cut:276440,cut:276438] equal(sk3,sk1).
% 281447 [binary:277029,276379,cut:277030,cut:276441,cut:276439] equal(sk4,sk2).
% 303210 [para:276808.1.1,276444.2.1,demod:276821,cut:281446,cut:281447,cut:276796,binarydemod:278128,cut:276260] 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: 3619
% derived clauses: 442012
% kept clauses: 198773
% kept size sum: 0
% kept mid-nuclei: 52592
% kept new demods: 34178
% forw unit-subs: 45099
% forw double-subs: 11482
% forw overdouble-subs: 9131
% backward subs: 101
% fast unit cutoff: 42884
% full unit cutoff: 0
% dbl unit cutoff: 889
% real runtime : 69.80
% process. runtime: 69.78
% specific non-discr-tree subsumption statistics:
% tried: 2584965
% length fails: 34475
% strength fails: 242349
% predlist fails: 1805804
% aux str. fails: 82059
% by-lit fails: 60669
% full subs tried: 297044
% full subs fail: 286927
%
% ; 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/SWC325-1+eq_r.in")
%
%------------------------------------------------------------------------------