TSTP Solution File: SYN724-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SYN724-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 : art02.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/SYN724-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 1 5)
% (binary-unit 10 #f 1 5)
% (binary-double 16 #f)
% (binary 16 #t 1 5)
% (binary-posweight-order 181 #f)
% (binary-order-sos 54 #t)
% (binary-unit-uniteq 54 #f)
% (binary-order 27 #f 1 5)
% (binary-weightorder 71 #f)
% (binary-order 27 #f)
% (hyper-order 54 #f)
% (binary 63 #t)
%
%
% SOS clause
% -r(sk2) | -s(sk1) | -s(sk2).
% was split for some strategies as:
% -r(sk2).
% -s(sk1).
% -s(sk2).
%
% ********* EMPTY CLAUSE DERIVED *********
%
%
% timer checkpoints: c(5,40,0,10,0,0)
%
%
% START OF PROOF
% 6 [] -s(sk1) | r(sk2).
% 7 [] -r(sk2) | -s(sk2) | r(sk1).
% 8 [] r(sk1) | r(sk2).
% 9 [] -r(X) | s(X).
% 10 [] -r(sk2) | -s(sk1) | -s(sk2).
% 17 [hyper:9,8,binarycut:6] r(sk2).
% 21 [hyper:9,17] s(sk2).
% 23 [hyper:7,21,cut:17] r(sk1).
% 25 [hyper:9,23] s(sk1).
% 26 [hyper:10,25,cut:17,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 5
% clause depth limited to 1
% seconds given: 9
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 8
% derived clauses: 19
% kept clauses: 5
% kept size sum: 12
% kept mid-nuclei: 5
% kept new demods: 0
% forw unit-subs: 3
% forw double-subs: 1
% forw overdouble-subs: 0
% backward subs: 5
% fast unit cutoff: 4
% full unit cutoff: 0
% dbl unit cutoff: 1
% real runtime: 0.0
% process. runtime: 0.0
% specific non-discr-tree subsumption statistics:
% tried: 1
% length fails: 0
% strength fails: 0
% predlist fails: 1
% 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/SYN724-1+noeq.in")
%
%------------------------------------------------------------------------------