TSTP Solution File: SET025-9 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SET025-9 : 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 : 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 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/SET025-9+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,1,288,0,1,326413,4,2476,360041,5,2802,360042,1,2802,360042,50,2806,360042,40,2806,360186,0,2806)
%
%
% START OF PROOF
% 360051 [] little_set(non_ordered_pair(X,Y)).
% 360053 [] equal(ordered_pair(X,Y),non_ordered_pair(singleton_set(X),non_ordered_pair(X,Y))).
% 360056 [] equal(X,ordered_pair(f2(X),f3(X))) | -ordered_pair_predicate(X).
% 360185 [] ordered_pair_predicate(a).
% 360186 [] -little_set(a).
% 360457 [para:360053.1.2,360051.1.1] little_set(ordered_pair(X,Y)).
% 360482 [para:360056.1.2,360457.1.1] -ordered_pair_predicate(X) | little_set(X).
% 360486 [binary:360185,360482,cut:360186] 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 15
% clause depth limited to 4
% seconds given: 28
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 208
% derived clauses: 1556387
% kept clauses: 77199
% kept size sum: 2287
% kept mid-nuclei: 39394
% kept new demods: 22
% forw unit-subs: 3951
% forw double-subs: 46913
% forw overdouble-subs: 91829
% backward subs: 3
% fast unit cutoff: 3873
% full unit cutoff: 66
% dbl unit cutoff: 3
% real runtime : 28.6
% process. runtime: 28.6
% specific non-discr-tree subsumption statistics:
% tried: 2299271
% length fails: 190810
% strength fails: 687385
% predlist fails: 699268
% aux str. fails: 7649
% by-lit fails: 37561
% full subs tried: 638983
% full subs fail: 559187
%
% ; 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/SET025-9+eq_r.in")
%
%------------------------------------------------------------------------------