TSTP Solution File: SYN158-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SYN158-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/SYN158-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,2,738,50,2,1107,0,3,1107,50,3,1476,0,3,1476,50,3,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,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,9,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,12,8118,50,12,8118,40,12,8487,0,13)
%
%
% START OF PROOF
% 8119 [] s0(d).
% 8131 [] r0(e).
% 8132 [] p0(b,X).
% 8135 [] q0(X,d).
% 8137 [] m0(X,d,Y).
% 8138 [] l0(a).
% 8144 [] n0(d,c).
% 8151 [] q0(d,c).
% 8152 [] n0(c,d).
% 8157 [] -n0(X,Y) | k1(Y).
% 8161 [] -m0(X,X,Y) | m1(Y,X,Y).
% 8163 [?] ?
% 8249 [] q1(X,X,X) | -q0(Y,X).
% 8262 [] q1(X,X,X) | -s0(X).
% 8280 [?] ?
% 8283 [] -m1(X,Y,Z) | -k2(U,Y) | k2(Z,Y) | -k1(U).
% 8285 [] -q1(X,Y,Y) | k2(Y,Y).
% 8344 [] -r1(X) | -l0(X) | r2(X).
% 8350 [] k3(X,X,Y) | -k2(Y,X).
% 8358 [] -k3(X,Y,Z) | k3(U,U,X) | -k2(U,Z) | -q0(V,X).
% 8398 [] -k3(X,Y,Z) | p3(Z,X,Y) | -r2(X).
% 8437 [] -p3(X,Y,Y) | -n4(X,X) | n4(X,Y).
% 8438 [] -k3(c,c,e) | -q1(d,d,d) | n4(d,d).
% 8465 [] -n4(X,Y) | n5(Y,Y).
% 8487 [] -n5(a,a).
% 8506 [binary:8144,8157] k1(c).
% 8507 [binary:8152,8157] k1(d).
% 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).
% 8659 [binary:8487,8465.2] -n4(X,a).
% 8898 [binary:8151,8249.2] q1(c,c,c).
% 8958 [binary:8560,8285] k2(d,d).
% 8959 [binary:8898,8285] k2(c,c).
% 9063 [input:8280,cut:8119] -q1(d,X,d) | -q0(Y,X) | r1(Y).
% 9064 [binary:8135,9063.2,cut:8560] r1(X).
% 9066 [binary:8578,9064] r2(a).
% 9090 [binary:8958,8283.2,cut:8507,slowcut:8538] k2(X,d).
% 9091 [binary:8959,8283.2,cut:8506] -m1(X,c,Y) | k2(Y,c).
% 9100 [binary:8350.2,9090] k3(d,d,X).
% 9201 [binary:8551,9091] k2(e,c).
% 9206 [binary:8350.2,9201] k3(c,c,e).
% 9348 [binary:8135,8358.4,slowcut:9100,slowcut:9090] k3(X,X,d).
% 9507 [binary:9348,8398] p3(d,X,X) | -r2(X).
% 9518 [binary:9066,9507.2] p3(d,a,a).
% 9738 [binary:9518,8437,cut:8659] -n4(d,d).
% 9740 [input:8438,cut:9206,cut:8560,cut:9738] 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: 716
% derived clauses: 2413
% kept clauses: 862
% kept size sum: 5396
% kept mid-nuclei: 0
% kept new demods: 0
% forw unit-subs: 909
% forw double-subs: 164
% forw overdouble-subs: 58
% backward subs: 246
% fast unit cutoff: 226
% full unit cutoff: 66
% dbl unit cutoff: 6
% real runtime: 0.24
% process. runtime: 0.23
% specific non-discr-tree subsumption statistics:
% tried: 285
% length fails: 22
% strength fails: 102
% 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/SYN158-1+noeq.in")
%
%------------------------------------------------------------------------------