TSTP Solution File: SYN252-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SYN252-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/SYN252-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 *********
%
%
% 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,4,2214,50,4,2583,0,4,2583,50,4,2952,0,5,2952,50,5,3321,0,5,3321,50,5,3690,0,6,3690,50,6,4059,0,7,4059,50,7,4428,0,7,4428,50,7,4797,0,7,4797,50,7,5166,0,8,5166,50,8,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,11,7380,0,11,7380,50,11,7749,0,11,7749,50,11,8118,0,12,8118,50,12,8118,40,12,8487,0,12)
%
%
% START OF PROOF
% 8123 [] s0(b).
% 8132 [] p0(b,X).
% 8135 [] q0(X,d).
% 8137 [] m0(X,d,Y).
% 8138 [] l0(a).
% 8142 [] l0(c).
% 8150 [] k0(b).
% 8152 [] n0(c,d).
% 8155 [] n0(b,a).
% 8157 [] -n0(X,Y) | k1(Y).
% 8158 [] -n0(X,Y) | l1(Y,Y).
% 8192 [] -m0(b,X,Y) | n1(Y,Y,X).
% 8206 [?] ?
% 8210 [] -n1(X,Y,X) | n1(X,Y,Y) | -l1(Z,X) | -l0(Z).
% 8227 [?] ?
% 8241 [?] ?
% 8281 [] -p0(X,X) | s1(X).
% 8282 [?] ?
% 8289 [?] ?
% 8333 [?] ?
% 8335 [] -n1(X,X,Y) | q2(X,X,X) | -k1(Y).
% 8338 [] -q2(X,Y,Z) | -p1(Z,Z,Y) | -n1(X,Z,Y) | q2(Z,X,Z).
% 8345 [?] ?
% 8429 [?] ?
% 8435 [?] ?
% 8487 [] -m4(X,d).
% 8507 [binary:8152,8157] k1(d).
% 8515 [binary:8155,8158] l1(a,a).
% 8529 [binary:8132,8281] s1(b).
% 8661 [binary:8137,8192] n1(X,X,d).
% 8751 [input:8206,cut:8123,cut:8132] n1(X,Y,X) | -l0(X).
% 8752 [binary:8138,8751.2] n1(a,X,a).
% 8783 [binary:8515,8210.3,cut:8752,cut:8138] n1(a,X,X).
% 8849 [input:8227,cut:8123,slowcut:8142] -p1(X,Y,Z) | p1(Z,X,Z).
% 8857 [input:8241,slowcut:8132] p1(X,X,X).
% 8859 [binary:8849,8857] p1(X,X,X).
% 8921 [input:8282,slowcut:8135,slowcut:8529] s1(X).
% 9102 [input:8289,slowcut:8132] -m0(X,Y,Z) | l2(Z,Z) | -s1(Y).
% 9111 [binary:8921,9102.3,slowcut:8137] l2(X,X).
% 9236 [input:8333,cut:8859] q2(X,Y,Y) | -k0(Y).
% 9238 [binary:8150,9236.2] q2(X,b,b).
% 9250 [binary:8507,8335.3,cut:8661] q2(X,X,X).
% 9277 [binary:8783,8338.3,cut:8859] -q2(a,X,X) | q2(X,a,X).
% 9304 [input:8345,cut:8529] -q2(b,X,b) | s2(X).
% 9687 [input:8429,slowcut:8137,slowcut:9250] s3(X,Y) | -s2(X).
% 9715 [input:8435,slowcut:9111,slowcut:8487] -s3(a,X).
% 9716 [binary:9687,9715] -s2(a).
% 9717 [binary:9304.2,9716] -q2(b,a,b).
% 10257 [binary:9238,9277,cut:9717] 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: 1072
% derived clauses: 3679
% kept clauses: 1163
% kept size sum: 6771
% kept mid-nuclei: 0
% kept new demods: 0
% forw unit-subs: 1591
% forw double-subs: 221
% forw overdouble-subs: 70
% backward subs: 398
% fast unit cutoff: 269
% full unit cutoff: 81
% dbl unit cutoff: 6
% real runtime: 0.33
% process. runtime: 0.32
% specific non-discr-tree subsumption statistics:
% tried: 322
% length fails: 32
% strength fails: 112
% predlist fails: 1
% aux str. fails: 8
% by-lit fails: 16
% full subs tried: 140
% full subs fail: 67
%
% ; 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/SYN252-1+noeq.in")
%
%------------------------------------------------------------------------------