TSTP Solution File: SYN583-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SYN583-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 : art08.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/SYN583-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 3 9)
% (binary-unit 10 #f 3 9)
% (binary-double 16 #f 3 9)
% (binary 54 #t 3 9)
% (binary-order 27 #f 3 9)
% (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(25,40,0,50,0,0)
%
%
% START OF PROOF
% 28 [] p2(f6(X,Y),f6(Z,U)) | -p5(X,Z) | -p2(Y,U).
% 30 [] -p11(X,Y) | -p2(Y,U) | -p2(X,Z) | p11(Z,U).
% 37 [] p2(f4(X),f4(Y)) | -p2(X,Y).
% 43 [] p11(f4(f6(c15,c13)),c16).
% 46 [] p2(c13,c18).
% 47 [] p5(X,X).
% 48 [] p2(X,X).
% 50 [] -p11(f4(f6(c15,c18)),c16).
% 89 [hyper:28,46,47] p2(f6(X,c13),f6(X,c18)).
% 1650 [hyper:37,89] p2(f4(f6(X,c13)),f4(f6(X,c18))).
% 3118 [hyper:30,1650,43,48,cut:50] 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 9
% clause depth limited to 3
% seconds given: 27
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 160
% derived clauses: 6621
% kept clauses: 173
% kept size sum: 1233
% kept mid-nuclei: 2876
% kept new demods: 0
% forw unit-subs: 3136
% forw double-subs: 134
% forw overdouble-subs: 0
% backward subs: 0
% fast unit cutoff: 4
% full unit cutoff: 0
% dbl unit cutoff: 0
% real runtime: 0.10
% process. runtime: 0.11
% specific non-discr-tree subsumption statistics:
% tried: 549
% length fails: 0
% strength fails: 38
% predlist fails: 507
% aux str. fails: 0
% by-lit fails: 0
% full subs tried: 4
% full subs fail: 4
%
% ; 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/SYN583-1+noeq.in")
%
%------------------------------------------------------------------------------