TSTP Solution File: SET094-6 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SET094-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 30.0s
% Output : Assurance 30.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/SET094-6+eq_r.in
% Using automatic strategy selection.
% Time limit in seconds: 600
%
% prove-all-passes started
%
% detected problem class: neq
% detected subclass: medium
%
% strategies selected:
% (hyper 25 #f 6 9)
% (binary-unit 9 #f 6 9)
% (binary-double 9 #f 6 9)
% (binary-double 15 #f)
% (binary-double 15 #t)
% (binary 50 #t 6 9)
% (binary-order 25 #f 6 9)
% (binary-posweight-order 101 #f)
% (binary-posweight-lex-big-order 25 #f)
% (binary-posweight-lex-small-order 9 #f)
% (binary-order-sos 50 #t)
% (binary-unit-uniteq 25 #f)
% (binary-weightorder 50 #f)
% (binary-order 50 #f)
% (hyper-order 30 #f)
% (binary 112 #t)
%
%
% ********* EMPTY CLAUSE DERIVED *********
%
%
% timer checkpoints: c(95,40,1,190,0,1,453746,4,1895,455876,5,2503,455877,1,2506,455877,50,2513,455877,40,2513,455972,0,2513,469508,3,2971,472246,4,3189,485390,5,3414,485390,5,3414,485391,1,3414,485391,50,3416,485391,40,3416,485486,0,3416)
%
%
% START OF PROOF
% 485397 [] -equal(X,Y) | subclass(X,Y).
% 485398 [] -equal(X,Y) | subclass(Y,X).
% 485399 [] -subclass(Y,X) | -subclass(X,Y) | equal(X,Y).
% 485400 [] -member(X,unordered_pair(Y,Z)) | equal(X,Y) | equal(X,Z).
% 485404 [] equal(unordered_pair(X,X),singleton(X)).
% 485484 [] equal(singleton(member_of(x)),x).
% 485485 [] member(y,x).
% 485486 [] -equal(member_of(x),y).
% 485487 [input:485400,factor] -member(X,unordered_pair(Y,Y)) | equal(X,Y).
% 485530 [para:485404.1.2,485484.1.1] equal(unordered_pair(member_of(x),member_of(x)),x).
% 485549 [binary:485397.2,485399] -subclass(X,Y) | -equal(Y,X) | equal(X,Y).
% 492169 [binary:485398.2,485549] -equal(X,Y) | equal(Y,X).
% 492180 [binary:485486,492169.2] -equal(y,member_of(x)).
% 492194 [binary:485487.2,492180,demod:485530,cut:485485] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using binary resolution
% not 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
% clause length limited to 9
% clause depth limited to 6
% seconds given: 9
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 2160
% derived clauses: 631342
% kept clauses: 99580
% kept size sum: 240320
% kept mid-nuclei: 21341
% kept new demods: 200
% forw unit-subs: 118639
% forw double-subs: 13545
% forw overdouble-subs: 948
% backward subs: 77
% fast unit cutoff: 495
% full unit cutoff: 13
% dbl unit cutoff: 119
% real runtime : 34.83
% process. runtime: 34.82
% specific non-discr-tree subsumption statistics:
% tried: 19478
% length fails: 1279
% strength fails: 550
% predlist fails: 12033
% aux str. fails: 100
% by-lit fails: 21
% full subs tried: 5357
% full subs fail: 4422
%
% ; 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/SET094-6+eq_r.in")
%
%------------------------------------------------------------------------------