TSTP Solution File: SYN190-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SYN190-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 : art10.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/SYN190-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,8,4797,50,8,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,11,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
% 8119 [] s0(d).
% 8123 [] s0(b).
% 8125 [] n0(d,b).
% 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).
% 8145 [] m0(e,b,c).
% 8150 [] k0(b).
% 8157 [] -n0(X,Y) | k1(Y).
% 8159 [?] ?
% 8177 [] m1(X,Y,X) | -k0(Y) | -l0(X).
% 8262 [] q1(X,X,X) | -s0(X).
% 8275 [?] ?
% 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 [?] ?
% 8344 [] -r1(X) | -l0(X) | r2(X).
% 8387 [] m3(X,Y,X) | -k2(c,Y) | -r2(X).
% 8421 [] r3(X,X,X) | -l2(Y,X).
% 8424 [?] ?
% 8487 [] -r3(a,X,d).
% 8498 [input:8275,factor:cut:8123] q1(b,b,b).
% 8505 [binary:8125,8157] k1(b).
% 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).
% 8560 [binary:8119,8262.2] q1(d,d,d).
% 8578 [binary:8138,8344.2] -r1(a) | r2(a).
% 8614 [binary:8150,8177.2] m1(X,b,X) | -l0(X).
% 8712 [binary:8142,8614.2] m1(c,b,c).
% 8921 [input:8282,slowcut:8135,slowcut:8529] s1(X).
% 8926 [binary:8498,8285] k2(b,b).
% 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).
% 9086 [binary:8926,8283.2,cut:8505] -m1(X,b,Y) | k2(Y,b).
% 9102 [input:8289,slowcut:8132] -m0(X,Y,Z) | l2(Z,Z) | -s1(Y).
% 9111 [binary:8921,9102.3,slowcut:8137] l2(X,X).
% 9112 [binary:8421.2,9111] r3(X,X,X).
% 9189 [binary:8712,9086] k2(c,b).
% 9435 [binary:9189,8387.2] m3(X,b,X) | -r2(X).
% 9482 [binary:9064,9435.2] m3(a,b,a).
% 9627 [input:8424,slowcut:9112] -m3(X,b,Y) | r3(Y,Y,Z) | -m2(Z).
% 9629 [binary:8487,9627.2,cut:8974,slowcut:9482] 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: 651
% derived clauses: 2208
% kept clauses: 787
% kept size sum: 4921
% kept mid-nuclei: 0
% kept new demods: 0
% forw unit-subs: 865
% forw double-subs: 160
% forw overdouble-subs: 56
% backward subs: 237
% fast unit cutoff: 202
% full unit cutoff: 60
% dbl unit cutoff: 6
% real runtime: 0.23
% process. runtime: 0.23
% specific non-discr-tree subsumption statistics:
% tried: 265
% length fails: 22
% strength fails: 84
% predlist fails: 0
% aux str. fails: 8
% by-lit fails: 16
% full subs tried: 123
% 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/SYN190-1+noeq.in")
%
%------------------------------------------------------------------------------