TSTP Solution File: SWC001-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SWC001-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 : art07.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 179.1s
% Output : Assurance 179.1s
% 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/SWC001-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(198,40,1,396,0,2,56042,4,2268,57950,5,2803,57951,1,2805,57951,50,2807,57951,40,2807,58149,0,2807,151109,3,4213,178381,4,4908,197206,5,5608,197208,1,5609,197208,50,5613,197208,40,5613,197406,0,5613,247488,3,6173,263178,4,6442,274259,5,6714,274260,5,6716,274260,1,6716,274260,50,6718,274260,40,6718,274458,0,6718,344188,3,7570,365875,4,7994,380053,5,8444,380054,5,8447,380055,1,8447,380055,50,8450,380055,40,8450,380253,0,8450,459844,3,9305,484937,4,9728,502159,5,10151,502159,5,10152,502160,1,10152,502160,50,10155,502160,40,10155,502358,0,10155,814234,3,14507,922154,4,16681,1000574,5,18857,1000575,1,18857,1000575,50,18860,1000575,40,18860,1000773,0,18861)
%
%
% START OF PROOF
% 1000766 [] equal(sk2,sk4).
% 1000767 [] equal(sk1,sk3).
% 1000768 [] duplicatefree^p(sk3).
% 1000769 [] -member^p(sk3,X) | member^p(sk4,X) | -ss^item(X).
% 1000770 [] -member^p(sk4,X) | member^p(sk3,X) | -ss^item(X).
% 1000771 [?] ?
% 1000772 [?] ?
% 1000773 [?] ?
% 1001540 [para:1000767.1.2,1000768.1.1] duplicatefree^p(sk1).
% 1001551 [input:1000771,cut:1001540] ss^item(sk5).
% 1001552 [binary:1000769.3,1001551] -member^p(sk3,sk5) | member^p(sk4,sk5).
% 1001553 [binary:1000770.3,1001551] -member^p(sk4,sk5) | member^p(sk3,sk5).
% 1001554 [input:1000772,cut:1001540] member^p(sk1,sk5) | member^p(sk2,sk5).
% 1001559 [input:1000773,cut:1001540] -member^p(sk1,sk5) | -member^p(sk2,sk5).
% 1001868 [para:1000766.1.2,1001552.2.1] -member^p(sk3,sk5) | member^p(sk2,sk5).
% 1001869 [para:1000767.1.2,1001552.1.1] -member^p(sk1,sk5) | member^p(sk4,sk5).
% 1003739 [binary:1001559.2,1001868.2] -member^p(sk3,sk5) | -member^p(sk1,sk5).
% 1003740 [binary:1001553.2,1001868] -member^p(sk4,sk5) | member^p(sk2,sk5).
% 1003945 [binary:1001554,1001869,binarycut:1003740] member^p(sk2,sk5).
% 1003947 [binary:1001553,1001869.2,binarycut:1003739] -member^p(sk1,sk5).
% 1004392 [para:1000766.1.2,1001553.1.1,cut:1003945] member^p(sk3,sk5).
% 1004393 [para:1000767.1.2,1004392.1.1,cut:1003947] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using binary resolution
% using term-depth-order strategy
% not using sos 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: 7231
% derived clauses: 1655661
% kept clauses: 418475
% kept size sum: 29057
% kept mid-nuclei: 152092
% kept new demods: 37518
% forw unit-subs: 110353
% forw double-subs: 32681
% forw overdouble-subs: 26263
% backward subs: 76
% fast unit cutoff: 137706
% full unit cutoff: 84
% dbl unit cutoff: 7327
% real runtime : 189.94
% process. runtime: 188.89
% specific non-discr-tree subsumption statistics:
% tried: 6380144
% length fails: 24914
% strength fails: 638585
% predlist fails: 4264157
% aux str. fails: 222449
% by-lit fails: 116093
% full subs tried: 1009915
% full subs fail: 980036
%
% ; 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/SWC001-1+eq_r.in")
%
%------------------------------------------------------------------------------