↑ Up

Gandalf---c-2.6.UNS-Ass.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : SWC023-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 : art08.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 20.0s
% Output   : Assurance 20.0s
% 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/SWC023-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(202,40,1,404,0,2,63316,4,2274,74892,5,2803,74893,1,2805,74893,50,2808,74893,40,2808,75095,0,2808)
% 
% 
% START OF PROOF
% 410 [?] ?
% 592 [?] ?
% 74902 [] ss^list(nil).
% 75009 [] -neq(X,Y) | -equal(X,Y) | -ss^list(Y) | -ss^list(X).
% 75081 [] ss^list(sk2).
% 75083 [] ss^list(sk4).
% 75084 [] equal(sk2,sk4).
% 75085 [] equal(sk1,sk3).
% 75086 [] neq(sk2,nil).
% 75087 [] -neq(X,nil) | -frontseg^p(sk2,X) | -frontseg^p(sk1,X) | -ss^list(X).
% 75088 [] equal(nil,sk4) | ss^list(sk5).
% 75090 [] neq(sk5,nil) | equal(nil,sk4).
% 75091 [] frontseg^p(sk4,sk5) | equal(nil,sk4).
% 75092 [] frontseg^p(sk3,sk5) | equal(nil,sk4).
% 75428 [binary:74902,75087.4,cut:410,cut:592] -neq(nil,nil).
% 75431 [para:75088.1.2,75084.1.2] equal(sk2,nil) | ss^list(sk5).
% 75443 [para:75090.2.2,75084.1.2] neq(sk5,nil) | equal(sk2,nil).
% 75448 [para:75084.1.2,75091.1.1] frontseg^p(sk2,sk5) | equal(nil,sk4).
% 75457 [para:75431.1.1,75086.1.1,cut:75428] ss^list(sk5).
% 75938 [para:75443.2.1,75086.1.1,cut:75428] neq(sk5,nil).
% 78492 [binary:75084,75009.2,cut:75083,cut:75081] -neq(sk2,sk4).
% 78579 [para:75092.2.2,78492.1.2,cut:75086] frontseg^p(sk3,sk5).
% 78580 [para:75448.2.2,78492.1.2,cut:75086] frontseg^p(sk2,sk5).
% 78690 [para:75085.1.2,78579.1.1] frontseg^p(sk1,sk5).
% 78691 [binary:75087.2,78580,cut:75938,cut:78690,cut:75457] 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:    486
%  derived clauses:   101188
%  kept clauses:      56185
%  kept size sum:     823438
%  kept mid-nuclei:   16534
%  kept new demods:   31039
%  forw unit-subs:    4085
%  forw double-subs: 12243
%  forw overdouble-subs: 773
%  backward subs:     27
%  fast unit cutoff:  1781
%  full unit cutoff:  0
%  dbl  unit cutoff:  82
%  real runtime  :  28.23
%  process. runtime:  28.23
% specific non-discr-tree subsumption statistics: 
%  tried:           71187
%  length fails:    4726
%  strength fails:  14867
%  predlist fails:  12765
%  aux str. fails:  7175
%  by-lit fails:    1213
%  full subs tried: 29515
%  full subs fail:  28533
% 
% ; 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/SWC023-1+eq_r.in")
% 
%------------------------------------------------------------------------------