TSTP Solution File: SWC003-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SWC003-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 : art02.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 69.4s
% Output : Assurance 69.4s
% 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/SWC003-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,1,416,0,1,58706,4,2309,60597,5,2803,60598,1,2803,60598,50,2806,60598,40,2806,60806,0,2806,134680,3,4212,165381,4,4907,186563,5,5607,186564,5,5609,186565,1,5609,186565,50,5612,186565,40,5612,186773,0,5613,229391,3,6166,244928,4,6440,257526,5,6714,257527,5,6715,257527,1,6715,257527,50,6717,257527,40,6717,257735,0,6717)
%
%
% START OF PROOF
% 257536 [] ss^list(nil).
% 257585 [] segment^p(X,X) | -ss^list(X).
% 257614 [] ss^list(cons(X,Y)) | -ss^item(X) | -ss^list(Y).
% 257626 [] -equal(cons(X,Y),nil) | -ss^item(X) | -ss^list(Y).
% 257628 [] neq(X,Y) | equal(X,Y) | -ss^list(Y) | -ss^list(X).
% 257643 [] -neq(X,Y) | -equal(X,Y) | -ss^list(Y) | -ss^list(X).
% 257655 [] -segment^p(X,Y) | -segment^p(Y,X) | equal(Y,X) | -ss^list(Y) | -ss^list(X).
% 257714 [] ss^list(sk1).
% 257715 [] ss^list(sk2).
% 257716 [] ss^list(sk3).
% 257717 [] ss^list(sk4).
% 257718 [] equal(sk2,sk4).
% 257719 [] equal(sk1,sk3).
% 257720 [] neq(sk2,nil).
% 257729 [] -neq(sk4,nil) | -equal(app(app(X,Y),Z),sk2) | -equal(app(X,Z),sk1) | -neq(Y,nil) | -ss^list(Y) | -ss^list(Z) | -ss^list(X).
% 257730 [] -neq(sk4,nil) | ss^item(sk5).
% 257731 [] -neq(sk4,nil) | ss^list(sk6).
% 257732 [] -neq(sk4,nil) | ss^list(sk7).
% 257733 [] equal(app(app(sk6,cons(sk5,nil)),sk7),sk4) | -neq(sk4,nil).
% 257734 [] equal(app(sk6,sk7),sk3) | -neq(sk4,nil).
% 258073 [para:257718.1.2,257730.1.1,cut:257720] ss^item(sk5).
% 258087 [para:257718.1.2,257729.1.1,cut:257720] -equal(app(app(X,Y),Z),sk2) | -equal(app(X,Z),sk1) | -neq(Y,nil) | -ss^list(Z) | -ss^list(X) | -ss^list(Y).
% 258128 [para:257718.1.2,257731.1.1,cut:257720] ss^list(sk6).
% 258130 [para:257718.1.2,257732.1.1,cut:257720] ss^list(sk7).
% 258132 [para:257718.1.2,257734.2.1,cut:257720] equal(app(sk6,sk7),sk3).
% 258134 [para:257718.1.2,257733.2.1,cut:257720] equal(app(app(sk6,cons(sk5,nil)),sk7),sk4).
% 258215 [binary:257717,257585.2] segment^p(sk4,sk4).
% 258286 [para:257718.1.2,258215.1.1] segment^p(sk2,sk4).
% 258287 [para:257718.1.2,258215.1.2] segment^p(sk4,sk2).
% 259476 [binary:258073,257614.2] ss^list(cons(sk5,X)) | -ss^list(X).
% 260107 [binary:258073,257626.2] -equal(cons(sk5,X),nil) | -ss^list(X).
% 261332 [binary:258132,257643.2,demod:258132,cut:257716] -neq(sk3,sk3).
% 261354 [para:257719.1.2,261332.1.2] -neq(sk3,sk1).
% 261418 [binary:257628,261354,cut:257714,cut:257716] equal(sk3,sk1).
% 262914 [binary:258286,257655,cut:258287,cut:257717,cut:257715] equal(sk4,sk2).
% 294277 [para:258134.1.1,258087.1.1,demod:258132,cut:262914,cut:261418,cut:258130,cut:258128,binarydemod:259476,cut:257536] -neq(cons(sk5,nil),nil).
% 299265 [binary:257628,294277,cut:257536,binarydemod:259476,260107,cut:257536] 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: 3815
% derived clauses: 426863
% kept clauses: 215219
% kept size sum: 0
% kept mid-nuclei: 48871
% kept new demods: 34795
% forw unit-subs: 42930
% forw double-subs: 11008
% forw overdouble-subs: 9072
% backward subs: 169
% fast unit cutoff: 43504
% full unit cutoff: 0
% dbl unit cutoff: 795
% real runtime : 73.26
% process. runtime: 72.64
% specific non-discr-tree subsumption statistics:
% tried: 2629721
% length fails: 35194
% strength fails: 221170
% predlist fails: 1890219
% aux str. fails: 74576
% by-lit fails: 42272
% full subs tried: 305279
% full subs fail: 295263
%
% ; 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/SWC003-1+eq_r.in")
%
%------------------------------------------------------------------------------