TSTP Solution File: SWC386-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SWC386-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 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/SWC386-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(202,40,1,404,0,1,57166,4,2261,61072,63,2803,61072,1,2803,61072,50,2824,61072,40,2824,61274,0,2824,160771,3,4227,188620,4,4925,208651,62,5625,208652,1,5626,208652,50,5630,208652,40,5630,208854,0,5630)
%
%
% START OF PROOF
% 208653 [] equal(X,X).
% 208661 [] ss^list(nil).
% 208664 [] -singleton^p(nil).
% 208724 [] -member^p(nil,X) | -ss^item(X).
% 208753 [] neq(X,Y) | equal(X,Y) | -ss^list(Y) | -ss^list(X).
% 208768 [] -neq(X,Y) | -equal(X,Y) | -ss^list(Y) | -ss^list(X).
% 208769 [] -equal(cons(X,nil),Y) | -ss^item(X) | -ss^list(Y) | singleton^p(Y).
% 208839 [] ss^list(sk1).
% 208840 [] ss^list(sk2).
% 208841 [] ss^list(sk3).
% 208843 [] equal(sk2,sk4).
% 208844 [] equal(sk1,sk3).
% 208845 [] equal(nil,sk4) | ss^item(sk5).
% 208846 [] equal(nil,sk3) | ss^item(sk5).
% 208847 [] equal(cons(sk5,nil),sk3) | equal(nil,sk4).
% 208849 [] equal(cons(sk5,nil),sk3) | equal(nil,sk3).
% 208850 [] member^p(sk4,sk5) | equal(nil,sk3).
% 208851 [] neq(sk2,nil) | equal(nil,sk2).
% 208852 [] equal(nil,sk2) | -equal(cons(X,nil),sk1) | -member^p(sk2,X) | -ss^item(X).
% 208853 [] -equal(nil,sk1) | neq(sk2,nil).
% 208868 [input:208768,factor:cut:208653] -neq(X,X) | -ss^list(X).
% 209622 [para:208845.1.2,208843.1.2] equal(sk2,nil) | ss^item(sk5).
% 209626 [para:208844.1.2,208846.1.2] equal(nil,sk1) | ss^item(sk5).
% 209669 [para:209622.1.1,208853.2.1,binarycut:209626] neq(nil,nil) | ss^item(sk5).
% 211383 [binary:208840,208868.2] -neq(sk2,sk2).
% 211384 [binary:208841,208868.2] -neq(sk3,sk3).
% 211386 [binary:208661,208868.2] -neq(nil,nil).
% 211407 [binary:209669,208868,cut:208661] ss^item(sk5).
% 211428 [binary:208724.2,211407] -member^p(nil,sk5).
% 211467 [para:208844.1.2,211384.1.2] -neq(sk3,sk1).
% 212012 [binary:211467,208753,cut:208839,cut:208841] equal(sk3,sk1).
% 213007 [binary:208847,208769,cut:211407,cut:208841] equal(nil,sk4) | singleton^p(sk3).
% 213018 [binary:208849,208769,cut:211407,cut:208841] equal(nil,sk3) | singleton^p(sk3).
% 222389 [para:213007.1.2,208843.1.2] equal(sk2,nil) | singleton^p(sk3).
% 222568 [para:208844.1.2,213018.1.2] equal(nil,sk1) | singleton^p(sk3).
% 231981 [para:222389.1.1,208853.2.1,cut:211386,binarycut:222568] singleton^p(sk3).
% 231984 [para:208849.2.2,231981.1.1,cut:208664] equal(cons(sk5,nil),sk3).
% 231985 [para:208850.2.2,231981.1.1,cut:208664] member^p(sk4,sk5).
% 231988 [para:208843.1.2,231985.1.1] member^p(sk2,sk5).
% 231994 [para:208851.2.2,231988.1.1,cut:211428] neq(sk2,nil).
% 231996 [binary:208852.3,231988,demod:231984,cut:212012,cut:211407] equal(nil,sk2).
% 232142 [para:231996.1.2,211383.1.2,cut:231994] 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: 2362
% derived clauses: 322956
% kept clauses: 144317
% kept size sum: 335559
% kept mid-nuclei: 36035
% kept new demods: 33442
% forw unit-subs: 25298
% forw double-subs: 11208
% forw overdouble-subs: 4800
% backward subs: 269
% fast unit cutoff: 21168
% full unit cutoff: 0
% dbl unit cutoff: 531
% real runtime : 59.76
% process. runtime: 59.24
% specific non-discr-tree subsumption statistics:
% tried: 1308759
% length fails: 6149
% strength fails: 110886
% predlist fails: 899279
% aux str. fails: 42065
% by-lit fails: 36738
% full subs tried: 173134
% full subs fail: 167710
%
% ; 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/SWC386-1+eq_r.in")
%
%------------------------------------------------------------------------------