↑ Up

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

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : HEN010-7 : 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 : art05.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 0.0s
% Output   : Assurance 0.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/HEN/HEN010-7+eq_r.in
% Using automatic strategy selection.
% Time limit in seconds: 600
% 
% prove-all-passes started
% 
% detected problem class: heq
% detected subclass: medium
% detected subclass: long
% 
% strategies selected: 
% (hyper 58 #f 2 11)
% (binary-posweight-order 29 #f 2 11)
% (binary-unit 29 #f 2 11)
% (binary-double 29 #f 2 11)
% (binary 29 #t 2 11)
% (hyper 29 #t)
% (hyper 105 #f)
% (binary-unit-uniteq 17 #f)
% (binary-weightorder 23 #f)
% (binary-posweight-order 70 #f)
% (binary-posweight-lex-big-order 29 #f)
% (binary-posweight-lex-small-order 11 #f)
% (binary-order 29 #f)
% (binary-unit 46 #f)
% (binary 67 #t)
% 
% 
% ********* EMPTY CLAUSE DERIVED *********
% 
% 
% timer checkpoints: c(22,40,0,44,0,0)
% 
% 
% START OF PROOF
% 25 [] -quotient(X,Y,zero) | less_equal(X,Y).
% 26 [] -quotient(X,Y,Z) | less_equal(Z,X).
% 27 [] -quotient(Z,U,X2) | -quotient(V,W,X1) | -quotient(Y,U,W) | -quotient(X,U,V) | -quotient(X,Y,Z) | less_equal(X1,X2).
% 29 [] -less_equal(Y,X) | -less_equal(X,Y) | equal(X,Y).
% 30 [] less_equal(X,identity).
% 31 [] quotient(X,Y,divide(X,Y)).
% 35 [] quotient(X,X,zero).
% 36 [] quotient(X,zero,X).
% 38 [] -quotient(X,Y,Z) | -quotient(X,U,V) | -less_equal(V,Y) | less_equal(Z,U).
% 39 [] -quotient(X,Y,Z) | -quotient(X,U,V) | -less_equal(Y,U) | less_equal(V,Z).
% 40 [] -quotient(X,Y,Z) | -quotient(U,Y,V) | -less_equal(U,X) | less_equal(V,Z).
% 41 [] quotient(identity,a,id^qa).
% 42 [] quotient(identity,id^qa,id^q_id^qa).
% 43 [] quotient(id^qa,id^q_id^qa,id^qa_^q__id^q_id^qa).
% 44 [] -equal(id^qa,id^qa_^q__id^q_id^qa).
% 58 [hyper:25,35] less_equal(X,X).
% 577 [hyper:38,42,41,cut:58] less_equal(id^q_id^qa,a).
% 600 [hyper:26,43] less_equal(id^qa_^q__id^q_id^qa,id^qa).
% 1165 [hyper:27,31,36,41,41,cut:35] less_equal(id^qa,divide(id^qa,a)).
% 2460 [hyper:40,31,41,cut:30] less_equal(divide(X,a),id^qa).
% 4801 [hyper:29,1165,cut:2460] equal(divide(id^qa,a),id^qa).
% 4961 [hyper:39,31,43,577,demod:4801] less_equal(id^qa,id^qa_^q__id^q_id^qa).
% 5046 [hyper:29,4961,cut:600] equal(id^qa,id^qa_^q__id^q_id^qa).
% 5088 [hyper:44,5046] contradiction
% END OF PROOF
% 
% Proof found by the following strategy:
% 
% using hyperresolution
% not using sos strategy
% using positive unit paramodulation strategy
% using dynamic demodulation
% using ordered paramodulation
% using kb ordering for equality
% preferring bigger arities for lex ordering
% clause length limited to 11
% clause depth limited to 2
% seconds given: 58
% 
% 
% ***GANDALF_FOUND_A_REFUTATION***
% 
% Global statistics over all passes: 
% 
%  given clauses:    57
%  derived clauses:   13648
%  kept clauses:      117
%  kept size sum:     671
%  kept mid-nuclei:   4862
%  kept new demods:   15
%  forw unit-subs:    6934
%  forw double-subs: 865
%  forw overdouble-subs: 0
%  backward subs:     6
%  fast unit cutoff:  53
%  full unit cutoff:  55
%  dbl  unit cutoff:  0
%  real runtime  :  0.18
%  process. runtime:  0.18
% specific non-discr-tree subsumption statistics: 
%  tried:           4835
%  length fails:    0
%  strength fails:  2009
%  predlist fails:  1945
%  aux str. fails:  879
%  by-lit fails:    0
%  full subs tried: 2
%  full subs fail:  2
% 
% ; 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/HEN/HEN010-7+eq_r.in")
% 
%------------------------------------------------------------------------------