↑ Up

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

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

% Computer : art09.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/GRP/GRP124-8.004+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 1 11)
% (binary-unit 10 #f 1 11)
% (binary-double 16 #f 1 11)
% (binary 54 #t 1 11)
% (binary-order 27 #f 1 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)
% 
% 
% ********* EMPTY CLAUSE DERIVED *********
% 
% 
% timer checkpoints: c(48,40,1,96,0,1)
% 
% 
% START OF PROOF
% 70 [] group_element(e_1).
% 71 [] group_element(e_2).
% 72 [] group_element(e_3).
% 74 [] -equalish(e_1,e_2).
% 75 [] -equalish(e_1,e_3).
% 77 [] -equalish(e_2,e_1).
% 78 [] -equalish(e_2,e_3).
% 80 [] -equalish(e_3,e_1).
% 81 [] -equalish(e_3,e_2).
% 86 [] product1(X,Y,e_3) | product1(X,Y,e_4) | product1(X,Y,e_2) | product1(X,Y,e_1) | -group_element(Y) | -group_element(X).
% 88 [] -product1(X,U,Z) | -product1(X,Y,Z) | equalish(Y,U).
% 89 [] -product1(U,Y,Z) | -product1(X,Y,Z) | equalish(X,U).
% 90 [] product1(X,X,X).
% 92 [] -product2(X,Y,U) | -product2(X,Y,Z) | equalish(Z,U).
% 95 [] product2(X,X,X).
% 96 [] -product1(Z,X,U) | -product1(X,Y,Z) | product2(U,Y,X).
% 104 [hyper:86,71,70] product1(e_1,e_2,e_4) | product1(e_1,e_2,e_3) | product1(e_1,e_2,e_2) | product1(e_1,e_2,e_1).
% 106 [hyper:86,71,70] product1(e_2,e_1,e_3) | product1(e_2,e_1,e_4) | product1(e_2,e_1,e_1) | product1(e_2,e_1,e_2).
% 113 [hyper:86,72,70] product1(e_1,e_3,e_4) | product1(e_1,e_3,e_3) | product1(e_1,e_3,e_2) | product1(e_1,e_3,e_1).
% 114 [hyper:86,72,71] product1(e_2,e_3,e_4) | product1(e_2,e_3,e_3) | product1(e_2,e_3,e_2) | product1(e_2,e_3,e_1).
% 2795 [hyper:88,104,90,cut:74] product1(e_1,e_2,e_2) | product1(e_1,e_2,e_4) | product1(e_1,e_2,e_3).
% 5150 [hyper:88,106,90,cut:77] product1(e_2,e_1,e_1) | product1(e_2,e_1,e_3) | product1(e_2,e_1,e_4).
% 6200 [hyper:88,113,90,cut:75] product1(e_1,e_3,e_2) | product1(e_1,e_3,e_4) | product1(e_1,e_3,e_3).
% 6619 [hyper:88,114,90,cut:78] product1(e_2,e_3,e_3) | product1(e_2,e_3,e_1) | product1(e_2,e_3,e_4).
% 8022 [hyper:89,2795,90,cut:77] product1(e_1,e_2,e_3) | product1(e_1,e_2,e_4).
% 8162 [hyper:89,5150,90,cut:74] product1(e_2,e_1,e_4) | product1(e_2,e_1,e_3).
% 8434 [hyper:89,6200,90,cut:80] product1(e_1,e_3,e_2) | product1(e_1,e_3,e_4).
% 8465 [hyper:88,8434,8022,cut:78] product1(e_1,e_3,e_2) | product1(e_1,e_2,e_3).
% 8585 [hyper:89,6619,90,cut:81] product1(e_2,e_3,e_4) | product1(e_2,e_3,e_1).
% 8620 [hyper:88,8585,8162,cut:75] product1(e_2,e_3,e_1) | product1(e_2,e_1,e_3).
% 8625 [hyper:89,8585,8434,cut:74] product1(e_2,e_3,e_1) | product1(e_1,e_3,e_2).
% 8687 [hyper:96,8625,8465] product2(e_3,e_3,e_2) | product1(e_1,e_3,e_2).
% 8691 [hyper:96,8625,8620] product2(e_3,e_3,e_1) | product1(e_2,e_3,e_1).
% 8826 [hyper:92,8687,95,cut:81] product1(e_1,e_3,e_2).
% 8838 [hyper:96,8826,8162] product2(e_3,e_3,e_1) | product1(e_2,e_1,e_4).
% 8865 [hyper:92,8691,95,cut:80] product1(e_2,e_3,e_1).
% 8876 [hyper:96,8865,8022] product2(e_3,e_3,e_2) | product1(e_1,e_2,e_4).
% 8975 [hyper:92,8838,95,cut:80] product1(e_2,e_1,e_4).
% 8985 [hyper:96,8975,8826] product2(e_4,e_3,e_1).
% 9024 [hyper:92,8876,95,cut:81] product1(e_1,e_2,e_4).
% 9034 [hyper:96,9024,8865] product2(e_4,e_3,e_2).
% 9101 [hyper:92,9034,8985,cut:74] 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 1
% seconds given: 27
% 
% 
% ***GANDALF_FOUND_A_REFUTATION***
% 
% Global statistics over all passes: 
% 
%  given clauses:    108
%  derived clauses:   15954
%  kept clauses:      323
%  kept size sum:     5137
%  kept mid-nuclei:   8559
%  kept new demods:   0
%  forw unit-subs:    1743
%  forw double-subs: 1374
%  forw overdouble-subs: 3631
%  backward subs:     68
%  fast unit cutoff:  3580
%  full unit cutoff:  0
%  dbl  unit cutoff:  55
%  real runtime  :  0.46
%  process. runtime:  0.46
% specific non-discr-tree subsumption statistics: 
%  tried:           68927
%  length fails:    6659
%  strength fails:  12715
%  predlist fails:  8135
%  aux str. fails:  4642
%  by-lit fails:    31652
%  full subs tried: 521
%  full subs fail:  521
% 
% ; 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/GRP/GRP124-8.004+noeq.in")
% 
%------------------------------------------------------------------------------