TSTP Solution File: SET120-7 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SET120-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.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/SET120-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(168,40,0,336,0,1,376986,4,2109,495788,5,2802,495789,1,2802,495789,50,2808,495789,40,2808,495957,0,2808)
%
%
% START OF PROOF
% 495790 [] equal(X,X).
% 495791 [] -member(X,Y) | -subclass(Y,Z) | member(X,Z).
% 495794 [] subclass(X,universal_class).
% 495798 [] -member(X,unordered_pair(Y,Z)) | equal(X,Y) | equal(X,Z).
% 495799 [] member(X,unordered_pair(X,Y)) | -member(X,universal_class).
% 495804 [] -member(ordered_pair(X,Y),cross_product(Z,U)) | member(X,Z).
% 495935 [] member(ordered_pair(X,Y),universal_class).
% 495945 [] member(ordered_pair(first(X),second(X)),cross_product(universal_class,universal_class)) | equal(second(X),X).
% 495947 [] equal(ordered_pair(first(X),second(X)),X) | equal(second(X),X).
% 495956 [] -member(x,universal_class).
% 495957 [] -equal(second(ordered_pair(x,y)),ordered_pair(x,y)).
% 495971 [binary:495956,495791.3,cut:495794] -member(x,X).
% 496012 [binary:495957,495798.2] -member(second(ordered_pair(x,y)),unordered_pair(ordered_pair(x,y),X)) | equal(second(ordered_pair(x,y)),X).
% 496023 [binary:495935,495799.2] member(ordered_pair(X,Y),unordered_pair(ordered_pair(X,Y),Z)).
% 496028 [binary:495957,496012.2] -member(second(ordered_pair(x,y)),unordered_pair(ordered_pair(x,y),ordered_pair(x,y))).
% 496074 [binary:495971,495804.2] -member(ordered_pair(x,X),cross_product(Y,Z)).
% 504780 [para:495947.2.1,495957.1.1,cut:495790] equal(ordered_pair(first(ordered_pair(x,y)),second(ordered_pair(x,y))),ordered_pair(x,y)).
% 508905 [para:495945.2.1,496028.1.1,demod:504780,cut:496023,cut:496074] 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: 1628
% derived clauses: 721677
% kept clauses: 89790
% kept size sum: 143933
% kept mid-nuclei: 131483
% kept new demods: 721
% forw unit-subs: 178089
% forw double-subs: 18905
% forw overdouble-subs: 6738
% backward subs: 16
% fast unit cutoff: 2126
% full unit cutoff: 139
% dbl unit cutoff: 99
% real runtime : 30.40
% process. runtime: 29.90
% specific non-discr-tree subsumption statistics:
% tried: 290217
% length fails: 55274
% strength fails: 10448
% predlist fails: 94510
% aux str. fails: 25533
% by-lit fails: 6891
% full subs tried: 77667
% full subs fail: 71137
%
% ; 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/SET120-7+eq_r.in")
%
%------------------------------------------------------------------------------