TSTP Solution File: SYN728-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SYN728-1 : TPTP v3.4.2. Released v2.5.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/SYN728-1+noeq.in
% Using automatic strategy selection.
% Time limit in seconds: 600
%
% prove-all-passes started
%
% detected problem class: nne
% detected subclass: small
%
% strategies selected:
% (hyper 27 #f 3 3)
% (binary-unit 10 #f 3 3)
% (binary-double 16 #f)
% (binary 16 #t 3 3)
% (binary-posweight-order 181 #f)
% (binary-order-sos 54 #t)
% (binary-unit-uniteq 54 #f)
% (binary-order 27 #f 3 3)
% (binary-weightorder 71 #f)
% (binary-order 27 #f)
% (hyper-order 54 #f)
% (binary 63 #t)
%
%
% SOS clause
% -p(sk2,sk2) | -p(g(sk2),X).
% was split for some strategies as:
% -p(sk2,sk2).
% -p(g(sk2),X).
%
% ********* EMPTY CLAUSE DERIVED *********
%
%
% timer checkpoints: c(5,40,0,10,0,0,34,50,0,39,0,0)
%
%
% START OF PROOF
% 35 [] q(f(X,sk1(X))) | p(X,sk1(X)).
% 36 [] p(X,sk1(X)) | m(X).
% 37 [] -p(X,Y) | p(Z,Z).
% 38 [] -m(g(X)) | -q(X).
% 39 [] -p(sk2,sk2) | -p(g(sk2),X).
% 44 [hyper:37,36] p(X,X) | m(Y).
% 51 [hyper:39,44,44,factor] m(X).
% 56 [hyper:38,35,cut:51] p(X,sk1(X)).
% 61 [hyper:37,56] p(X,X).
% 62 [hyper:39,56,cut:61] 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 3
% clause depth limited to 4
% seconds given: 13
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 17
% derived clauses: 68
% kept clauses: 16
% kept size sum: 76
% kept mid-nuclei: 17
% kept new demods: 0
% forw unit-subs: 10
% forw double-subs: 2
% forw overdouble-subs: 0
% backward subs: 20
% fast unit cutoff: 3
% full unit cutoff: 0
% dbl unit cutoff: 0
% real runtime: 0.1
% process. runtime: 0.0
% 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/SYN728-1+noeq.in")
%
%------------------------------------------------------------------------------