TSTP Solution File: SET236-6 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SET236-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 : 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 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/SET236-6+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(116,40,2,232,0,2,373794,4,2105,374749,5,2804,374750,1,2806,374750,50,2813,374750,40,2813,374866,0,2813)
%
%
% START OF PROOF
% 374752 [] -member(X,Y) | -subclass(Y,Z) | member(X,Z).
% 374753 [] member(not_subclass_element(X,Y),X) | subclass(X,Y).
% 374754 [] -member(not_subclass_element(X,Y),Y) | subclass(X,Y).
% 374768 [] equal(ordered_pair(first(X),second(X)),X) | -member(X,cross_product(Y,Z)).
% 374864 [] subclass(x,cross_product(universal_class,universal_class)).
% 374865 [] member(ordered_pair(first(not_subclass_element(x,y)),second(not_subclass_element(x,y))),y).
% 374866 [] -subclass(x,y).
% 374879 [binary:374864,374752.2] member(X,cross_product(universal_class,universal_class)) | -member(X,x).
% 374889 [binary:374866,374753.2] member(not_subclass_element(x,y),x).
% 374898 [binary:374866,374754.2] -member(not_subclass_element(x,y),y).
% 374918 [binary:374889,374879.2] member(not_subclass_element(x,y),cross_product(universal_class,universal_class)).
% 375055 [para:374768.1.1,374865.1.1,cut:374898,slowcut:374918] 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 9
% clause depth limited to 6
% seconds given: 28
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 736
% derived clauses: 488118
% kept clauses: 77211
% kept size sum: 1434
% kept mid-nuclei: 8413
% kept new demods: 80
% forw unit-subs: 85861
% forw double-subs: 10139
% forw overdouble-subs: 331
% backward subs: 9
% fast unit cutoff: 175
% full unit cutoff: 28
% dbl unit cutoff: 104
% real runtime : 28.12
% process. runtime: 28.12
% specific non-discr-tree subsumption statistics:
% tried: 4004
% length fails: 12
% strength fails: 19
% predlist fails: 2925
% aux str. fails: 10
% by-lit fails: 8
% full subs tried: 1020
% full subs fail: 694
%
% ; 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/SET236-6+eq_r.in")
%
%------------------------------------------------------------------------------