TSTP Solution File: SYN200-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SYN200-1 : TPTP v3.4.2. Released v1.1.0.
% Transfm : add_equality:r
% Format : otter:hypothesis:set(auto),clear(print_given)
% Command : gandalf-wrapper -time %d %s
% Computer : art06.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 0.0s
% Output : Assurance 0.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/SYN/SYN200-1+noeq.in
% Using automatic strategy selection.
% Time limit in seconds: 600
%
% prove-all-passes started
%
% detected problem class: hne
% detected subclass: big
% detected subclass: long
%
% strategies selected:
% (hyper 25 #t 1 9)
% (binary-unit 25 #f 1 9)
% (binary-double 25 #f 1 9)
% (binary-posweight-order 25 #f 1 9)
% (binary 50 #t 1 9)
% (hyper 25 #t)
% (hyper 116 #f)
% (binary-posweight-order 76 #f)
% (binary-order 25 #f)
% (binary-weightorder 25 #f)
% (binary-posweight-order-sos 76 #t)
% (binary-unit-sos 40 #t)
% (binary 67 #t)
%
%
% **** EMPTY CLAUSE DERIVED ****
%
% **** EMPTY CLAUSE DERIVED ****
% By given clause simplification.
%
%
% timer checkpoints: c(369,40,1,738,0,1,738,50,1,1107,0,2,1107,50,2,1476,0,2,1476,50,2,1845,0,3,1845,50,3,2214,0,3,2214,50,3,2583,0,4,2583,50,4,2952,0,4,2952,50,5,3321,0,5,3321,50,5,3690,0,6,3690,50,6,4059,0,6,4059,50,6,4428,0,7,4428,50,7,4797,0,7,4797,50,7,5166,0,7,5166,50,7,5535,0,8,5535,50,8,5904,0,9,5904,50,9,6273,0,9,6273,50,9,6642,0,10,6642,50,10,7011,0,10,7011,50,10,7380,0,10,7380,50,10,7749,0,11,7749,50,11,8118,0,12,8118,50,12,8118,40,12,8487,0,12)
%
%
% START OF PROOF
% 8132 [] p0(b,X).
% 8135 [] q0(X,d).
% 8281 [] -p0(X,X) | s1(X).
% 8282 [] -q0('X,'Y) | -s1('Z) | s1('X).
% 8487 [] -s1(e).
% 8530 [binary:8132,8281] s1(b).
% 8921 [input:8282,slowcut:8135,slowcut:8530,slowcut:8487] 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 1
% seconds given: 25
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 321
% derived clauses: 728
% kept clauses: 287
% kept size sum: 1610
% kept mid-nuclei: 0
% kept new demods: 0
% forw unit-subs: 259
% forw double-subs: 45
% forw overdouble-subs: 2
% backward subs: 106
% fast unit cutoff: 37
% full unit cutoff: 21
% dbl unit cutoff: 0
% real runtime: 0.17
% process. runtime: 0.16
% specific non-discr-tree subsumption statistics:
% tried: 51
% length fails: 11
% strength fails: 18
% predlist fails: 0
% aux str. fails: 2
% by-lit fails: 4
% full subs tried: 11
% full subs fail: 6
%
% ; 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/SYN/SYN200-1+noeq.in")
%
%------------------------------------------------------------------------------