TSTP Solution File: SYN573-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SYN573-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 : art03.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/SYN573-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 6 7)
% (binary-unit 10 #f 6 7)
% (binary-double 16 #f 6 7)
% (binary 54 #t 6 7)
% (binary-order 27 #f 6 7)
% (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 ****
%
%
% timer checkpoints: c(21,40,0,42,0,0)
%
%
% START OF PROOF
% 22 [] p11(X,f3(f8(Y),f3(f8(Z),f5(f6(f7(c14)))))) | -p11(X,Y).
% 25 [] -p11(X,Y) | -p2(Y,U) | -p2(X,Z) | p11(Z,U).
% 26 [] p11(X,f3(f8(Y),f3(f8(X),f5(f6(f7(c14)))))).
% 28 [] p2(X,f9(c17)) | p11(X,c16) | -p12(X).
% 29 [] -p2(X,Y) | -p2(X,Z) | p2(Y,Z).
% 39 [] p2(X,X).
% 41 [] p12(c15).
% 42 [] -p11(c15,f3(f8(c16),f3(f8(f9(c17)),f5(f6(f7(c14)))))).
% 44 [hyper:28,41] p2(c15,f9(c17)) | p11(c15,c16).
% 141 [hyper:22,44,slowcut:42] p2(c15,f9(c17)).
% 180 [hyper:29,141,39] p2(f9(c17),c15).
% 530 [hyper:25,26,39,180,slowcut:42] 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 7
% clause depth limited to 6
% seconds given: 27
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 34
% derived clauses: 874
% kept clauses: 308
% kept size sum: 3505
% kept mid-nuclei: 169
% kept new demods: 0
% forw unit-subs: 381
% forw double-subs: 1
% forw overdouble-subs: 0
% backward subs: 3
% fast unit cutoff: 5
% full unit cutoff: 1
% dbl unit cutoff: 0
% real runtime: 0.1
% process. runtime: 0.1
% specific non-discr-tree subsumption statistics:
% tried: 26
% length fails: 0
% strength fails: 2
% predlist fails: 23
% aux str. fails: 0
% by-lit fails: 0
% full subs tried: 1
% full subs fail: 1
%
% ; 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/SYN573-1+noeq.in")
%
%------------------------------------------------------------------------------