TSTP Solution File: GRP131-2.002 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : GRP131-2.002 : 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 : art05.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/GRP131-2.002+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 9)
% (binary-unit 10 #f 1 9)
% (binary-double 16 #f 1 9)
% (binary 54 #t 1 9)
% (binary-order 27 #f 1 9)
% (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(13,40,0,26,0,0)
%
%
% START OF PROOF
% 17 [] group_element(e_1).
% 18 [] group_element(e_2).
% 19 [] -equalish(e_1,e_2).
% 20 [] -equalish(e_2,e_1).
% 21 [] product(X,Y,e_1) | product(X,Y,e_2) | -group_element(X) | -group_element(Y).
% 23 [] -product(X,U,Z) | -product(X,Y,Z) | equalish(Y,U).
% 24 [] -product(X,Y,Z) | -product(U,Y,Z) | equalish(U,X).
% 25 [] -product(W,Y,X) | -product(W,V,U) | -product(U,V,Z) | -product(X,Y,Z) | equalish(U,X).
% 28 [hyper:21,17,17] product(e_1,e_1,e_2) | product(e_1,e_1,e_1).
% 31 [hyper:21,18,17] product(e_2,e_1,e_2) | product(e_2,e_1,e_1).
% 32 [hyper:21,18,18] product(e_2,e_2,e_2) | product(e_2,e_2,e_1).
% 34 [hyper:21,18,17] product(e_1,e_2,e_1) | product(e_1,e_2,e_2).
% 250 [hyper:24,31,28,cut:19] product(e_2,e_1,e_2) | product(e_1,e_1,e_2).
% 369 [hyper:23,32,31,cut:19] product(e_2,e_2,e_1) | product(e_2,e_1,e_1).
% 794 [hyper:23,250,32,cut:20] product(e_1,e_1,e_2) | product(e_2,e_2,e_1).
% 1005 [hyper:25,369,32,binarycut:32,binarycut:794,cut:20] product(e_2,e_2,e_1).
% 1084 [hyper:23,1005,31,cut:19] product(e_2,e_1,e_2).
% 1088 [hyper:24,1005,34,cut:19] product(e_1,e_2,e_2).
% 1137 [hyper:25,1084,1084,1005,cut:1088] equalish(e_2,e_1).
% 1203 [hyper:20,1137] 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 9
% clause depth limited to 1
% seconds given: 27
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 28
% derived clauses: 4498
% kept clauses: 80
% kept size sum: 629
% kept mid-nuclei: 1014
% kept new demods: 0
% forw unit-subs: 1515
% forw double-subs: 882
% forw overdouble-subs: 394
% backward subs: 14
% fast unit cutoff: 178
% full unit cutoff: 0
% dbl unit cutoff: 65
% real runtime : 0.7
% process. runtime: 0.6
% specific non-discr-tree subsumption statistics:
% tried: 1539
% length fails: 48
% strength fails: 114
% predlist fails: 499
% aux str. fails: 0
% by-lit fails: 473
% full subs tried: 60
% full subs fail: 11
%
% ; 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/GRP131-2.002+noeq.in")
%
%------------------------------------------------------------------------------