TSTP Solution File: SWC213-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SWC213-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 : art10.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 20.0s
% Output : Assurance 20.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/SWC213-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(201,40,0,408,0,1,49998,4,2168,52011,5,2803,52012,1,2805,52012,50,2807,52012,40,2807,52219,0,2807)
%
%
% START OF PROOF
% 52013 [] equal(X,X).
% 52021 [] ss^list(nil).
% 52070 [] segment^p(X,X) | -ss^list(X).
% 52093 [] -segment^p(nil,X) | equal(nil,X) | -ss^list(X).
% 52113 [] neq(X,Y) | equal(X,Y) | -ss^list(Y) | -ss^list(X).
% 52128 [] -neq(X,Y) | -equal(X,Y) | -ss^list(Y) | -ss^list(X).
% 52200 [] -neq(sk1,nil).
% 52207 [] neq(sk2,nil).
% 52208 [] equal(sk1,sk3).
% 52209 [] equal(sk2,sk4).
% 52210 [] ss^list(sk4).
% 52213 [] ss^list(sk1).
% 52219 [] -equal(nil,sk3) | equal(nil,sk4).
% 52235 [input:52128,factor:cut:52013] -neq(X,X) | -ss^list(X).
% 53144 [para:52208.1.2,52219.1.2] -equal(nil,sk1) | equal(nil,sk4).
% 53326 [binary:52213,52070.2] segment^p(sk1,sk1).
% 54819 [binary:52210,52235.2] -neq(sk4,sk4).
% 54851 [para:52209.1.2,54819.1.1] -neq(sk2,sk4).
% 54900 [para:53144.2.2,54851.1.2,cut:52207] -equal(nil,sk1).
% 54960 [binary:52093.2,54900,cut:52213] -segment^p(nil,sk1).
% 55169 [binary:52200,52113,cut:52021,cut:52213] equal(sk1,nil).
% 55231 [para:55169.1.1,53326.1.1,cut:54960] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using binary resolution
% not using sos strategy
% using unit 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: 28
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 397
% derived clauses: 89781
% kept clauses: 40089
% kept size sum: 555555
% kept mid-nuclei: 13883
% kept new demods: 30044
% forw unit-subs: 3923
% forw double-subs: 1771
% forw overdouble-subs: 412
% backward subs: 9
% fast unit cutoff: 921
% full unit cutoff: 0
% dbl unit cutoff: 136
% real runtime : 28.35
% process. runtime: 28.32
% specific non-discr-tree subsumption statistics:
% tried: 45849
% length fails: 221
% strength fails: 16305
% predlist fails: 6081
% aux str. fails: 1706
% by-lit fails: 822
% full subs tried: 19569
% full subs fail: 18834
%
% ; 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/SWC213-1+eq_r.in")
%
%------------------------------------------------------------------------------