TSTP Solution File: SYN155-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SYN155-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 : art03.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/SYN155-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,3,738,0,4,738,50,4,1107,0,4,1107,50,4,1476,0,5,1476,50,5,1845,0,5,1845,50,5,2214,0,6,2214,50,6,2583,0,6,2583,50,6,2952,0,7,2952,50,7,3321,0,7,3321,50,7,3690,0,8,3690,50,8,4059,0,9,4059,50,9,4428,0,9,4428,50,9,4797,0,10,4797,50,10,5166,0,10,5166,50,10,5535,0,10,5535,50,10,5904,0,11,5904,50,11,6273,0,11,6273,50,11,6642,0,12,6642,50,12,7011,0,13,7011,50,13,7380,0,13,7380,50,13,7749,0,13,7749,50,13,8118,0,14,8118,50,14,8118,40,14,8487,0,14)
%
%
% START OF PROOF
% 8119 [] s0(d).
% 8131 [] r0(e).
% 8132 [] p0(b,X).
% 8136 [] p0(c,b).
% 8137 [] m0(X,d,Y).
% 8144 [] n0(d,c).
% 8145 [] m0(e,b,c).
% 8151 [] q0(d,c).
% 8157 [] -n0(X,Y) | k1(Y).
% 8159 [?] ?
% 8161 [] -m0(X,X,Y) | m1(Y,X,Y).
% 8163 [?] ?
% 8241 [?] ?
% 8249 [] q1(X,X,X) | -q0(Y,X).
% 8262 [] q1(X,X,X) | -s0(X).
% 8283 [] -m1(X,Y,Z) | -k2(U,Y) | k2(Z,Y) | -k1(U).
% 8285 [] -q1(X,Y,Y) | k2(Y,Y).
% 8291 [?] ?
% 8293 [] -p1(X,Y,Z) | n2(Z).
% 8332 [] -m1(X,Y,X) | p2(Y,X,Y).
% 8350 [] k3(X,X,Y) | -k2(Y,X).
% 8384 [?] ?
% 8392 [] m3(X,X,X) | -n2(X).
% 8407 [] -m3(X,Y,Z) | -p2(U,X,Z) | p3(U,X,X).
% 8437 [] -p3(X,Y,Y) | -n4(X,X) | n4(X,Y).
% 8438 [] -k3(c,c,e) | -q1(d,d,d) | n4(d,d).
% 8487 [] -n4(X,a).
% 8506 [binary:8144,8157] k1(c).
% 8517 [input:8159,slowcut:8131] -m0(X,Y,Z) | -p0(Z,Y) | l1(Y,X).
% 8525 [binary:8145,8517,cut:8136] l1(b,e).
% 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).
% 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).
% 8928 [binary:8872,8285] k2(c,c).
% 8973 [input:8291,slowcut:8525] -s0(X) | m2(X).
% 8974 [binary:8119,8973] m2(d).
% 9089 [binary:8928,8283.2,cut:8506] -m1(X,c,Y) | k2(Y,c).
% 9196 [binary:8551,9089] k2(e,c).
% 9198 [binary:8350.2,9196] k3(c,c,e).
% 9227 [binary:8538,8332] p2(d,X,d).
% 9416 [input:8384,cut:8858,slowcut:8864] m3(X,Y,Y) | -m2(Y).
% 9418 [binary:8974,9416.2] m3(X,d,d).
% 9536 [binary:9227,8407.2,slowcut:9418] p3(d,X,X).
% 9725 [binary:9536,8437,slowcut:8487] -n4(d,d).
% 9728 [input:8438,cut:9198,cut:8560,cut:9725] 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: 707
% derived clauses: 2393
% kept clauses: 852
% kept size sum: 5338
% kept mid-nuclei: 0
% kept new demods: 0
% forw unit-subs: 903
% forw double-subs: 165
% forw overdouble-subs: 58
% backward subs: 247
% fast unit cutoff: 224
% full unit cutoff: 67
% dbl unit cutoff: 6
% real runtime: 0.24
% process. runtime: 0.24
% specific non-discr-tree subsumption statistics:
% tried: 281
% length fails: 22
% strength fails: 98
% predlist fails: 0
% aux str. fails: 8
% by-lit fails: 16
% full subs tried: 125
% 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/SYN155-1+noeq.in")
%
%------------------------------------------------------------------------------