TSTP Solution File: SYN214-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SYN214-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 : 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/SYN214-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,1,738,50,1,1107,0,2,1107,50,2,1476,0,2,1476,50,2,1845,0,3,1845,50,3,2214,0,3,2214,50,3,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,7,4797,50,7,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,10,7011,50,10,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).
% 8131 [] r0(e).
% 8132 [] p0(b,X).
% 8133 [] n0(a,b).
% 8135 [] q0(X,d).
% 8137 [] m0(X,d,Y).
% 8140 [?] ?
% 8144 [] n0(d,c).
% 8150 [] k0(b).
% 8152 [] n0(c,d).
% 8157 [] -n0(X,Y) | k1(Y).
% 8159 [?] ?
% 8192 [] -m0(b,X,Y) | n1(Y,Y,X).
% 8222 [] p1(X,X,X) | -n0(Y,X).
% 8262 [] q1(X,X,X) | -s0(X).
% 8280 [?] ?
% 8293 [] -p1(X,Y,Z) | n2(Z).
% 8331 [?] ?
% 8335 [] -n1(X,X,Y) | q2(X,X,X) | -k1(Y).
% 8343 [?] ?
% 8396 [] -p2(X,Y,Z) | n3(Z).
% 8400 [] p3(X,X,X) | -n2(X).
% 8411 [] -q2(X,Y,Z) | -n0(X,Y) | q3(Y,Z).
% 8433 [] -p3(X,Y,Z) | l4(Z).
% 8454 [] -q3('X,'Y) | -p0('Z,'U) | -n3(U) | r4(U).
% 8485 [] -r4(X) | -l4(Y) | s5(Y).
% 8487 [] -s5(c).
% 8507 [binary:8152,8157] k1(d).
% 8517 [input:8159,slowcut:8131] -m0(X,Y,Z) | -p0(Z,Y) | l1(Y,X).
% 8522 [binary:8137,8517,slowcut:8132] l1(d,X).
% 8560 [binary:8119,8262.2] q1(d,d,d).
% 8661 [binary:8137,8192] n1(X,X,d).
% 8673 [binary:8487,8485.3] -l4(c) | -r4(X).
% 8813 [binary:8144,8222.2] p1(c,c,c).
% 8815 [binary:8293,8813] n2(c).
% 8818 [binary:8400.2,8815] p3(c,c,c).
% 8828 [binary:8433,8818,binarydemod:8673] -r4(X).
% 8976 [input:8331,slowcut:8522] p2(X,X,X).
% 8977 [binary:8396,8976] n3(X).
% 9060 [input:8280,cut:8119] -q1(d,X,d) | -q0(Y,X) | r1(Y).
% 9061 [binary:8135,9060.2,cut:8560] r1(X).
% 9249 [binary:8507,8335.3,cut:8661] q2(X,X,X).
% 9296 [input:8343,cut:9249,cut:9061,slowcut:8137] q2(X,Y,X) | -k0(Y).
% 9298 [binary:8150,9296.2] q2(X,b,X).
% 9571 [binary:9298,8411] -n0(X,b) | q3(b,X).
% 9613 [binary:8133,9571] q3(b,a).
% 9835 [input:8454,cut:8977,cut:8828,slowcut:9613,slowcut:8140] 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: 755
% derived clauses: 2533
% kept clauses: 932
% kept size sum: 5693
% kept mid-nuclei: 0
% kept new demods: 0
% forw unit-subs: 939
% forw double-subs: 165
% forw overdouble-subs: 58
% backward subs: 284
% fast unit cutoff: 233
% full unit cutoff: 70
% dbl unit cutoff: 6
% real runtime: 0.27
% process. runtime: 0.26
% 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/SYN214-1+noeq.in")
%
%------------------------------------------------------------------------------