↑ Up

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

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : CAT009-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 : art06.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/CAT/CAT009-3+eq_r.in
% Using automatic strategy selection.
% Time limit in seconds: 600
% 
% prove-all-passes started
% 
% detected problem class: neq
% detected subclass: medium
% 
% strategies selected: 
% (hyper 25 #f 3 7)
% (binary-unit 9 #f 3 7)
% (binary-double 9 #f 3 7)
% (binary-double 15 #f)
% (binary-double 15 #t)
% (binary 50 #t 3 7)
% (binary-order 25 #f 3 7)
% (binary-posweight-order 101 #f)
% (binary-posweight-lex-big-order 25 #f)
% (binary-posweight-lex-small-order 9 #f)
% (binary-order-sos 50 #t)
% (binary-unit-uniteq 25 #f)
% (binary-weightorder 50 #f)
% (binary-order 50 #f)
% (hyper-order 30 #f)
% (binary 112 #t)
% 
% 
% ********* EMPTY CLAUSE DERIVED *********
% 
% 
% timer checkpoints: c(20,40,0,40,0,0,31283,4,1877,53163,5,2503,53163,1,2503,53163,50,2504,53163,40,2504,53183,0,2504)
% 
% 
% START OF PROOF
% 53164 [] equal(X,X).
% 53168 [] -there_exists(domain(X)) | there_exists(X).
% 53169 [] -there_exists(codomain(X)) | there_exists(X).
% 53170 [] -there_exists(compose(X,Y)) | there_exists(domain(X)).
% 53171 [] equal(domain(X),codomain(Y)) | -there_exists(compose(X,Y)).
% 53173 [] equal(compose(X,compose(Y,Z)),compose(compose(X,Y),Z)).
% 53174 [] equal(compose(X,domain(X)),X).
% 53182 [] there_exists(compose(a,b)).
% 53183 [] -equal(domain(compose(a,b)),domain(b)).
% 53196 [binary:53182,53170] there_exists(domain(a)).
% 53198 [para:53174.1.1,53170.1.1] there_exists(domain(X)) | -there_exists(X).
% 53206 [para:53171.1.1,53183.1.1,demod:53173] -there_exists(compose(a,compose(b,X))) | -equal(codomain(X),domain(b)).
% 53209 [para:53174.1.1,53171.2.1] equal(domain(X),codomain(domain(X))) | -there_exists(X).
% 53215 [para:53171.1.1,53196.1.1,binarydemod:53169] -there_exists(compose(a,X)) | there_exists(X).
% 53218 [binary:53182,53198.2,binarydemod:53215,53168] there_exists(b).
% 53357 [binary:53218,53209.2] equal(domain(b),codomain(domain(b))).
% 53392 [para:53174.1.1,53206.1.1.2,demod:53357,cut:53182,cut:53164] 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 7
% clause depth limited to 3
% seconds given: 9
% 
% 
% ***GANDALF_FOUND_A_REFUTATION***
% 
% Global statistics over all passes: 
% 
%  given clauses:    508
%  derived clauses:   337277
%  kept clauses:      45339
%  kept size sum:     1492
%  kept mid-nuclei:   1919
%  kept new demods:   23
%  forw unit-subs:    6767
%  forw double-subs: 3978
%  forw overdouble-subs: 38151
%  backward subs:     6
%  fast unit cutoff:  210
%  full unit cutoff:  0
%  dbl  unit cutoff:  539
%  real runtime  :  25.5
%  process. runtime:  25.5
% specific non-discr-tree subsumption statistics: 
%  tried:           11677911
%  length fails:    1260607
%  strength fails:  2136903
%  predlist fails:  1067822
%  aux str. fails:  515515
%  by-lit fails:    622220
%  full subs tried: 5075295
%  full subs fail:  5037856
% 
% ; 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/CAT/CAT009-3+eq_r.in")
% 
%------------------------------------------------------------------------------