TSTP Solution File: SYN102-1.007.007 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SYN102-1.007.007 : TPTP v3.4.2. Bugfixed v1.2.0.
% Transfm : add_equality:r
% Format : otter:hypothesis:set(auto),clear(print_given)
% Command : gandalf-wrapper -time %d %s
% Computer : art08.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/SYN102-1.007.007+noeq.in
% Using automatic strategy selection.
% Time limit in seconds: 600
%
% prove-all-passes started
%
% detected problem class: hne
% detected subclass: medium
% detected subclass: long
%
% strategies selected:
% (hyper 57 #f 1 15)
% (binary-unit 28 #f 1 15)
% (binary-double 28 #f)
% (binary-posweight-order 28 #f 1 15)
% (binary 28 #t 1 15)
% (hyper 28 #t)
% (hyper 159 #f)
% (binary-posweight-order 85 #f)
% (binary-weightorder 39 #f)
% (binary-order 28 #f)
% (binary-unit 45 #f)
% (binary 47 #t)
%
%
% SOS clause
% -p_0(a,a,a,a,a,a,a) | -q_0(a,a,a,a,a,a,a).
% was split for some strategies as:
% -p_0(a,a,a,a,a,a,a).
% -q_0(a,a,a,a,a,a,a).
%
% ********* EMPTY CLAUSE DERIVED *********
%
%
% timer checkpoints: c(71,40,1,142,0,1)
%
%
% START OF PROOF
% 72 [] -p_2(X,Y,Z,U,V,W,X1) | -p_1(X,Y,Z,U,V,W,X1) | p_0(X,Y,Z,U,V,W,X1).
% 74 [] -p_3(X,Y,Z,U,V,W,X1) | -p_2(X,Y,Z,U,V,W,X1) | p_1(X,Y,Z,U,V,W,X1).
% 76 [] -p_4(X,Y,Z,U,V,W,X1) | -p_3(X,Y,Z,U,V,W,X1) | p_2(X,Y,Z,U,V,W,X1).
% 78 [] -p_5(X,Y,Z,U,V,W,X1) | -p_4(X,Y,Z,U,V,W,X1) | p_3(X,Y,Z,U,V,W,X1).
% 80 [] -p_6(X,Y,Z,U,V,W,X1) | -p_5(X,Y,Z,U,V,W,X1) | p_4(X,Y,Z,U,V,W,X1).
% 82 [] -p_7(X,Y,Z,U,V,W,X1) | -p_6(X,Y,Z,U,V,W,X1) | p_5(X,Y,Z,U,V,W,X1).
% 84 [] -p_8(X,Y,Z,U,V,W,X1) | -p_7(X,Y,Z,U,V,W,X1) | p_6(X,Y,Z,U,V,W,X1).
% 86 [] -p_9(X,Y,Z,U,V,W,X1) | -p_8(X,Y,Z,U,V,W,X1) | p_7(X,Y,Z,U,V,W,X1).
% 88 [] -p_10(X,Y,Z,U,V,W,X1) | -p_9(X,Y,Z,U,V,W,X1) | p_8(X,Y,Z,U,V,W,X1).
% 90 [] -p_11(X,Y,Z,U,V,W,X1) | -p_10(X,Y,Z,U,V,W,X1) | p_9(X,Y,Z,U,V,W,X1).
% 92 [] -p_12(X,Y,Z,U,V,W,X1) | -p_11(X,Y,Z,U,V,W,X1) | p_10(X,Y,Z,U,V,W,X1).
% 94 [] -p_13(X,Y,Z,U,V,W,X1) | -p_12(X,Y,Z,U,V,W,X1) | p_11(X,Y,Z,U,V,W,X1).
% 97 [] -q_1(X,Y,Z,U,V,W,X1) | -p_2(X,Y,Z,U,V,W,X1) | q_0(X,Y,Z,U,V,W,X1).
% 99 [] -p_3(X,Y,Z,U,V,W,X1) | -q_2(X,Y,Z,U,V,W,X1) | q_1(X,Y,Z,U,V,W,X1).
% 101 [] -p_4(X,Y,Z,U,V,W,X1) | -q_3(X,Y,Z,U,V,W,X1) | q_2(X,Y,Z,U,V,W,X1).
% 103 [] -p_5(X,Y,Z,U,V,W,X1) | -q_4(X,Y,Z,U,V,W,X1) | q_3(X,Y,Z,U,V,W,X1).
% 105 [] -p_6(X,Y,Z,U,V,W,X1) | -q_5(X,Y,Z,U,V,W,X1) | q_4(X,Y,Z,U,V,W,X1).
% 107 [] -p_7(X,Y,Z,U,V,W,X1) | -q_6(X,Y,Z,U,V,W,X1) | q_5(X,Y,Z,U,V,W,X1).
% 109 [] -p_8(X,Y,Z,U,V,W,X1) | -q_7(X,Y,Z,U,V,W,X1) | q_6(X,Y,Z,U,V,W,X1).
% 111 [] -p_9(X,Y,Z,U,V,W,X1) | -q_8(X,Y,Z,U,V,W,X1) | q_7(X,Y,Z,U,V,W,X1).
% 113 [] -p_10(X,Y,Z,U,V,W,X1) | -q_9(X,Y,Z,U,V,W,X1) | q_8(X,Y,Z,U,V,W,X1).
% 115 [] -p_11(X,Y,Z,U,V,W,X1) | -q_10(X,Y,Z,U,V,W,X1) | q_9(X,Y,Z,U,V,W,X1).
% 117 [] -p_12(X,Y,Z,U,V,W,X1) | -q_11(X,Y,Z,U,V,W,X1) | q_10(X,Y,Z,U,V,W,X1).
% 118 [] -q_13(X,Y,Z,U,V,W,X1) | -p_12(X,Y,Z,U,V,W,X1) | q_11(X,Y,Z,U,V,W,X1).
% 124 [] p_12(X,Y,Z,U,V,W,X1) | -nq_7(X1) | -nq_6(W) | -nq_5(V) | -nq_4(U) | -nq_3(Z) | -nq_2(Y) | -nq_1(X).
% 125 [] p_13(X,Y,Z,U,V,W,X1) | -nq_7(X1) | -nq_6(W) | -nq_5(V) | -nq_4(U) | -nq_3(Z) | -nq_2(Y) | -nq_1(X).
% 127 [] q_13(X,Y,Z,U,V,W,X1) | -nq_7(X1) | -nq_6(W) | -nq_5(V) | -nq_4(U) | -nq_3(Z) | -nq_2(Y) | -nq_1(X).
% 128 [] nq_1(a).
% 130 [] nq_2(a).
% 132 [] nq_3(a).
% 134 [] nq_4(a).
% 136 [] nq_5(a).
% 138 [] nq_6(a).
% 140 [] nq_7(a).
% 142 [] -q_0(a,a,a,a,a,a,a) | -p_0(a,a,a,a,a,a,a).
% 432 [hyper:124,140,138,136,134,132,130,128] p_12(a,a,a,a,a,a,a).
% 673 [hyper:125,140,138,136,134,132,130,128] p_13(a,a,a,a,a,a,a).
% 1155 [hyper:127,140,138,136,134,132,130,128] q_13(a,a,a,a,a,a,a).
% 2385 [hyper:94,432,cut:673] p_11(a,a,a,a,a,a,a).
% 2387 [hyper:118,432,cut:1155] q_11(a,a,a,a,a,a,a).
% 2459 [hyper:92,432,cut:2385] p_10(a,a,a,a,a,a,a).
% 2548 [hyper:117,432,cut:2387] q_10(a,a,a,a,a,a,a).
% 4532 [hyper:90,2385,cut:2459] p_9(a,a,a,a,a,a,a).
% 4533 [hyper:115,2385,cut:2548] q_9(a,a,a,a,a,a,a).
% 4660 [hyper:88,2459,cut:4532] p_8(a,a,a,a,a,a,a).
% 4661 [hyper:113,2459,cut:4533] q_8(a,a,a,a,a,a,a).
% 5044 [hyper:86,4532,cut:4660] p_7(a,a,a,a,a,a,a).
% 5045 [hyper:111,4532,cut:4661] q_7(a,a,a,a,a,a,a).
% 5172 [hyper:84,4660,cut:5044] p_6(a,a,a,a,a,a,a).
% 5173 [hyper:109,4660,cut:5045] q_6(a,a,a,a,a,a,a).
% 5680 [hyper:82,5044,cut:5172] p_5(a,a,a,a,a,a,a).
% 5681 [hyper:107,5044,cut:5173] q_5(a,a,a,a,a,a,a).
% 5812 [hyper:80,5172,cut:5680] p_4(a,a,a,a,a,a,a).
% 5813 [hyper:105,5172,cut:5681] q_4(a,a,a,a,a,a,a).
% 6324 [hyper:78,5680,cut:5812] p_3(a,a,a,a,a,a,a).
% 6325 [hyper:103,5680,cut:5813] q_3(a,a,a,a,a,a,a).
% 6452 [hyper:76,5812,cut:6324] p_2(a,a,a,a,a,a,a).
% 6453 [hyper:101,5812,cut:6325] q_2(a,a,a,a,a,a,a).
% 6836 [hyper:74,6324,cut:6452] p_1(a,a,a,a,a,a,a).
% 6837 [hyper:99,6324,cut:6453] q_1(a,a,a,a,a,a,a).
% 6964 [hyper:72,6452,cut:6836] p_0(a,a,a,a,a,a,a).
% 6965 [hyper:97,6452,cut:6837] q_0(a,a,a,a,a,a,a).
% 7224 [hyper:142,6964,cut:6965] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using hyperresolution
% not using sos strategy
% using positive unit paramodulation strategy
% using dynamic demodulation
% using ordered paramodulation
% using kb ordering for equality
% preferring bigger arities for lex ordering
% clause length limited to 15
% clause depth limited to 1
% seconds given: 19
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 3652
% derived clauses: 28906
% kept clauses: 3840
% kept size sum: 30720
% kept mid-nuclei: 3184
% kept new demods: 0
% forw unit-subs: 21824
% forw double-subs: 0
% forw overdouble-subs: 0
% backward subs: 0
% fast unit cutoff: 3073
% full unit cutoff: 0
% dbl unit cutoff: 0
% real runtime: 1.80
% process. runtime: 1.79
% specific non-discr-tree subsumption statistics:
% tried: 96
% length fails: 0
% strength fails: 96
% predlist fails: 0
% aux str. fails: 0
% by-lit fails: 0
% full subs tried: 0
% full subs fail: 0
%
% ; 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/SYN102-1.007.007+noeq.in")
%
%------------------------------------------------------------------------------