TSTP Solution File: SYN163-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SYN163-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 : art05.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/SYN163-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,2,738,0,2,738,50,2,1107,0,2,1107,50,2,1476,0,3,1476,50,3,1845,0,3,1845,50,3,2214,0,4,2214,50,4,2583,0,5,2583,50,5,2952,0,5,2952,50,5,3321,0,6,3321,50,6,3690,0,6,3690,50,6,4059,0,7,4059,50,7,4428,0,7,4428,50,7,4797,0,8,4797,50,8,5166,0,8,5166,50,8,5535,0,9,5535,50,9,5904,0,9,5904,50,10,6273,0,10,6273,50,10,6642,0,10,6642,50,10,7011,0,11,7011,50,11,7380,0,11,7380,50,11,7749,0,12,7749,50,12,8118,0,13,8118,50,13,8118,40,13,8487,0,13)
%
%
% START OF PROOF
% 8119 [] s0(d).
% 8131 [] r0(e).
% 8132 [] p0(b,X).
% 8135 [] q0(X,d).
% 8136 [] p0(c,b).
% 8137 [] m0(X,d,Y).
% 8138 [] l0(a).
% 8142 [] l0(c).
% 8144 [] n0(d,c).
% 8145 [] m0(e,b,c).
% 8151 [] q0(d,c).
% 8152 [] n0(c,d).
% 8155 [] n0(b,a).
% 8157 [] -n0(X,Y) | k1(Y).
% 8159 [?] ?
% 8161 [] -m0(X,X,Y) | m1(Y,X,Y).
% 8163 [?] ?
% 8192 [] -m0(b,X,Y) | n1(Y,Y,X).
% 8241 [?] ?
% 8248 [?] ?
% 8249 [] q1(X,X,X) | -q0(Y,X).
% 8262 [] q1(X,X,X) | -s0(X).
% 8280 [?] ?
% 8281 [] -p0(X,X) | s1(X).
% 8282 [?] ?
% 8283 [] -m1(X,Y,Z) | -k2(U,Y) | k2(Z,Y) | -k1(U).
% 8285 [] -q1(X,Y,Y) | k2(Y,Y).
% 8289 [?] ?
% 8291 [?] ?
% 8293 [] -p1(X,Y,Z) | n2(Z).
% 8297 [?] ?
% 8311 [?] ?
% 8332 [] -m1(X,Y,X) | p2(Y,X,Y).
% 8335 [] -n1(X,X,Y) | q2(X,X,X) | -k1(Y).
% 8344 [] -r1(X) | -l0(X) | r2(X).
% 8350 [] k3(X,X,Y) | -k2(Y,X).
% 8384 [?] ?
% 8392 [] m3(X,X,X) | -n2(X).
% 8398 [] -k3(X,Y,Z) | p3(Z,X,Y) | -r2(X).
% 8407 [] -m3(X,Y,Z) | -p2(U,X,Z) | p3(U,X,X).
% 8414 [?] ?
% 8423 [] -p2(X,Y,Z) | r3(X,Z,X).
% 8432 [] k4(e) | -q1(a,a,X) | -r3(Y,e,X) | -q3(Y,Y).
% 8437 [] -p3(X,Y,Y) | -n4(X,X) | n4(X,Y).
% 8438 [?] ?
% 8440 [?] ?
% 8451 [?] ?
% 8463 [?] ?
% 8465 [] -n4(X,Y) | n5(Y,Y).
% 8487 [] -n5(e,a).
% 8506 [binary:8144,8157] k1(c).
% 8507 [binary:8152,8157] k1(d).
% 8508 [binary:8155,8157] k1(a).
% 8517 [input:8159,slowcut:8131] -m0(X,Y,Z) | -p0(Z,Y) | l1(Y,X).
% 8525 [binary:8145,8517,cut:8136] l1(b,e).
% 8529 [binary:8132,8281] s1(b).
% 8538 [binary:8137,8161] m1(X,d,X).
% 8549 [input:8163,slowcut:8132] m1(X,Y,X) | -r0(X).
% 8551 [binary:8131,8549.2] m1(e,X,e).
% 8560 [binary:8119,8262.2] q1(d,d,d).
% 8578 [binary:8138,8344.2] -r1(a) | r2(a).
% 8579 [binary:8142,8344.2] -r1(c) | r2(c).
% 8661 [binary:8137,8192] n1(X,X,d).
% 8857 [input:8241,slowcut:8132] p1(X,X,X).
% 8858 [binary:8293,8857] n2(X).
% 8864 [binary:8392.2,8858] m3(X,X,X).
% 8872 [binary:8151,8249.2] q1(c,c,c).
% 8911 [?] ?
% 8913 [input:8248,slowcut:8132] q1(X,Y,X) | -n0(Z,Y).
% 8918 [binary:8155,8913.2] q1(X,a,X).
% 8921 [input:8282,slowcut:8135,slowcut:8529] s1(X).
% 8927 [binary:8560,8285] k2(d,d).
% 8928 [binary:8872,8285] k2(c,c).
% 8973 [input:8291,slowcut:8525] -s0(X) | m2(X).
% 8974 [binary:8119,8973] m2(d).
% 9061 [input:8280,cut:8119] -q1(d,X,d) | -q0(Y,X) | r1(Y).
% 9062 [binary:8135,9061.2,cut:8560] r1(X).
% 9064 [binary:8578,9062] r2(a).
% 9065 [binary:8579,9062] r2(c).
% 9088 [binary:8927,8283.2,cut:8507,slowcut:8538] k2(X,d).
% 9089 [binary:8928,8283.2,cut:8506] -m1(X,c,Y) | k2(Y,c).
% 9098 [binary:8350.2,9088] k3(d,d,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).
% 9113 [input:8297,cut:8918] p2(X,a,X).
% 9157 [input:8311,slowcut:8508] -p2(e,X,Y) | p2(X,Y,Y).
% 9158 [binary:9113,9157] p2(a,e,e).
% 9196 [binary:8551,9089] k2(e,c).
% 9198 [binary:8350.2,9196] k3(c,c,e).
% 9227 [binary:8538,8332] p2(d,X,d).
% 9250 [binary:8507,8335.3,cut:8661] q2(X,X,X).
% 9416 [input:8384,cut:8858,slowcut:8864] m3(X,Y,Y) | -m2(Y).
% 9418 [binary:8974,9416.2] m3(X,d,d).
% 9424 [binary:9158,8423] r3(a,e,a).
% 9497 [binary:9198,8398,cut:9065] p3(e,c,c).
% 9536 [binary:9227,8407.2,slowcut:9418] p3(d,X,X).
% 9598 [input:8414,cut:9111,slowcut:8529] q3(X,X) | -r2(X).
% 9599 [binary:9064,9598.2] q3(a,a).
% 9705 [binary:9424,8432.3,cut:8911,cut:9599] k4(e).
% 9720 [binary:9497,8437] -n4(e,e) | n4(e,c).
% 9733 [input:8438,cut:9198,cut:8560] n4(d,d).
% 9735 [binary:8437.2,9733,cut:9536] n4(d,X).
% 9736 [binary:8465,9735] n5(X,X).
% 9745 [input:8440,cut:8864,slowcut:9705] n4(X,X).
% 9750 [binary:9745,9720] n4(e,c).
% 9771 [?] ?
% 9801 [input:8451,slowcut:8864,slowcut:9098] -q2(X,Y,Z) | q4(Z,Y).
% 9808 [binary:9250,9801] q4(X,X).
% 9867 [input:8463,slowcut:9808] -p4(X,X,Y) | -n5(X,Y) | -n4(Z,U) | n5(Z,Y).
% 9869 [binary:8487,9867.4,slowcut:9750] -p4(X,X,a) | -n5(X,a).
% 9876 [binary:9736,9869.2,cut:9771] 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: 775
% derived clauses: 2606
% kept clauses: 963
% kept size sum: 5794
% kept mid-nuclei: 0
% kept new demods: 0
% forw unit-subs: 955
% forw double-subs: 183
% forw overdouble-subs: 61
% backward subs: 297
% fast unit cutoff: 249
% full unit cutoff: 75
% dbl unit cutoff: 6
% real runtime: 0.26
% process. runtime: 0.25
% specific non-discr-tree subsumption statistics:
% tried: 289
% length fails: 22
% strength fails: 101
% predlist fails: 1
% aux str. fails: 8
% by-lit fails: 16
% full subs tried: 128
% full subs fail: 64
%
% ; 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/SYN163-1+noeq.in")
%
%------------------------------------------------------------------------------