↑ Up

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

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : SWC274-1 : TPTP v3.4.2. Released v2.4.0.
% Transfm  : add_equality:r
% Format   : otter:hypothesis:set(auto),clear(print_given)
% Command  : gandalf-wrapper -time %d %s

% Computer : art03.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 49.4s
% Output   : Assurance 49.4s
% 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/SWC/SWC274-1+eq_r.in
% Using automatic strategy selection.
% Time limit in seconds: 600
% 
% prove-all-passes started
% 
% detected problem class: neq
% detected subclass: big
% 
% strategies selected: 
% (hyper 28 #f 5 19)
% (binary-unit 28 #f 5 19)
% (binary-double 11 #f 5 19)
% (binary-double 17 #f)
% (binary-double 17 #t)
% (binary 87 #t 5 19)
% (binary-order 28 #f 5 19)
% (binary-posweight-order 58 #f)
% (binary-posweight-lex-big-order 28 #f)
% (binary-posweight-lex-small-order 11 #f)
% (binary-order-sos 28 #t)
% (binary-unit-uniteq 28 #f)
% (binary-weightorder 28 #f)
% (binary-weightorder-sos 17 #f)
% (binary-order 28 #f)
% (hyper-order 17 #f)
% (binary 141 #t)
% 
% 
% ********* EMPTY CLAUSE DERIVED *********
% 
% 
% timer checkpoints: c(200,40,1,406,0,1,50259,4,2149,52416,5,2802,52417,1,2804,52417,50,2806,52417,40,2806,52623,0,2821,146805,3,4223,185715,4,4922)
% 
% 
% START OF PROOF
% 52445 [] ss^list(skaf68(X)).
% 52446 [] ss^list(skaf67(X)).
% 52447 [] ss^list(skaf66(X)).
% 52448 [] ss^item(skaf65(X)).
% 52449 [] ss^item(skaf64(X)).
% 52509 [] -leq(skaf64(X),skaf65(X)) | -ss^list(X) | totalordered^p(X).
% 52521 [] -lt(X,Y) | leq(X,Y) | -ss^item(X) | -ss^item(Y).
% 52582 [] equal(app(app(skaf66(X),cons(skaf64(X),skaf67(X))),cons(skaf65(X),skaf68(X))),X) | -ss^list(X) | totalordered^p(X).
% 52599 [] -equal(app(app(X,cons(Y,Z)),cons(U,V)),W) | lt(Y,U) | -ss^item(U) | -ss^item(Y) | -ss^list(W) | -ss^list(Z) | -ss^list(X) | -ss^list(V) | -strictordered^p(W).
% 52605 [] -totalordered^p(sk1).
% 52608 [] strictordered^p(sk3).
% 52612 [] equal(sk1,sk3).
% 52617 [] ss^list(sk1).
% 53398 [para:52612.1.2,52608.1.1] strictordered^p(sk1).
% 55077 [binary:52605,52509.3,cut:52617] -leq(skaf64(sk1),skaf65(sk1)).
% 55750 [binary:55077,52521.2,cut:52449,cut:52448] -lt(skaf64(sk1),skaf65(sk1)).
% 62460 [binary:52605,52582.3,cut:52617] equal(app(app(skaf66(sk1),cons(skaf64(sk1),skaf67(sk1))),cons(skaf65(sk1),skaf68(sk1))),sk1).
% 191041 [binary:62460,52599,cut:55750,cut:52448,cut:52449,cut:52617,cut:52446,cut:52447,cut:52445,cut:53398] contradiction
% END OF PROOF
% 
% Proof found by the following strategy:
% 
% using binary resolution
% not using sos strategy
% using unit paramodulation 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 19
% clause depth limited to 5
% seconds given: 28
% 
% 
% old unit clauses discarded
% 
% ***GANDALF_FOUND_A_REFUTATION***
% 
% Global statistics over all passes: 
% 
%  given clauses:    1509
%  derived clauses:   225528
%  kept clauses:      115326
%  kept size sum:     0
%  kept mid-nuclei:   19434
%  kept new demods:   30921
%  forw unit-subs:    9794
%  forw double-subs: 4822
%  forw overdouble-subs: 2196
%  backward subs:     14
%  fast unit cutoff:  12240
%  full unit cutoff:  0
%  dbl  unit cutoff:  223
%  real runtime  :  50.20
%  process. runtime:  49.64
% specific non-discr-tree subsumption statistics: 
%  tried:           994167
%  length fails:    1325
%  strength fails:  77158
%  predlist fails:  710848
%  aux str. fails:  29682
%  by-lit fails:    28955
%  full subs tried: 126369
%  full subs fail:  123855
% 
% ; 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/SWC/SWC274-1+eq_r.in")
% 
%------------------------------------------------------------------------------