TSTP Solution File: SYN352-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SYN352-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 : 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/SYN352-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 2 5)
% (binary-unit 10 #f 2 5)
% (binary-double 16 #f)
% (binary 16 #t 2 5)
% (binary-posweight-order 181 #f)
% (binary-order-sos 54 #t)
% (binary-unit-uniteq 54 #f)
% (binary-order 27 #f 2 5)
% (binary-weightorder 71 #f)
% (binary-order 27 #f)
% (hyper-order 54 #f)
% (binary 63 #t)
%
%
% **** EMPTY CLAUSE DERIVED ****
%
%
% timer checkpoints: c(7,40,1,14,0,1,69,50,2,76,0,2)
%
%
% START OF PROOF
% 70 [] f(X,z(X,Y)) | f(Y,z(X,Y)) | -f(X,Y).
% 73 [] f(z(X,Y),z(X,Y)) | f(X,Y).
% 76 [] -f(Y,z(Y,X)) | -f(X,z(Y,X)) | -f(Y,X).
% 102 [hyper:70,73,factor] f(z(X,X),z(X,X)) | f(X,z(X,X)).
% 125 [hyper:76,102,102,73] f(z(X,X),z(X,X)).
% 126 [hyper:70,102] f(z(X,X),z(z(X,X),z(X,X))) | f(X,z(X,X)).
% 128 [hyper:76,102,binarycut:126,binarycut:126] f(X,z(X,X)).
% 130 [hyper:76,128,cut:128,slowcut:125] 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 5
% clause depth limited to 3
% seconds given: 27
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 24
% derived clauses: 433
% kept clauses: 30
% kept size sum: 409
% kept mid-nuclei: 59
% kept new demods: 0
% forw unit-subs: 86
% forw double-subs: 19
% forw overdouble-subs: 10
% backward subs: 10
% fast unit cutoff: 7
% full unit cutoff: 0
% dbl unit cutoff: 2
% real runtime: 0.0
% process. runtime: 0.1
% specific non-discr-tree subsumption statistics:
% tried: 59
% length fails: 4
% strength fails: 0
% predlist fails: 18
% aux str. fails: 5
% by-lit fails: 0
% full subs tried: 32
% full subs fail: 22
%
% ; 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/SYN352-1+noeq.in")
%
%------------------------------------------------------------------------------