TSTP Solution File: SYN195-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SYN195-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 : art09.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/SYN195-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,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,10,7380,50,10,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).
% 8136 [] p0(c,b).
% 8137 [] m0(X,d,Y).
% 8145 [] m0(e,b,c).
% 8150 [] k0(b).
% 8152 [] n0(c,d).
% 8158 [] -n0(X,Y) | l1(Y,Y).
% 8159 [?] ?
% 8161 [] -m0(X,X,Y) | m1(Y,X,Y).
% 8241 [?] ?
% 8291 [?] ?
% 8293 [] -p1(X,Y,Z) | n2(Z).
% 8331 [?] ?
% 8332 [] -m1(X,Y,X) | p2(Y,X,Y).
% 8384 [?] ?
% 8392 [] m3(X,X,X) | -n2(X).
% 8396 [] -p2(X,Y,Z) | n3(Z).
% 8407 [] -m3(X,Y,Z) | -p2(U,X,Z) | p3(U,X,X).
% 8455 [?] ?
% 8483 [?] ?
% 8487 [] -r5(d,d).
% 8514 [binary:8152,8158] l1(d,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).
% 8525 [binary:8145,8517,cut:8136] l1(b,e).
% 8538 [binary:8137,8161] m1(X,d,X).
% 8850 [input:8241,slowcut:8132] p1(X,X,X).
% 8851 [binary:8293,8850] n2(X).
% 8853 [binary:8392.2,8851] m3(X,X,X).
% 8973 [input:8291,slowcut:8525] -s0(X) | m2(X).
% 8974 [binary:8119,8973] m2(d).
% 8977 [input:8331,slowcut:8522] p2(X,X,X).
% 8978 [binary:8396,8977] n3(X).
% 9227 [binary:8538,8332] p2(d,X,d).
% 9410 [input:8384,cut:8851,slowcut:8853] m3(X,Y,Y) | -m2(Y).
% 9412 [binary:8974,9410.2] m3(X,d,d).
% 9540 [binary:9227,8407.2,slowcut:9412] p3(d,X,X).
% 9844 [input:8455,slowcut:9540] -l1(X,Y) | s4(X).
% 9848 [binary:8514,9844] s4(d).
% 9915 [input:8483,cut:8150,cut:8978] r5(X,Y) | -s4(X).
% 9916 [binary:8487,9915,cut:9848] 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: 811
% derived clauses: 2675
% kept clauses: 991
% kept size sum: 5958
% kept mid-nuclei: 0
% kept new demods: 0
% forw unit-subs: 981
% forw double-subs: 184
% forw overdouble-subs: 62
% backward subs: 305
% fast unit cutoff: 258
% full unit cutoff: 75
% dbl unit cutoff: 6
% real runtime: 0.27
% process. runtime: 0.26
% specific non-discr-tree subsumption statistics:
% tried: 294
% length fails: 22
% strength fails: 105
% predlist fails: 1
% aux str. fails: 8
% by-lit fails: 16
% full subs tried: 129
% 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/SYN195-1+noeq.in")
%
%------------------------------------------------------------------------------