TSTP Solution File: SYN121-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SYN121-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/SYN121-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,2,738,0,2,738,50,2,1107,0,3,1107,50,3,1476,0,3,1476,50,3,1845,0,4,1845,50,4,2214,0,5,2214,50,5,2583,0,5,2583,50,5,2952,0,6,2952,50,6,3321,0,6,3321,50,6,3690,0,7,3690,50,7,4059,0,8,4059,50,8,4428,0,8,4428,50,8,4797,0,9,4797,50,9,5166,0,9,5166,50,9,5535,0,9,5535,50,9,5904,0,10,5904,50,10,6273,0,10,6273,50,10,6642,0,11,6642,50,11,7011,0,12,7011,50,12,7380,0,12,7380,50,12,7749,0,12,7749,50,12,8118,0,13,8118,50,13,8118,40,13,8487,0,13)
%
%
% START OF PROOF
% 8129 [] n0(e,b).
% 8132 [] p0(b,X).
% 8135 [] q0(X,d).
% 8137 [] m0(X,d,Y).
% 8281 [] -p0(X,X) | s1(X).
% 8282 [?] ?
% 8287 [] -n0(e,X) | -l2(X,X) | l2(Y,X) | -s1(Y).
% 8289 [?] ?
% 8487 [] -l2(a,b).
% 8529 [binary:8132,8281] s1(b).
% 8921 [input:8282,slowcut:8135,slowcut:8529] s1(X).
% 9093 [binary:8487,8287.3,cut:8129] -l2(b,b) | -s1(a).
% 9101 [binary:8921,9093.2] -l2(b,b).
% 9105 [input:8289,slowcut:8132] -m0(X,Y,Z) | l2(Z,Z) | -s1(Y).
% 9116 [binary:8921,9105.3,slowcut:8137,slowcut:9101] 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: 404
% derived clauses: 1075
% kept clauses: 416
% kept size sum: 2459
% kept mid-nuclei: 0
% kept new demods: 0
% forw unit-subs: 398
% forw double-subs: 67
% forw overdouble-subs: 16
% backward subs: 143
% fast unit cutoff: 86
% full unit cutoff: 36
% dbl unit cutoff: 6
% real runtime: 0.19
% process. runtime: 0.18
% specific non-discr-tree subsumption statistics:
% tried: 84
% length fails: 11
% strength fails: 33
% predlist fails: 0
% aux str. fails: 2
% by-lit fails: 5
% full subs tried: 27
% full subs fail: 8
%
% ; 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/SYN121-1+noeq.in")
%
%------------------------------------------------------------------------------