TSTP Solution File: SYN037-2 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SYN037-2 : 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/SYN037-2+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)
%
%
% SOS clause
% -m1(0) | -m3(0) | -p(X) | -p(fy(X)).
% was split for some strategies as:
% -p(X) | -p(fy(X)).
% -m1(0).
% -m3(0).
%
% ********* EMPTY CLAUSE DERIVED *********
%
%
% timer checkpoints: c(22,40,0,44,0,0)
%
%
% START OF PROOF
% 23 [] q(cu) | m1(0).
% 24 [] m2(0) | p(cv).
% 25 [] -q(cuu) | m1(0).
% 26 [] -p(cvv) | m2(0).
% 27 [] -m2(0) | -p(X) | p(Y).
% 28 [] -m1(0) | -q(X) | q(Y).
% 29 [] m3(0) | m1(0) | p(fy3(X)) | p(X).
% 30 [] q(cw) | m2(0) | m3(0) | -q(X).
% 31 [] -q(cw) | m2(0) | m3(0) | q(X).
% 32 [] m3(0) | m1(0) | -p(fy3(X)) | -p(X).
% 33 [] -m3(0) | m2(0) | q(fz2(X)) | q(X).
% 34 [] -m3(0) | m2(0) | -q(fz2(X)) | -q(X).
% 35 [] -m3(0) | p(cx) | m1(0) | -p(X).
% 36 [] -p(cx) | -m3(0) | m1(0) | p(X).
% 37 [] -m2(0) | m3(0) | q(fz5(X)) | q(X).
% 38 [] -m2(0) | m3(0) | -q(fz5(X)) | -q(X).
% 39 [] -m2(0) | -m3(0) | q(cw) | -q(X).
% 40 [] -q(cw) | -m2(0) | -m3(0) | q(X).
% 41 [] -m1(0) | p(cx) | m3(0) | -p(X).
% 42 [] -p(cx) | -m1(0) | m3(0) | p(X).
% 43 [] -m3(0) | -m1(0) | p(fy(X)) | p(X).
% 44 [] -m3(0) | -m1(0) | -p(fy(X)) | -p(X).
% 48 [hyper:30,23] q(cw) | m2(0) | m3(0) | m1(0).
% 60 [hyper:37,24] p(cv) | m3(0) | q(fz5(X)) | q(X).
% 82 [hyper:27,29,24,factor:factor] p(cv) | m3(0) | m1(0).
% 114 [hyper:39,82,23,binarycut:24] q(cw) | p(cv) | m1(0).
% 135 [hyper:40,114,82,binarycut:24] p(cv) | m1(0) | q(X).
% 145 [hyper:25,135] p(cv) | m1(0).
% 210 [hyper:27,48,29,factor] q(cw) | m3(0) | m1(0) | p(X).
% 211 [hyper:31,48] m2(0) | m3(0) | m1(0) | q(X).
% 231 [hyper:32,210,145] q(cw) | m3(0) | m1(0).
% 235 [hyper:35,210,145,factor] q(cw) | p(cx) | m1(0).
% 270 [hyper:36,235,231] q(cw) | m1(0) | p(X).
% 281 [hyper:26,270] q(cw) | m2(0) | m1(0).
% 303 [hyper:39,281,231,23] q(cw) | m1(0).
% 326 [hyper:25,211] m2(0) | m3(0) | m1(0).
% 352 [hyper:27,326,29,factor] m3(0) | m1(0) | p(X).
% 372 [hyper:32,352,145] m3(0) | m1(0).
% 387 [?] ?
% 399 [hyper:40,372,binarycut:303,binarycut:387] m1(0) | q(X).
% 409 [hyper:25,399] m1(0).
% 431 [hyper:28,60,cut:409,factor] p(cv) | m3(0) | q(X).
% 449 [hyper:38,431,431,binarycut:24] p(cv) | m3(0).
% 470 [hyper:41,449,cut:409] p(cx) | m3(0).
% 487 [hyper:42,470,cut:409] m3(0) | p(X).
% 497 [hyper:26,487] m2(0) | m3(0).
% 504 [hyper:43,487,cut:409,factor] p(fy(X)) | p(X).
% 512 [hyper:33,497] m2(0) | q(fz2(X)) | q(X).
% 514 [hyper:37,497] m3(0) | q(fz5(X)) | q(X).
% 520 [hyper:26,504] p(fy(cvv)) | m2(0).
% 524 [hyper:27,504,24,factor:factor] p(cv).
% 535 [hyper:27,520,slowcut:524,factor] p(fy(cvv)).
% 544 [hyper:28,512,cut:409,factor] m2(0) | q(X).
% 559 [hyper:34,544,497,544] m2(0).
% 567 [hyper:27,559,slowcut:535] p(X).
% 581 [hyper:28,514,cut:409,factor] m3(0) | q(X).
% 583 [hyper:44,581,cut:409,cut:567,cut:567] q(X).
% 584 [hyper:38,581,cut:559,cut:583] m3(0).
% 585 [hyper:44,584,cut:409,cut:567,cut:567] 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: 9
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 59
% derived clauses: 1528
% kept clauses: 114
% kept size sum: 831
% kept mid-nuclei: 349
% kept new demods: 0
% forw unit-subs: 33
% forw double-subs: 229
% forw overdouble-subs: 400
% backward subs: 103
% fast unit cutoff: 58
% full unit cutoff: 4
% dbl unit cutoff: 19
% real runtime: 0.5
% process. runtime: 0.3
% specific non-discr-tree subsumption statistics:
% tried: 2533
% length fails: 313
% strength fails: 771
% predlist fails: 884
% aux str. fails: 24
% by-lit fails: 40
% full subs tried: 332
% full subs fail: 77
%
% ; 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/SYN037-2+noeq.in")
%
%------------------------------------------------------------------------------