TSTP Solution File: SET233-6 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SET233-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 29.5s
% Output : Assurance 29.5s
% 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/SET233-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(115,40,1,230,0,1,340716,4,2136,342463,5,2802,342464,1,2805,342464,50,2812,342464,40,2812,342579,0,2812)
%
%
% START OF PROOF
% 342467 [] member(not_subclass_element(X,Y),X) | subclass(X,Y).
% 342480 [] -member(ordered_pair(X,Y),cross_product(Z,U)) | member(Y,U).
% 342482 [] equal(ordered_pair(first(X),second(X)),X) | -member(X,cross_product(Y,Z)).
% 342578 [] -subclass(cross_product(x,y),z).
% 342579 [] -member(second(not_subclass_element(cross_product(x,y),z)),y).
% 342602 [binary:342578,342467.2] member(not_subclass_element(cross_product(x,y),z),cross_product(x,y)).
% 342697 [binary:342579,342480.2] -member(ordered_pair(X,second(not_subclass_element(cross_product(x,y),z))),cross_product(Y,y)).
% 350778 [para:342482.1.1,342697.1.1,slowcut:342602,slowcut:342602] 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: 1462
% derived clauses: 480374
% kept clauses: 86458
% kept size sum: 83042
% kept mid-nuclei: 7902
% kept new demods: 125
% forw unit-subs: 86988
% forw double-subs: 13257
% forw overdouble-subs: 843
% backward subs: 22
% fast unit cutoff: 203
% full unit cutoff: 0
% dbl unit cutoff: 22
% real runtime : 30.9
% process. runtime: 29.64
% specific non-discr-tree subsumption statistics:
% tried: 26993
% length fails: 1392
% strength fails: 364
% predlist fails: 13182
% aux str. fails: 1313
% by-lit fails: 22
% full subs tried: 10658
% full subs fail: 9820
%
% ; 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/SET233-6+eq_r.in")
%
%------------------------------------------------------------------------------