TSTP Solution File: SET024-4 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SET024-4 : TPTP v3.4.2. Released v1.0.0.
% Transfm : add_equality:r
% Format : otter:hypothesis:set(auto),clear(print_given)
% Command : gandalf-wrapper -time %d %s
% Computer : art02.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/SET024-4+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 4 15)
% (binary-unit 28 #f 4 15)
% (binary-double 11 #f 4 15)
% (binary-double 17 #f)
% (binary-double 17 #t)
% (binary 87 #t 4 15)
% (binary-order 28 #f 4 15)
% (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(144,40,2,288,0,2,262793,4,2139)
%
%
% START OF PROOF
% 145 [] equal(X,X).
% 151 [] member(X,non_ordered_pair(Y,Z)) | -equal(X,Y) | -little_set(X).
% 154 [] equal(singleton_set(X),non_ordered_pair(X,X)).
% 287 [] little_set(a).
% 288 [] -member(a,singleton_set(a)).
% 379 [hyper:151,145,287] member(a,non_ordered_pair(a,X)).
% 276352 [para:154.1.1,288.1.2,cut:379] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using binary resolution
% not using sos strategy
% using dynamic demodulation
% using ordered paramodulation
% using kb ordering for equality
% preferring bigger arities for lex ordering
% clause length limited to 15
% clause depth limited to 4
% seconds given: 28
%
%
% old unit clauses discarded
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 151
% derived clauses: 1378222
% kept clauses: 77007
% kept size sum: 0
% kept mid-nuclei: 32771
% kept new demods: 17
% forw unit-subs: 2823
% forw double-subs: 40315
% forw overdouble-subs: 56910
% backward subs: 0
% fast unit cutoff: 2750
% full unit cutoff: 6
% dbl unit cutoff: 0
% real runtime : 25.43
% process. runtime: 25.41
% specific non-discr-tree subsumption statistics:
% tried: 1533403
% length fails: 63977
% strength fails: 659577
% predlist fails: 373746
% aux str. fails: 6358
% by-lit fails: 22702
% full subs tried: 375479
% full subs fail: 328142
%
% ; 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/SET024-4+eq_r.in")
%
%------------------------------------------------------------------------------