TSTP Solution File: SWC333-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SWC333-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 208.6s
% Output : Assurance 208.6s
% 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/SWC333-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,0,400,0,1,55174,4,2223,57088,5,2803,57088,1,2803,57088,50,2806,57088,40,2806,57288,0,2806,154677,3,4208,191328,4,4908,211154,5,5607,211156,1,5608,211156,50,5612,211156,40,5612,211356,0,5612,257893,3,6163,273582,4,6438,283379,5,6714,283381,5,6715,283381,1,6715,283381,50,6717,283381,40,6717,283581,0,6718,345444,3,7569,355995,4,7994,371728,5,8419,371730,5,8420,371731,1,8420,371731,50,8422,371731,40,8422,371931,0,8422,445058,3,9274,471821,4,9699,491441,5,10145,491442,5,10148,491443,1,10148,491443,50,10151,491443,40,10151,491643,0,10151,806071,3,14513,886355,4,16679,979680,5,18852,979681,1,18852,979681,50,18855,979681,40,18855,979881,0,18855,1021295,3,20256,1023694,4,20956)
%
%
% START OF PROOF
% 979739 [] segment^p(X,X) | -ss^list(X).
% 979782 [] neq(X,Y) | equal(X,Y) | -ss^list(Y) | -ss^list(X).
% 979797 [] -neq(X,Y) | -equal(X,Y) | -ss^list(Y) | -ss^list(X).
% 979834 [] -segment^p(Y,Z) | -segment^p(X,Y) | segment^p(X,Z) | -ss^list(X) | -ss^list(Y) | -ss^list(Z).
% 979868 [] ss^list(sk1).
% 979869 [] ss^list(sk2).
% 979870 [] ss^list(sk3).
% 979871 [] ss^list(sk4).
% 979872 [] equal(sk2,sk4).
% 979873 [] equal(sk1,sk3).
% 979874 [] segment^p(sk4,sk3).
% 979875 [] totalordered^p(sk3).
% 979876 [] -neq(sk3,X) | -segment^p(X,sk3) | -segment^p(sk4,X) | -ss^list(X) | -totalordered^p(X).
% 979877 [?] ?
% 979878 [?] ?
% 979879 [?] ?
% 979880 [?] ?
% 979881 [?] ?
% 980648 [para:979873.1.2,979875.1.1] totalordered^p(sk1).
% 980649 [para:979872.1.2,979874.1.1] segment^p(sk2,sk3).
% 980658 [para:979873.1.2,979876.1.1] -neq(sk1,X) | -segment^p(sk4,X) | -segment^p(X,sk3) | -ss^list(X) | -totalordered^p(X).
% 980660 [para:979873.1.2,980649.1.2] segment^p(sk2,sk1).
% 980661 [input:979877,cut:980660,cut:980648] ss^list(sk5).
% 980666 [input:979878,cut:980660,cut:980648] neq(sk1,sk5).
% 980670 [input:979879,cut:980660,cut:980648] segment^p(sk2,sk5).
% 980673 [input:979880,cut:980660,cut:980648] segment^p(sk5,sk1).
% 980675 [input:979881,cut:980660,cut:980648] totalordered^p(sk5).
% 980761 [binary:979870,979739.2] segment^p(sk3,sk3).
% 980762 [binary:979871,979739.2] segment^p(sk4,sk4).
% 980860 [para:979873.1.2,980761.1.1] segment^p(sk1,sk3).
% 980863 [para:979872.1.2,980762.1.2] segment^p(sk4,sk2).
% 981859 [binary:979868,979782.4] neq(sk1,X) | equal(sk1,X) | -ss^list(X).
% 982403 [binary:979868,979797.4] -neq(sk1,X) | -equal(sk1,X) | -ss^list(X).
% 985490 [binary:980860,979834,cut:979868,cut:979870] -segment^p(X,sk1) | segment^p(X,sk3) | -ss^list(X).
% 985497 [binary:980863,979834.2,cut:979871,cut:979869] -segment^p(sk2,X) | segment^p(sk4,X) | -ss^list(X).
% 1023382 [binary:980661,981859.3] neq(sk1,sk5) | equal(sk1,sk5).
% 1026828 [binary:980661,982403.3] -neq(sk1,sk5) | -equal(sk1,sk5).
% 1026860 [binary:980666,1026828] -equal(sk1,sk5).
% 1026861 [binary:1023382.2,1026860] neq(sk1,sk5).
% 1027587 [binary:980661,985490.3] -segment^p(sk5,sk1) | segment^p(sk5,sk3).
% 1027618 [binary:980673,1027587] segment^p(sk5,sk3).
% 1027996 [binary:980661,985497.3] -segment^p(sk2,sk5) | segment^p(sk4,sk5).
% 1028027 [binary:980670,1027996] segment^p(sk4,sk5).
% 1028034 [binary:980658.2,1028027,cut:1026861,cut:1027618] -ss^list(sk5) | -totalordered^p(sk5).
% 1028036 [binary:980661,1028034] -totalordered^p(sk5).
% 1028038 [binary:980675,1028036] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using binary resolution
% using term-depth-order strategy
% not using sos strategy
% using unit paramodulation 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: 10468
% derived clauses: 1707922
% kept clauses: 429875
% kept size sum: 747237
% kept mid-nuclei: 171390
% kept new demods: 36230
% forw unit-subs: 120752
% forw double-subs: 53671
% forw overdouble-subs: 45994
% backward subs: 757
% fast unit cutoff: 166826
% full unit cutoff: 128
% dbl unit cutoff: 7957
% real runtime : 214.33
% process. runtime: 212.81
% specific non-discr-tree subsumption statistics:
% tried: 8211971
% length fails: 138920
% strength fails: 1190333
% predlist fails: 4741132
% aux str. fails: 232599
% by-lit fails: 236190
% full subs tried: 1546760
% full subs fail: 1491190
%
% ; 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/SWC333-1+eq_r.in")
%
%------------------------------------------------------------------------------