TSTP Solution File: SET121-7 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SET121-7 : 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 : art04.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.6s
% Output : Assurance 29.6s
% 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/SET121-7+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(170,40,0,340,0,0,376973,4,2108,495738,5,2803,495739,1,2803,495739,50,2809,495739,40,2809,495909,0,2809)
%
%
% START OF PROOF
% 495740 [] equal(X,X).
% 495741 [] -member(X,Y) | -subclass(Y,Z) | member(X,Z).
% 495744 [] subclass(X,universal_class).
% 495748 [] -member(X,unordered_pair(Y,Z)) | equal(X,Y) | equal(X,Z).
% 495749 [] member(X,unordered_pair(X,Y)) | -member(X,universal_class).
% 495755 [] -member(ordered_pair(X,Y),cross_product(Z,U)) | member(Y,U).
% 495885 [] member(ordered_pair(X,Y),universal_class).
% 495894 [] member(ordered_pair(first(X),second(X)),cross_product(universal_class,universal_class)) | equal(first(X),X).
% 495896 [] equal(ordered_pair(first(X),second(X)),X) | equal(first(X),X).
% 495908 [] -member(y,universal_class).
% 495909 [] -equal(first(ordered_pair(x,y)),ordered_pair(x,y)).
% 495923 [binary:495908,495741.3,cut:495744] -member(y,X).
% 495964 [binary:495909,495748.2] -member(first(ordered_pair(x,y)),unordered_pair(ordered_pair(x,y),X)) | equal(first(ordered_pair(x,y)),X).
% 495975 [binary:495885,495749.2] member(ordered_pair(X,Y),unordered_pair(ordered_pair(X,Y),Z)).
% 495980 [binary:495909,495964.2] -member(first(ordered_pair(x,y)),unordered_pair(ordered_pair(x,y),ordered_pair(x,y))).
% 496042 [binary:495923,495755.2] -member(ordered_pair(X,y),cross_product(Y,Z)).
% 504656 [para:495896.2.1,495909.1.1,cut:495740] equal(ordered_pair(first(ordered_pair(x,y)),second(ordered_pair(x,y))),ordered_pair(x,y)).
% 509157 [para:495894.2.1,495980.1.1,demod:504656,cut:495975,cut:496042] 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: 1640
% derived clauses: 724277
% kept clauses: 90088
% kept size sum: 146532
% kept mid-nuclei: 131507
% kept new demods: 736
% forw unit-subs: 179378
% forw double-subs: 19020
% forw overdouble-subs: 6753
% backward subs: 15
% fast unit cutoff: 2221
% full unit cutoff: 133
% dbl unit cutoff: 97
% real runtime : 30.41
% process. runtime: 29.96
% specific non-discr-tree subsumption statistics:
% tried: 290591
% length fails: 56442
% strength fails: 10624
% predlist fails: 92970
% aux str. fails: 26286
% by-lit fails: 6759
% full subs tried: 77664
% full subs fail: 71119
%
% ; 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/SET121-7+eq_r.in")
%
%------------------------------------------------------------------------------