TSTP Solution File: SYN036-4 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SYN036-4 : 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 : 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/SYN036-4+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 11)
% (binary-unit 10 #f 2 11)
% (binary-double 16 #f 2 11)
% (binary 54 #t 2 11)
% (binary-order 27 #f 2 11)
% (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)
%
%
% SOS clause
% -p(cx) | -p(X) | -p(fy5(X)) | -q(cw) | -q(Y) | -q(fz5(Y)).
% was split for some strategies as:
% -q(Y) | -q(fz5(Y)).
% -p(X) | -p(fy5(X)).
% -p(cx).
% -q(cw).
%
% ********* EMPTY CLAUSE DERIVED *********
%
%
% timer checkpoints: c(32,40,0,67,0,1)
%
%
% START OF PROOF
% 33 [] q(cw) | p(cx) | q(fz5(X)) | p(fy5(Y)) | q(X) | p(Y).
% 35 [] -q(cw) | p(cx) | -q(fz(X)) | p(fy(Y)) | -q(X) | p(Y).
% 42 [] -p(cx) | q(cw) | -p(fy(X)) | q(fz(Y)) | -p(X) | q(Y).
% 44 [] q(cw) | p(cx) | p(fy(X)) | -q(Y) | p(X).
% 45 [] -q(cw) | p(cx) | p(fy(X)) | q(Y) | p(X).
% 48 [] -q(cw) | p(cx) | -q(fz5(X)) | -q(X) | -p(X).
% 49 [] q(cw) | p(cx) | q(fz(X)) | -p(Y) | q(X).
% 50 [] q(cw) | p(fy5(X)) | -q(Y) | -p(Z) | p(X).
% 51 [] q(cw) | -p(fy5(X)) | -q(Y) | -p(Z) | p(U).
% 53 [] -q(cw) | -p(fy(X)) | -p(X) | q(Y) | p(Z).
% 54 [] -p(cx) | q(cw) | q(fz(X)) | q(X) | p(Y).
% 57 [] -q(cw) | -p(cx) | -q(fz5(X)) | -q(X) | p(X).
% 58 [] -p(cx) | q(cw) | -p(fy5(X)) | -q(Y) | -p(X).
% 59 [] -q(cw) | -p(cx) | -p(fy5(X)) | -p(X) | q(Y).
% 61 [] -q(cw) | p(cx) | -p(X) | q(Y).
% 62 [] -p(cx) | q(cw) | -q(X) | p(Y).
% 64 [] -q(cw) | -p(cx) | -q(fz5(X)) | -p(fy5(Y)) | -q(X) | -p(Y).
% 70 [input:33,factor:factor:factor] q(fz5(cw)) | p(fy5(cx)) | q(cw) | p(cx).
% 92 [hyper:44,70,factor:factor] p(fy(cx)) | p(fy5(cx)) | q(cw) | p(cx).
% 143 [hyper:50,92,70,factor] p(fy5(cx)) | q(cw) | p(cx).
% 178 [hyper:49,143,factor] q(fz(cw)) | q(cw) | p(cx).
% 275 [hyper:51,178,143,143,factor] q(cw) | p(cx).
% 279 [hyper:54,178,factor] q(fz(cw)) | q(cw) | p(X).
% 306 [hyper:45,275,factor] p(fy(cx)) | p(cx) | q(X).
% 336 [hyper:42,279,279,275,factor] q(fz(cw)) | q(cw).
% 353 [hyper:62,279,275,factor] q(cw) | p(X).
% 475 [hyper:58,336,353,353,353] q(cw).
% 566 [hyper:61,306,cut:475,factor] p(cx) | q(X).
% 569 [?] ?
% 578 [hyper:35,566,566,slowcut:475] p(cx) | p(fy(X)) | p(X).
% 609 [hyper:53,566,cut:475,binarycut:569,factor] q(X) | p(Y).
% 664 [hyper:59,609,609,609,cut:475,factor:factor:factor] q(X).
% 693 [input:48,cut:475,cut:664,cut:664] p(cx) | -p(X).
% 706 [hyper:693,578,factor] p(cx).
% 711 [hyper:57,706,cut:475,cut:664,cut:664] p(X).
% 713 [hyper:64,706,cut:475,cut:664,cut:711,cut:664,cut:711] 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 11
% clause depth limited to 2
% seconds given: 9
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 30
% derived clauses: 1878
% kept clauses: 110
% kept size sum: 1045
% kept mid-nuclei: 435
% kept new demods: 0
% forw unit-subs: 11
% forw double-subs: 182
% forw overdouble-subs: 373
% backward subs: 76
% fast unit cutoff: 122
% full unit cutoff: 15
% dbl unit cutoff: 39
% real runtime: 0.6
% process. runtime: 0.5
% specific non-discr-tree subsumption statistics:
% tried: 4780
% length fails: 151
% strength fails: 1240
% predlist fails: 1696
% aux str. fails: 119
% by-lit fails: 266
% full subs tried: 1116
% full subs fail: 793
%
% ; 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/SYN036-4+noeq.in")
%
%------------------------------------------------------------------------------