TSTP Solution File: SWC048-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SWC048-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 : art06.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 19.5s
% Output : Assurance 19.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/SWC048-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(200,40,1,400,0,1,55636,4,2233,57628,5,2803,57629,1,2805,57629,50,2807,57629,40,2807,57829,0,2807)
%
%
% START OF PROOF
% 405 [?] ?
% 589 [?] ?
% 57638 [] ss^list(nil).
% 57687 [] segment^p(X,X) | -ss^list(X).
% 57689 [] rearseg^p(X,X) | -ss^list(X).
% 57710 [] -segment^p(nil,X) | equal(nil,X) | -ss^list(X).
% 57712 [] -rearseg^p(nil,X) | equal(nil,X) | -ss^list(X).
% 57818 [] ss^list(sk3).
% 57819 [] ss^list(sk4).
% 57820 [] equal(sk2,sk4).
% 57821 [] equal(sk1,sk3).
% 57823 [] equal(nil,sk2) | -neq(X,nil) | -rearseg^p(sk2,X) | -rearseg^p(sk1,X) | -ss^list(X).
% 57824 [] -equal(nil,sk1) | neq(sk2,nil).
% 57825 [] -equal(nil,sk1) | -neq(X,nil) | -rearseg^p(sk2,X) | -rearseg^p(sk1,X) | -ss^list(X).
% 57826 [] neq(sk3,nil) | equal(nil,sk4).
% 57827 [] rearseg^p(sk4,sk3) | equal(nil,sk4).
% 57829 [] rearseg^p(sk4,sk3) | equal(nil,sk3).
% 58611 [binary:57638,57825.5,cut:405,cut:589] -neq(nil,nil) | -equal(nil,sk1).
% 58621 [para:57820.1.2,57826.2.2] neq(sk3,nil) | equal(nil,sk2).
% 58628 [para:57820.1.2,57827.1.1] rearseg^p(sk2,sk3) | equal(nil,sk4).
% 58710 [binary:57819,57687.2] segment^p(sk4,sk4).
% 58813 [para:57820.1.2,58710.1.1] segment^p(sk2,sk4).
% 58820 [binary:57818,57689.2] rearseg^p(sk3,sk3).
% 58944 [para:57821.1.2,58820.1.1] rearseg^p(sk1,sk3).
% 59002 [binary:57823.4,58944,cut:57818,binarycut:58621] -rearseg^p(sk2,sk3) | equal(nil,sk2).
% 59435 [binary:57818,57712.3] -rearseg^p(nil,sk3) | equal(nil,sk3).
% 59875 [para:57820.1.2,58628.2.2,binarycut:59002] equal(nil,sk2).
% 59884 [para:59875.1.2,57824.2.1,binarycut:58611] -equal(nil,sk1).
% 59886 [para:59875.1.2,58813.1.1] segment^p(nil,sk4).
% 59933 [binary:57710,59886,cut:57819] equal(nil,sk4).
% 60024 [para:59933.1.2,57829.1.1,binarycut:59435] equal(nil,sk3).
% 60026 [para:57821.1.2,60024.1.2,cut:59884] 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: 329
% derived clauses: 90473
% kept clauses: 43572
% kept size sum: 620325
% kept mid-nuclei: 15211
% kept new demods: 32383
% forw unit-subs: 4107
% forw double-subs: 2134
% forw overdouble-subs: 450
% backward subs: 27
% fast unit cutoff: 1408
% full unit cutoff: 0
% dbl unit cutoff: 142
% real runtime : 28.64
% process. runtime: 28.17
% specific non-discr-tree subsumption statistics:
% tried: 46787
% length fails: 242
% strength fails: 16176
% predlist fails: 6377
% aux str. fails: 2089
% by-lit fails: 934
% full subs tried: 20045
% full subs fail: 19291
%
% ; 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/SWC048-1+eq_r.in")
%
%------------------------------------------------------------------------------