TSTP Solution File: SYN005-1.010 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SYN005-1.010 : TPTP v3.4.2. Released v1.0.0.
% Transfm : add_equality:r
% Format : otter:hypothesis:set(auto),clear(print_given)
% Command : gandalf-wrapper -time %d %s
% Computer : art01.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/SYN005-1.010+noeq.in
% Using automatic strategy selection.
% Time limit in seconds: 600
%
% prove-all-passes started
%
% detected problem class: hne
% detected subclass: medium
% detected subclass: long
%
% strategies selected:
% (hyper 57 #f 1 19)
% (binary-unit 28 #f 1 19)
% (binary-double 28 #f)
% (binary-posweight-order 28 #f 1 19)
% (binary 28 #t 1 19)
% (hyper 28 #t)
% (hyper 159 #f)
% (binary-posweight-order 85 #f)
% (binary-weightorder 39 #f)
% (binary-order 28 #f)
% (binary-unit 45 #f)
% (binary 47 #t)
%
%
% ********* EMPTY CLAUSE DERIVED *********
%
%
% timer checkpoints: c(11,40,1,22,0,1)
%
%
% START OF PROOF
% 12 [] p_10(a,a).
% 13 [] p_9(a,a).
% 14 [] p_8(a,a).
% 15 [] p_7(a,a).
% 16 [] p_6(a,a).
% 17 [] p_5(a,a).
% 18 [] p_4(a,a).
% 19 [] p_3(a,a).
% 20 [] p_2(a,a).
% 21 [] p_1(a,a).
% 22 [] -p_10(X,Y) | -p_9(Z,X) | -p_8(U,Z) | -p_7(V,U) | -p_6(W,V) | -p_5(X1,W) | -p_4(X2,X1) | -p_3(X3,X2) | -p_2(X4,X3) | -p_1(Y,X4).
% 186 [hyper:22,20,19,18,17,16,15,14,13,12,cut:21] 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 19
% clause depth limited to 1
% seconds given: 57
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 10
% derived clauses: 164
% kept clauses: 0
% kept size sum: 0
% kept mid-nuclei: 162
% kept new demods: 0
% forw unit-subs: 0
% forw double-subs: 0
% forw overdouble-subs: 0
% backward subs: 0
% fast unit cutoff: 17
% full unit cutoff: 0
% dbl unit cutoff: 0
% real runtime: 0.1
% process. runtime: 0.1
% specific non-discr-tree subsumption statistics:
% tried: 55
% length fails: 0
% strength fails: 55
% 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/SYN005-1.010+noeq.in")
%
%------------------------------------------------------------------------------