TSTP Solution File: SWC049-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SWC049-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 : art09.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.4s
% Output : Assurance 49.4s
% 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/SWC049-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(197,40,0,394,0,1,53373,4,2201,55264,5,2803,55265,1,2805,55265,50,2807,55265,40,2807,55462,0,2808,149425,3,4211,175224,4,4910,193801,5,5609,193802,5,5611,193803,1,5611,193803,50,5615,193803,40,5615,194000,0,5615)
%
%
% START OF PROOF
% 193804 [] equal(X,X).
% 193812 [] ss^list(nil).
% 193863 [] rearseg^p(X,X) | -ss^list(X).
% 193877 [] equal(app(X,nil),X) | -ss^list(X).
% 193904 [] neq(X,Y) | equal(X,Y) | -ss^list(Y) | -ss^list(X).
% 193919 [] -neq(X,Y) | -equal(X,Y) | -ss^list(Y) | -ss^list(X).
% 193922 [] -equal(app(X,Y),nil) | equal(nil,X) | -ss^list(X) | -ss^list(Y).
% 193990 [] ss^list(sk1).
% 193991 [] ss^list(sk2).
% 193992 [] ss^list(sk3).
% 193994 [] equal(sk2,sk4).
% 193995 [] equal(sk1,sk3).
% 193996 [] -neq(X,nil) | -rearseg^p(sk2,X) | -rearseg^p(sk1,X) | -ss^list(X).
% 193997 [] -equal(nil,sk4) | equal(nil,sk3).
% 193998 [] -equal(nil,sk2) | -equal(nil,sk1).
% 193999 [] -neq(sk4,nil) | neq(sk3,nil).
% 194000 [] -neq(sk4,nil) | rearseg^p(sk4,sk3).
% 194014 [input:193919,factor:cut:193804] -neq(X,X) | -ss^list(X).
% 194774 [para:193994.1.2,193997.1.2] -equal(nil,sk2) | equal(nil,sk3).
% 194780 [para:193994.1.2,193999.1.1] -neq(sk2,nil) | neq(sk3,nil).
% 194788 [para:193994.1.2,194000.1.1] -neq(sk2,nil) | rearseg^p(sk4,sk3).
% 194950 [binary:193992,193863.2] rearseg^p(sk3,sk3).
% 195053 [para:193995.1.2,194950.1.1] rearseg^p(sk1,sk3).
% 195306 [binary:193991,193877.2] equal(app(sk2,nil),sk2).
% 196374 [binary:193992,194014.2] -neq(sk3,sk3).
% 196440 [para:193995.1.2,196374.1.2] -neq(sk3,sk1).
% 196480 [para:194774.2.2,196440.1.1] -neq(nil,sk1) | -equal(nil,sk2).
% 196832 [binary:193998.2,193904.2,cut:193990,cut:193812,binarycut:196480] -equal(nil,sk2).
% 200698 [para:195306.1.1,193922.1.1,cut:196832,cut:193991,cut:193812] -equal(sk2,nil).
% 200951 [binary:193904.2,200698,cut:193812,cut:193991] neq(sk2,nil).
% 200960 [binary:194780,200951] neq(sk3,nil).
% 200961 [binary:194788,200951] rearseg^p(sk4,sk3).
% 200973 [binary:193996,200960,cut:195053,cut:193992] -rearseg^p(sk2,sk3).
% 200986 [para:193994.1.2,200961.1.1,cut:200973] 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: 1989
% derived clauses: 301124
% kept clauses: 123792
% kept size sum: 67979
% kept mid-nuclei: 33228
% kept new demods: 33389
% forw unit-subs: 20342
% forw double-subs: 6339
% forw overdouble-subs: 3800
% backward subs: 34
% fast unit cutoff: 18489
% full unit cutoff: 0
% dbl unit cutoff: 374
% real runtime : 57.10
% process. runtime: 56.54
% specific non-discr-tree subsumption statistics:
% tried: 976497
% length fails: 1651
% strength fails: 84769
% predlist fails: 673721
% aux str. fails: 25275
% by-lit fails: 30458
% full subs tried: 137725
% full subs fail: 133292
%
% ; 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/SWC049-1+eq_r.in")
%
%------------------------------------------------------------------------------