TSTP Solution File: SWC277-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SWC277-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 : art03.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/SWC277-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)
%
%
% SOS clause
% singleton^p(sk3) | -neq(sk4,nil).
% was split for some strategies as:
% singleton^p(sk3).
% -neq(sk4,nil).
%
% ********* EMPTY CLAUSE DERIVED *********
%
%
% timer checkpoints: c(195,40,1,390,0,1,35092,4,1129,36603,5,1304,36604,1,1304,36604,50,1305,36604,40,1305,36799,0,1317,78497,3,1970,96126,4,2293)
%
%
% START OF PROOF
% 36609 [] totalordered^p(nil).
% 36613 [] ss^list(nil).
% 36652 [] ss^item(skaf44(X)).
% 36672 [] totalordered^p(cons(X,nil)) | -ss^item(X).
% 36679 [] equal(app(nil,X),X) | -ss^list(X).
% 36684 [] -equal(nil,X) | segment^p(nil,X) | -ss^list(X).
% 36685 [] -segment^p(nil,X) | equal(nil,X) | -ss^list(X).
% 36687 [] -rearseg^p(nil,X) | equal(nil,X) | -ss^list(X).
% 36705 [] neq(X,Y) | equal(X,Y) | -ss^list(Y) | -ss^list(X).
% 36706 [] equal(cons(skaf44(X),nil),X) | -singleton^p(X) | -ss^list(X).
% 36748 [] -equal(app(X,Y),Z) | rearseg^p(Z,Y) | -ss^list(Z) | -ss^list(Y) | -ss^list(X).
% 36791 [] ss^list(sk1).
% 36792 [] ss^list(sk2).
% 36795 [] equal(sk2,sk4).
% 36796 [] equal(sk1,sk3).
% 36797 [] segment^p(sk4,sk3).
% 36798 [] -totalordered^p(sk1).
% 36799 [] -neq(sk4,nil) | singleton^p(sk3).
% 36840 [input:36748,factor:factor] -equal(app(X,Y),X) | rearseg^p(X,Y) | -ss^list(X) | -ss^list(Y).
% 37566 [para:36795.1.2,36797.1.1] segment^p(sk2,sk3).
% 37569 [para:36795.1.2,36799.1.1] -neq(sk2,nil) | singleton^p(sk3).
% 37571 [para:36796.1.2,37566.1.2] segment^p(sk2,sk1).
% 37573 [para:36796.1.2,37569.2.1] -neq(sk2,nil) | singleton^p(sk1).
% 37908 [binary:36652,36672.2] totalordered^p(cons(skaf44(X),nil)).
% 38049 [binary:36792,36679.2] equal(app(nil,sk2),sk2).
% 38115 [binary:36791,36685.3] -segment^p(nil,sk1) | equal(nil,sk1).
% 38116 [binary:36792,36685.3] -segment^p(nil,sk2) | equal(nil,sk2).
% 46480 [para:36706.1.1,37908.1.1] -singleton^p(X) | -ss^list(X) | totalordered^p(X).
% 49819 [para:38115.2.2,36798.1.1,cut:36609] -segment^p(nil,sk1).
% 61376 [para:38116.2.2,37571.1.1,cut:49819] -segment^p(nil,sk2).
% 61377 [binary:36684.2,61376,cut:36792] -equal(nil,sk2).
% 61602 [binary:36687.2,61377,cut:36792] -rearseg^p(nil,sk2).
% 63034 [para:38049.1.1,36840.1.1,cut:61602,cut:36613,cut:36792] -equal(sk2,nil).
% 63180 [binary:36705.2,63034,cut:36613,cut:36792] neq(sk2,nil).
% 63419 [binary:37573,63180] singleton^p(sk1).
% 105853 [binary:63419,46480,cut:36791,cut:36798] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using binary resolution
% 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: 13
%
%
% old unit clauses discarded
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 1294
% derived clauses: 147377
% kept clauses: 79626
% kept size sum: 0
% kept mid-nuclei: 21059
% kept new demods: 19471
% forw unit-subs: 16007
% forw double-subs: 4474
% forw overdouble-subs: 2744
% backward subs: 24
% fast unit cutoff: 15387
% full unit cutoff: 0
% dbl unit cutoff: 285
% real runtime : 25.0
% process. runtime: 24.51
% specific non-discr-tree subsumption statistics:
% tried: 683569
% length fails: 17475
% strength fails: 54286
% predlist fails: 492913
% aux str. fails: 16573
% by-lit fails: 10170
% full subs tried: 73803
% full subs fail: 70804
%
% ; 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/SWC277-1+eq_r.in")
%
%------------------------------------------------------------------------------