↑ Up

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

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : SET072-6 : TPTP v3.4.2. Bugfixed v2.1.0.
% Transfm  : add_equality:r
% Format   : otter:hypothesis:set(auto),clear(print_given)
% Command  : gandalf-wrapper -time %d %s

% Computer : art10.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/SET/SET072-6+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 6 9)
% (binary-unit 9 #f 6 9)
% (binary-double 9 #f 6 9)
% (binary-double 15 #f)
% (binary-double 15 #t)
% (binary 50 #t 6 9)
% (binary-order 25 #f 6 9)
% (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(95,40,2,190,0,2,390142,4,1894)
% 
% 
% START OF PROOF
% 101 [] -equal(X,Y) | subclass(X,Y).
% 102 [] -equal(X,Y) | subclass(Y,X).
% 103 [] -subclass(Y,X) | -subclass(X,Y) | equal(X,Y).
% 104 [] -member(X,unordered_pair(Y,Z)) | equal(X,Y) | equal(X,Z).
% 105 [] member(X,unordered_pair(X,Y)) | -member(X,universal_class).
% 110 [] -member(ordered_pair(X,Y),cross_product(Z,U)) | member(X,Z).
% 111 [] -member(ordered_pair(X,Y),cross_product(Z,U)) | member(Y,U).
% 188 [] equal(unordered_pair(x,z),unordered_pair(y,z)).
% 189 [] member(ordered_pair(x,y),cross_product(universal_class,universal_class)).
% 190 [] -equal(x,y).
% 240 [hyper:110,189] member(x,universal_class).
% 241 [hyper:111,189] member(y,universal_class).
% 291 [hyper:105,240] member(x,unordered_pair(x,X)).
% 318 [hyper:105,241] member(y,unordered_pair(y,X)).
% 1173 [para:188.1.2,318.1.2] member(y,unordered_pair(x,z)).
% 3453 [hyper:104,1173] equal(y,x) | equal(y,z).
% 7317 [hyper:101,3453] subclass(y,x) | equal(y,z).
% 7319 [hyper:102,3453] subclass(x,y) | equal(y,z).
% 18071 [hyper:101,7317] subclass(y,x) | subclass(y,z).
% 24254 [hyper:103,18071,7319,cut:190,binarycut:101] subclass(y,z).
% 24280 [hyper:103,7317,binarycut:7319,cut:190] equal(y,z).
% 24281 [hyper:102,24280] subclass(z,y).
% 24282 [para:24280.1.1,188.1.2.1] equal(unordered_pair(x,z),unordered_pair(z,z)).
% 24323 [hyper:103,24281,cut:24254] equal(z,y).
% 197964 [para:24282.1.1,291.1.2] member(x,unordered_pair(z,z)).
% 197969 [hyper:104,197964] equal(x,z).
% 199479 [hyper:101,197969] subclass(x,z).
% 199480 [hyper:102,197969] subclass(z,x).
% 199526 [hyper:103,199479,cut:199480] equal(z,x).
% 390492 [para:199526.1.2,190.1.1,cut:24323] 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 9
% clause depth limited to 6
% seconds given: 25
% 
% 
% old unit clauses discarded
% 
% ***GANDALF_FOUND_A_REFUTATION***
% 
% Global statistics over all passes: 
% 
%  given clauses:    584
%  derived clauses:   472999
%  kept clauses:      77046
%  kept size sum:     0
%  kept mid-nuclei:   7553
%  kept new demods:   51
%  forw unit-subs:    72489
%  forw double-subs: 9625
%  forw overdouble-subs: 407
%  backward subs:     15
%  fast unit cutoff:  122
%  full unit cutoff:  0
%  dbl  unit cutoff:  52
%  real runtime  :  23.50
%  process. runtime:  23.50
% specific non-discr-tree subsumption statistics: 
%  tried:           1003
%  length fails:    10
%  strength fails:  33
%  predlist fails:  303
%  aux str. fails:  9
%  by-lit fails:    2
%  full subs tried: 639
%  full subs fail:  238
% 
% ; 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/SET072-6+eq_r.in")
% 
%------------------------------------------------------------------------------