↑ Up

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

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : SET845-1 : TPTP v3.4.2. Released v3.2.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 i686
% CPU      : Intel(R) Pentium(R) 4 CPU 2.80GHz @ 2794MHz
% Memory   : 1003MB
% OS       : Linux 2.6.11-1.1369_FC4
% CPULimit : 600s

% Result   : Unsatisfiable 19.9s
% Output   : Assurance 19.9s
% 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: /tmp/SystemOnTPTP18263/SET/SET845-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 4 7)
% (binary-unit 28 #f 4 7)
% (binary-double 11 #f 4 7)
% (binary-double 17 #f)
% (binary-double 17 #t)
% (binary 87 #t 4 7)
% (binary-order 28 #f 4 7)
% (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(1368,40,5,2736,0,12,462401,4,2113)
% 
% 
% START OF PROOF
% 1495 [?] ?
% 1521 [] -c_in(X,c_uminus(Y,tc_set(Z)),Z) | -c_in(X,Y,Z).
% 461937 [?] ?
% 462411 [binary:461937,1521,cut:1495] contradiction
% END OF PROOF
% 
% Proof found by the following strategy:
% 
% using binary resolution
% not using sos strategy
% using dynamic demodulation
% using ordered paramodulation
% using kb ordering for equality
% preferring bigger arities for lex ordering
% clause length limited to 7
% clause depth limited to 4
% seconds given: 28
% 
% 
% old unit clauses discarded
% 
% ***GANDALF_FOUND_A_REFUTATION***
% 
% Global statistics over all passes: 
% 
%  given clauses:    2207
%  derived clauses:   1076378
%  kept clauses:      77031
%  kept size sum:     0
%  kept mid-nuclei:   8941
%  kept new demods:   32
%  forw unit-subs:    82235
%  forw double-subs: 1671
%  forw overdouble-subs: 361
%  backward subs:     17
%  fast unit cutoff:  370
%  full unit cutoff:  310
%  dbl  unit cutoff:  9
%  real runtime  :  21.21
%  process. runtime:  21.11
% specific non-discr-tree subsumption statistics: 
%  tried:           2377
%  length fails:    43
%  strength fails:  10
%  predlist fails:  110
%  aux str. fails:  2
%  by-lit fails:    3
%  full subs tried: 2201
%  full subs fail:  1840
% 
% ; program args: ("/home/graph/tptp/Systems/Gandalf---c-2.6/gandalf" "-time" "600" "/tmp/SystemOnTPTP18263/SET/SET845-1+eq_r.in")
% WARNING: TreeLimitedRun lost 19.90s, total lost is 19.90s
% 
%------------------------------------------------------------------------------