TSTP Solution File: NUM066-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : NUM066-1 : 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 79.2s
% Output : Assurance 79.2s
% 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/NUM/NUM066-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 6 9)
% (binary-unit 28 #f 6 9)
% (binary-double 11 #f 6 9)
% (binary-double 17 #f)
% (binary-double 17 #t)
% (binary 87 #t 6 9)
% (binary-order 28 #f 6 9)
% (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(163,40,1,326,0,1,293627,4,2106,294652,5,2803,294653,1,2803,294653,50,2810,294653,40,2810,294816,0,2827,318328,3,4229,321181,4,4929,335269,5,5628,335270,5,5629,335270,1,5629,335270,50,5632,335270,40,5632,335433,0,5632,363525,3,6183,367133,4,6458,376954,5,6733,376955,5,6736,376956,1,6736,376956,50,6743,376956,40,6743,377119,0,6743,408450,3,7595,412701,4,8035,421294,5,8444,421295,5,8444,421296,1,8444,421296,50,8447,421296,40,8447,421459,0,8447)
%
%
% START OF PROOF
% 421298 [] -member(X,Y) | -subclass(Y,Z) | member(X,Z).
% 421299 [] member(not_subclass_element(X,Y),X) | subclass(X,Y).
% 421301 [] subclass(X,universal_class).
% 421313 [] member(ordered_pair(X,Y),cross_product(Z,U)) | -member(Y,U) | -member(X,Z).
% 421317 [] -member(ordered_pair(X,Y),cross_product(universal_class,universal_class)) | member(ordered_pair(X,Y),element_relation) | -member(X,Y).
% 421321 [] -member(X,complement(Y)) | -member(X,Y).
% 421422 [] member(least(X,Y),Y) | -well_ordering(X,Z) | -member(U,Y) | -subclass(Y,Z).
% 421424 [] -member(ordered_pair(X,least(Y,Z)),Y) | -well_ordering(Y,U) | -member(X,Z) | -subclass(Z,U).
% 421456 [] well_ordering(element_relation,y).
% 421457 [] subclass(u,y).
% 421458 [] member(v,u).
% 421459 [] member(v,least(element_relation,u)).
% 421462 [binary:421422.2,421456] member(least(element_relation,X),X) | -subclass(X,y) | -member(Y,X).
% 421464 [binary:421424.2,421456] -member(ordered_pair(X,least(element_relation,Y)),element_relation) | -subclass(Y,y) | -member(X,Y).
% 421467 [binary:421298.2,421457] -member(X,u) | member(X,y).
% 421476 [binary:421298,421458] -subclass(u,X) | member(v,X).
% 421538 [binary:421458,421467] member(v,y).
% 421545 [binary:421321.2,421538] -member(v,complement(y)).
% 421572 [binary:421301,421476] member(v,universal_class).
% 421616 [binary:421545,421476.2] -subclass(u,complement(y)).
% 421718 [binary:421299.2,421616] member(not_subclass_element(u,complement(y)),u).
% 421783 [binary:421457,421462.2,slowcut:421718] member(least(element_relation,u),u).
% 421786 [binary:421467,421462,cut:421457,slowcut:421783] member(least(element_relation,u),y).
% 421897 [binary:421458,421464.3,cut:421457] -member(ordered_pair(v,least(element_relation,u)),element_relation).
% 424014 [binary:421317.3,421459,cut:421897] -member(ordered_pair(v,least(element_relation,u)),cross_product(universal_class,universal_class)).
% 424018 [binary:421313,424014,cut:421572] -member(least(element_relation,u),universal_class).
% 424025 [binary:421298.3,424018,cut:421301,slowcut:421786] 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: 5643
% derived clauses: 684095
% kept clauses: 170652
% kept size sum: 29315
% kept mid-nuclei: 54080
% kept new demods: 380
% forw unit-subs: 210535
% forw double-subs: 42684
% forw overdouble-subs: 5418
% backward subs: 176
% fast unit cutoff: 2334
% full unit cutoff: 1293
% dbl unit cutoff: 424
% real runtime : 85.52
% process. runtime: 84.62
% specific non-discr-tree subsumption statistics:
% tried: 179667
% length fails: 12834
% strength fails: 30484
% predlist fails: 61063
% aux str. fails: 4566
% by-lit fails: 8673
% full subs tried: 41245
% full subs fail: 35951
%
% ; 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/NUM/NUM066-1+eq_r.in")
%
%------------------------------------------------------------------------------