TSTP Solution File: KRS001-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : KRS001-1 : TPTP v3.4.2. Released v2.0.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/KRS/KRS001-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 7)
% (binary-unit 10 #f 2 7)
% (binary-double 16 #f 2 7)
% (binary 54 #t 2 7)
% (binary-order 27 #f 2 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(16,40,0,32,0,0)
%
%
% START OF PROOF
% 17 [] -c(X) | r2least(X).
% 19 [] -equalish(u1r2(X),u1r1(X)) | -r2least(X).
% 20 [] r(X,u1r1(X)) | -r2least(X).
% 21 [] r(X,u1r2(X)) | -r2least(X).
% 23 [] -d(X) | r1most(X).
% 25 [] -r(X,Y) | -r(X,Z) | equalish(Y,Z) | -r1most(X).
% 29 [] -e(X) | d(X).
% 30 [] -e(X) | c(X).
% 32 [] e(exist).
% 33 [hyper:29,32] d(exist).
% 34 [hyper:30,32] c(exist).
% 35 [hyper:23,33] r1most(exist).
% 36 [hyper:17,34] r2least(exist).
% 39 [hyper:20,36] r(exist,u1r1(exist)).
% 40 [hyper:21,36] r(exist,u1r2(exist)).
% 52 [hyper:25,40,39,cut:35] equalish(u1r2(exist),u1r1(exist)).
% 56 [hyper:19,52,cut:36] 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 2
% seconds given: 27
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 16
% derived clauses: 40
% kept clauses: 10
% kept size sum: 36
% kept mid-nuclei: 6
% kept new demods: 0
% forw unit-subs: 16
% forw double-subs: 0
% forw overdouble-subs: 0
% backward subs: 0
% fast unit cutoff: 5
% full unit cutoff: 0
% dbl unit cutoff: 0
% real runtime : 0.1
% process. runtime: 0.1
% specific non-discr-tree subsumption statistics:
% tried: 2
% length fails: 0
% strength fails: 2
% 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/KRS/KRS001-1+noeq.in")
%
%------------------------------------------------------------------------------