↑ Up

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

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : SET031-3 : TPTP v3.4.2. Released v1.0.0.
% Transfm  : add_equality:r
% Format   : otter:hypothesis:set(auto),clear(print_given)
% Command  : gandalf-wrapper -time %d %s

% Computer : art02.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 79.0s
% Output   : Assurance 79.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/SET/SET031-3+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 15)
% (binary-unit 28 #f 4 15)
% (binary-double 11 #f 4 15)
% (binary-double 17 #f)
% (binary-double 17 #t)
% (binary 87 #t 4 15)
% (binary-order 28 #f 4 15)
% (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(158,40,1,316,0,1,434381,4,2180,670606,5,2802,670607,1,2802,670607,50,2804,670607,40,2804,670765,0,2804,720484,3,4205,730997,4,4908,753372,5,5605,753372,5,5606,753373,1,5606,753373,50,5609,753373,40,5609,753531,0,5609,783944,3,6160,786376,4,6435,797128,5,6710,797129,5,6710,797130,1,6711,797130,50,6712,797130,40,6712,797288,0,6712,842916,3,7564,855330,4,8026,899138,5,8413,899140,5,8414,899141,1,8414,899141,50,8416,899141,40,8416,899299,0,8416)
% 
% 
% START OF PROOF
% 899156 [] -equal(X,ordered_pair(Y,Z)) | -little_set(Z) | -little_set(Y) | ordered_pair_predicate(X).
% 899219 [] member(f18(X),X) | relation(X).
% 899220 [] -ordered_pair_predicate(f18(X)) | relation(X).
% 899270 [] -member(X,compose(Y,Z)) | little_set(f29(X,Y,Z)).
% 899271 [] -member(X,compose(Y,Z)) | little_set(f30(X,Y,Z)).
% 899273 [] equal(X,ordered_pair(f29(X,Y,Z),f30(X,Y,Z))) | -member(X,compose(Y,Z)).
% 899299 [] -relation(compose(a,b)).
% 899300 [binary:899219.2,899299] member(f18(compose(a,b)),compose(a,b)).
% 899301 [binary:899220.2,899299] -ordered_pair_predicate(f18(compose(a,b))).
% 899324 [binary:899270,899300] little_set(f29(f18(compose(a,b)),a,b)).
% 899325 [binary:899271,899300] little_set(f30(f18(compose(a,b)),a,b)).
% 899327 [binary:899273.2,899300] equal(f18(compose(a,b)),ordered_pair(f29(f18(compose(a,b)),a,b),f30(f18(compose(a,b)),a,b))).
% 901438 [binary:899156,899327,cut:899325,cut:899324,cut:899301] contradiction
% END OF PROOF
% 
% Proof found by the following strategy:
% 
% using binary resolution
% 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
% seconds given: 17
% 
% 
% ***GANDALF_FOUND_A_REFUTATION***
% 
% Global statistics over all passes: 
% 
%  given clauses:    5062
%  derived clauses:   2249973
%  kept clauses:      221536
%  kept size sum:     39394
%  kept mid-nuclei:   127870
%  kept new demods:   502
%  forw unit-subs:    721298
%  forw double-subs: 95220
%  forw overdouble-subs: 46811
%  backward subs:     127
%  fast unit cutoff:  19778
%  full unit cutoff:  5390
%  dbl  unit cutoff:  642
%  real runtime  :  85.42
%  process. runtime:  84.36
% specific non-discr-tree subsumption statistics: 
%  tried:           8985544
%  length fails:    175460
%  strength fails:  1271978
%  predlist fails:  5133000
%  aux str. fails:  212724
%  by-lit fails:    79530
%  full subs tried: 2059631
%  full subs fail:  2011185
% 
% ; 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/SET/SET031-3+eq_r.in")
% 
%------------------------------------------------------------------------------