TSTP Solution File: SYN332-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SYN332-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 : art10.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/SYN332-1+noeq.in
% Using automatic strategy selection.
% Time limit in seconds: 600
%
% prove-all-passes started
%
% detected problem class: nne
% detected subclass: medium
%
% strategies selected:
% (hyper 27 #f 2 5)
% (binary-unit 10 #f 2 5)
% (binary-double 16 #f 2 5)
% (binary 54 #t 2 5)
% (binary-order 27 #f 2 5)
% (binary-posweight-order 125 #f)
% (binary-order-sos 54 #t)
% (binary-unit-uniteq 27 #f)
% (binary-weightorder 54 #f)
% (binary-order 54 #f)
% (hyper-order 43 #f)
% (binary 109 #t)
%
%
% ********* EMPTY CLAUSE DERIVED *********
%
% **** EMPTY CLAUSE DERIVED ****
% By given clause simplification.
%
%
% timer checkpoints: c(14,40,0,28,0,0)
%
%
% START OF PROOF
% 15 [] -f(z(X,Y),Y) | f(Y,X) | f(X,Y).
% 20 [] -f(z(X,Y),z(X,Y)) | -f(Y,X) | f(X,Y).
% 21 [] -f(X,z(X,Y)) | f(Y,z(X,Y)).
% 23 [] -f(X,z(X,Y)) | f(z(X,Y),X).
% 25 [] f(X,z(X,Y)) | f(Y,X).
% 28 [] -f(z(X,Y),Y) | -f(Y,X) | -f(X,Y).
% 34 [hyper:21,25] f(X,z(Y,X)) | f(X,Y).
% 35 [hyper:23,25] f(z(X,Y),X) | f(Y,X).
% 52 [hyper:15,35] f(X,X).
% 58 [hyper:20,52,34] f(z(X,Y),Y) | f(Y,X).
% 74 [hyper:15,58] f(X,Y) | f(Y,X).
% 120 [hyper:20,74,cut:52] f(X,Y).
% 121 [input:28,cut:120,cut:120,cut:120] 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 2
% seconds given: 27
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 11
% derived clauses: 631
% kept clauses: 28
% kept size sum: 251
% kept mid-nuclei: 52
% kept new demods: 0
% forw unit-subs: 72
% forw double-subs: 82
% forw overdouble-subs: 0
% backward subs: 21
% fast unit cutoff: 12
% full unit cutoff: 0
% dbl unit cutoff: 3
% real runtime: 0.0
% process. runtime: 0.0
% specific non-discr-tree subsumption statistics:
% tried: 19
% length fails: 0
% strength fails: 0
% predlist fails: 12
% aux str. fails: 0
% by-lit fails: 0
% full subs tried: 7
% full subs fail: 7
%
% ; 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/SYN332-1+noeq.in")
%
%------------------------------------------------------------------------------