TSTP Solution File: SYN311-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SYN311-1 : TPTP v3.4.2. Released v1.2.0.
% Transfm : add_equality:r
% Format : otter:hypothesis:set(auto),clear(print_given)
% Command : gandalf-wrapper -time %d %s
% Computer : art06.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 19.5s
% Output : Assurance 19.5s
% 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/SYN311-1+noeq.in
% Using automatic strategy selection.
% Time limit in seconds: 600
%
% prove-all-passes started
%
% detected problem class: hne
% detected subclass: small
% detected subclass: short
%
% strategies selected:
% (hyper 29 #f 3 3)
% (binary-unit 11 #f 3 3)
% (binary-double 17 #f 3 3)
% (hyper 29 #f)
% (binary-unit 34 #f)
% (binary-weightorder 40 #f)
% (binary 17 #t)
% (binary-order 29 #f)
% (binary-posweight-order 111 #f 3 3)
% (binary-posweight-order 283 #f)
%
%
% ********* EMPTY CLAUSE DERIVED *********
%
%
% timer checkpoints: c(6,40,0,12,0,0,13483,4,2176)
%
%
% START OF PROOF
% 7 [] p(a,b,c,d).
% 8 [] p(f(X),Y,Z,U) | -p(X,Y,Z,U).
% 9 [] p(X,Y,Z,g(U)) | -p(X,Y,Z,U).
% 10 [] -p(X,Y,Z,U) | p(U,Z,Y,X).
% 11 [] -p(X,Y,Z,U) | p(U,X,Y,Z).
% 12 [] -p(f(g(d)),f(g(c)),f(g(b)),f(g(a))).
% 15 [hyper:10,7] p(d,c,b,a).
% 18 [hyper:9,15] p(d,c,b,g(a)).
% 50 [hyper:11,18] p(g(a),d,c,b).
% 112 [hyper:8,50] p(f(g(a)),d,c,b).
% 309 [hyper:9,112] p(f(g(a)),d,c,g(b)).
% 910 [hyper:11,309] p(g(b),f(g(a)),d,c).
% 1892 [hyper:8,910] p(f(g(b)),f(g(a)),d,c).
% 3739 [hyper:9,1892] p(f(g(b)),f(g(a)),d,g(c)).
% 7132 [hyper:11,3739] p(g(c),f(g(b)),f(g(a)),d).
% 10501 [hyper:8,7132] p(f(g(c)),f(g(b)),f(g(a)),d).
% 13486 [binary:8,12] -p(g(d),f(g(c)),f(g(b)),f(g(a))).
% 13487 [binary:11.2,13486] -p(f(g(c)),f(g(b)),f(g(a)),g(d)).
% 13491 [binary:9,13487,cut:10501] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using binary resolution
% not using sos strategy
% using dynamic demodulation
% using ordered paramodulation
% using kb ordering for equality
% preferring bigger arities for lex ordering
% clause length limited to 3
% clause depth limited to 3
% seconds given: 29
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 9782
% derived clauses: 78207
% kept clauses: 13474
% kept size sum: 135214
% kept mid-nuclei: 0
% kept new demods: 0
% forw unit-subs: 48560
% forw double-subs: 0
% forw overdouble-subs: 0
% backward subs: 0
% fast unit cutoff: 1
% full unit cutoff: 0
% dbl unit cutoff: 0
% real runtime: 22.31
% process. runtime: 21.81
% specific non-discr-tree subsumption statistics:
% tried: 0
% length fails: 0
% strength fails: 0
% 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/SYN311-1+noeq.in")
%
%------------------------------------------------------------------------------