↑ Up

Gandalf---c-2.6.UNS-Ass.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : SYN004-1.007 : 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 : art06.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/SYN004-1.007+noeq.in
% Using automatic strategy selection.
% Time limit in seconds: 600
% 
% prove-all-passes started
% 
% detected problem class: hne
% detected subclass: medium
% detected subclass: short
% 
% strategies selected: 
% (hyper 12 #t 1 5)
% (binary-unit 30 #f 1 5)
% (binary-posweight-order 90 #f 1 5)
% (binary-double 30 #f)
% (binary 48 #t 1 5)
% (hyper 30 #f)
% (binary-posweight-order 180 #f)
% (binary-weightorder 42 #f)
% (binary-order 30 #f)
% (binary-unit 48 #f)
% (binary 60 #t)
% 
% 
% SOS clause 
% -p_7(0) | -q_7(0).
% was split for some strategies as: 
% -p_7(0).
% -q_7(0).
% 
% ********* EMPTY CLAUSE DERIVED *********
% 
% 
% timer checkpoints: c(15,40,0,30,0,0,31,50,0,46,0,0,47,50,0,62,0,0,63,50,0,78,0,0,79,50,0,94,0,0,95,50,0,110,0,0,111,50,0,126,0,0,127,50,0,142,0,0,143,50,0,158,0,0,159,50,0,174,0,0,175,50,0,190,0,0,191,50,0,206,0,0,207,50,0,222,0,0,223,50,0,238,0,0,239,50,0,254,0,0,255,50,0,270,0,0,271,50,0,286,0,0,287,50,0,302,0,1,303,50,1,318,0,1,319,50,1,334,0,1,335,50,1,350,0,1,351,50,1,351,40,1,366,0,1)
% 
% 
% START OF PROOF
% 352 [] q_1(0).
% 353 [] p_1(0).
% 354 [] -q_6(0) | -p_6(0) | q_7(0).
% 355 [] -q_5(0) | -p_5(0) | q_6(0).
% 356 [] -q_4(0) | -p_4(0) | q_5(0).
% 357 [] -q_3(0) | -p_3(0) | q_4(0).
% 358 [] -q_2(0) | -p_2(0) | q_3(0).
% 359 [?] ?
% 360 [] -q_6(0) | -p_6(0) | p_7(0).
% 361 [] -q_5(0) | -p_5(0) | p_6(0).
% 362 [] -q_4(0) | -p_4(0) | p_5(0).
% 363 [] -q_3(0) | -p_3(0) | p_4(0).
% 364 [] -q_2(0) | -p_2(0) | p_3(0).
% 365 [?] ?
% 366 [] -q_7(0) | -p_7(0).
% 373 [input:359,cut:352,cut:353] q_2(0).
% 374 [binary:358,373] -p_2(0) | q_3(0).
% 381 [binary:373,364] -p_2(0) | p_3(0).
% 383 [input:365,cut:352,cut:353] p_2(0).
% 384 [binary:374,383] q_3(0).
% 385 [binary:381,383] p_3(0).
% 386 [binary:357,384,cut:385] q_4(0).
% 387 [binary:363,384,cut:385] p_4(0).
% 388 [binary:356,386,cut:387] q_5(0).
% 389 [binary:362,386,cut:387] p_5(0).
% 390 [binary:355,388,cut:389] q_6(0).
% 391 [binary:361,388,cut:389] p_6(0).
% 392 [binary:354,390,cut:391] q_7(0).
% 393 [binary:360,390,cut:391] p_7(0).
% 394 [binary:366,392,cut:393] contradiction
% END OF PROOF
% 
% Proof found by the following strategy:
% 
% using binary resolution
% not using sos strategy
% using unit strategy
% using dynamic demodulation
% using ordered paramodulation
% using kb ordering for equality
% preferring bigger arities for lex ordering
% using clause demodulation
% clause length limited to 5
% clause depth limited to 1
% seconds given: 10
% 
% 
% ***GANDALF_FOUND_A_REFUTATION***
% 
% Global statistics over all passes: 
% 
%  given clauses:    47
%  derived clauses:   49
%  kept clauses:      12
%  kept size sum:     28
%  kept mid-nuclei:   0
%  kept new demods:   0
%  forw unit-subs:    0
%  forw double-subs: 0
%  forw overdouble-subs: 0
%  backward subs:     22
%  fast unit cutoff:  11
%  full unit cutoff:  0
%  dbl  unit cutoff:  0
%  real runtime:  0.2
%  process. runtime:  0.1
% specific non-discr-tree subsumption statistics: 
%  tried:           12
%  length fails:    0
%  strength fails:  0
%  predlist fails:  12
%  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/SYN004-1.007+noeq.in")
% 
%------------------------------------------------------------------------------