TSTP Solution File: SWC116-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SWC116-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 : art09.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/SWC116-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(197,40,1,394,0,1,53319,4,2225,55209,5,2802,55209,1,2802,55209,50,2804,55209,40,2804,55406,0,2804,149709,3,4207,175135,4,4906,193663,5,5605,193664,5,5607,193665,1,5607,193665,50,5611,193665,40,5611,193862,0,5611)
%
%
% START OF PROOF
% 193666 [] equal(X,X).
% 193674 [] ss^list(nil).
% 193739 [] equal(app(X,nil),X) | -ss^list(X).
% 193766 [] neq(X,Y) | equal(X,Y) | -ss^list(Y) | -ss^list(X).
% 193781 [] -neq(X,Y) | -equal(X,Y) | -ss^list(Y) | -ss^list(X).
% 193784 [] -equal(app(X,Y),nil) | equal(nil,X) | -ss^list(X) | -ss^list(Y).
% 193852 [] ss^list(sk1).
% 193853 [] ss^list(sk2).
% 193854 [] ss^list(sk3).
% 193856 [] equal(sk2,sk4).
% 193857 [] equal(sk1,sk3).
% 193858 [] -equal(nil,sk4) | equal(nil,sk3).
% 193859 [] -equal(nil,sk2) | -equal(nil,sk1).
% 193860 [] -neq(sk1,nil) | -segment^p(sk2,sk1).
% 193861 [] -neq(sk4,nil) | neq(sk3,nil).
% 193862 [] -neq(sk4,nil) | segment^p(sk4,sk3).
% 193876 [input:193781,factor:cut:193666] -neq(X,X) | -ss^list(X).
% 194630 [para:193856.1.2,193858.1.2] -equal(nil,sk2) | equal(nil,sk3).
% 194636 [para:193856.1.2,193861.1.1] -neq(sk2,nil) | neq(sk3,nil).
% 194640 [para:193856.1.2,193862.1.1] -neq(sk2,nil) | segment^p(sk4,sk3).
% 195128 [binary:193853,193739.2] equal(app(sk2,nil),sk2).
% 196193 [binary:193854,193876.2] -neq(sk3,sk3).
% 196260 [para:193857.1.2,196193.1.2] -neq(sk3,sk1).
% 196306 [para:194630.2.2,196260.1.1] -neq(nil,sk1) | -equal(nil,sk2).
% 196658 [binary:193859.2,193766.2,cut:193852,cut:193674,binarycut:196306] -equal(nil,sk2).
% 200528 [para:195128.1.1,193784.1.1,cut:196658,cut:193853,cut:193674] -equal(sk2,nil).
% 200782 [binary:193766.2,200528,cut:193674,cut:193853] neq(sk2,nil).
% 200790 [binary:194636,200782] neq(sk3,nil).
% 200791 [binary:194640,200782] segment^p(sk4,sk3).
% 200802 [para:193857.1.2,200790.1.1] neq(sk1,nil).
% 200815 [para:193856.1.2,200791.1.1] segment^p(sk2,sk3).
% 200819 [binary:193860,200802] -segment^p(sk2,sk1).
% 201103 [para:193857.1.2,200815.1.2,cut:200819] 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
% clause length limited to 19
% clause depth limited to 5
% seconds given: 11
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 1995
% derived clauses: 300624
% kept clauses: 124042
% kept size sum: 71778
% kept mid-nuclei: 33123
% kept new demods: 33393
% forw unit-subs: 20378
% forw double-subs: 6354
% forw overdouble-subs: 3807
% backward subs: 37
% fast unit cutoff: 18467
% full unit cutoff: 0
% dbl unit cutoff: 374
% real runtime : 57.3
% process. runtime: 56.52
% specific non-discr-tree subsumption statistics:
% tried: 992830
% length fails: 4378
% strength fails: 86794
% predlist fails: 683300
% aux str. fails: 25662
% by-lit fails: 30783
% full subs tried: 138780
% full subs fail: 134344
%
% ; 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/SWC116-1+eq_r.in")
%
%------------------------------------------------------------------------------