TSTP Solution File: SET862-2 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SET862-2 : TPTP v3.4.2. Released v3.2.0.
% Transfm : add_equality:r
% Format : otter:hypothesis:set(auto),clear(print_given)
% Command : gandalf-wrapper -time %d %s
% Computer : art01.cs.miami.edu
% Model : i686 i686
% CPU : Intel(R) Pentium(R) 4 CPU 2.80GHz @ 2794MHz
% Memory : 1003MB
% OS : Linux 2.6.11-1.1369_FC4
% CPULimit : 600s
% Result : Unsatisfiable 14.8s
% Output : Assurance 14.8s
% 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: /tmp/SystemOnTPTP29087/SET/SET862-2+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 4 9)
% (binary-unit 9 #f 4 9)
% (binary-double 9 #f 4 9)
% (binary-double 15 #f)
% (binary-double 15 #t)
% (binary 50 #t 4 9)
% (binary-order 25 #f 4 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(16,40,0,32,0,0,33012,4,1876)
%
%
% START OF PROOF
% 17 [?] ?
% 32 [?] ?
% 48 [?] ?
% 21116 [?] ?
% 33015 [binary:48,32,demod:21116,cut:17] 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 9
% clause depth limited to 4
% seconds given: 25
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 482
% derived clauses: 277801
% kept clauses: 17313
% kept size sum: 741900
% kept mid-nuclei: 9620
% kept new demods: 1
% forw unit-subs: 80305
% forw double-subs: 32100
% forw overdouble-subs: 100488
% backward subs: 139
% fast unit cutoff: 2202
% full unit cutoff: 0
% dbl unit cutoff: 418
% real runtime : 18.94
% process. runtime: 18.76
% specific non-discr-tree subsumption statistics:
% tried: 4388719
% length fails: 167987
% strength fails: 581150
% predlist fails: 1646035
% aux str. fails: 72045
% by-lit fails: 129782
% full subs tried: 1740539
% full subs fail: 1643485
%
% ; program args: ("/home/graph/tptp/Systems/Gandalf---c-2.6/gandalf" "-time" "600" "/tmp/SystemOnTPTP29087/SET/SET862-2+eq_r.in")
% WARNING: TreeLimitedRun lost 14.82s, total lost is 14.82s
%
%------------------------------------------------------------------------------