TSTP Solution File: GRP124-1.004 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : GRP124-1.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 : art07.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-1.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(23,40,0,46,0,0)
%
%
% START OF PROOF
% 24 [] group_element(e_1).
% 25 [] group_element(e_2).
% 26 [] group_element(e_3).
% 28 [] -equalish(e_1,e_2).
% 29 [] -equalish(e_1,e_3).
% 31 [] -equalish(e_2,e_1).
% 32 [] -equalish(e_2,e_3).
% 34 [] -equalish(e_3,e_1).
% 35 [] -equalish(e_3,e_2).
% 36 [] -equalish(e_3,e_4).
% 38 [] -equalish(e_4,e_2).
% 40 [] product(X,Y,e_3) | product(X,Y,e_4) | product(X,Y,e_2) | product(X,Y,e_1) | -group_element(Y) | -group_element(X).
% 41 [] -product(X,Y,U) | -product(X,Y,Z) | equalish(Z,U).
% 42 [] -product(X,U,Z) | -product(X,Y,Z) | equalish(Y,U).
% 43 [] -product(U,Y,Z) | -product(X,Y,Z) | equalish(X,U).
% 44 [] product(X,X,X).
% 45 [] -product(W,X,Y) | -product(W,U,V) | -product(U,V,Z) | -product(X,Y,Z) | equalish(U,X).
% 50 [hyper:40,25,24] product(e_1,e_2,e_4) | product(e_1,e_2,e_3) | product(e_1,e_2,e_2) | product(e_1,e_2,e_1).
% 52 [hyper:40,25,24] product(e_2,e_1,e_3) | product(e_2,e_1,e_4) | product(e_2,e_1,e_1) | product(e_2,e_1,e_2).
% 54 [hyper:40,26,24] product(e_1,e_3,e_4) | product(e_1,e_3,e_3) | product(e_1,e_3,e_2) | product(e_1,e_3,e_1).
% 55 [hyper:40,26,25] product(e_2,e_3,e_4) | product(e_2,e_3,e_3) | product(e_2,e_3,e_2) | product(e_2,e_3,e_1).
% 57 [hyper:40,26,24] product(e_3,e_1,e_3) | product(e_3,e_1,e_4) | product(e_3,e_1,e_1) | product(e_3,e_1,e_2).
% 182 [hyper:42,50,44,cut:28] product(e_1,e_2,e_2) | product(e_1,e_2,e_4) | product(e_1,e_2,e_3).
% 271 [hyper:43,182,44,cut:31] product(e_1,e_2,e_3) | product(e_1,e_2,e_4).
% 441 [hyper:42,52,44,cut:31] product(e_2,e_1,e_1) | product(e_2,e_1,e_3) | product(e_2,e_1,e_4).
% 552 [hyper:42,54,44,cut:29] product(e_1,e_3,e_2) | product(e_1,e_3,e_4) | product(e_1,e_3,e_3).
% 641 [hyper:43,441,44,cut:28] product(e_2,e_1,e_4) | product(e_2,e_1,e_3).
% 865 [hyper:43,552,44,cut:34] product(e_1,e_3,e_2) | product(e_1,e_3,e_4).
% 986 [hyper:42,865,271,cut:32] product(e_1,e_3,e_2) | product(e_1,e_2,e_3).
% 1226 [hyper:42,55,44,cut:32] product(e_2,e_3,e_3) | product(e_2,e_3,e_1) | product(e_2,e_3,e_4).
% 1381 [hyper:45,865,641,44,cut:44,cut:28] product(e_2,e_1,e_4) | product(e_1,e_3,e_4).
% 1423 [hyper:41,1381,641,cut:36] product(e_1,e_3,e_4) | product(e_2,e_1,e_4).
% 1698 [hyper:42,57,44,cut:34] product(e_3,e_1,e_4) | product(e_3,e_1,e_2) | product(e_3,e_1,e_1).
% 3222 [hyper:43,1226,44,cut:35] product(e_2,e_3,e_4) | product(e_2,e_3,e_1).
% 3355 [hyper:45,3222,44,44,986,cut:31] product(e_2,e_3,e_4) | product(e_1,e_3,e_2).
% 3747 [hyper:43,3355,865,cut:28] product(e_1,e_3,e_2).
% 3789 [hyper:41,3747,1423,cut:38] product(e_2,e_1,e_4).
% 4187 [hyper:42,3789,3222,cut:34] product(e_2,e_3,e_1).
% 4835 [hyper:43,1698,3789,cut:32] product(e_3,e_1,e_1) | product(e_3,e_1,e_2).
% 5004 [hyper:43,4835,44,cut:29] product(e_3,e_1,e_2).
% 5073 [hyper:45,5004,4187,44,cut:44] equalish(e_3,e_2).
% 5187 [hyper:35,5073] 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: 58
% derived clauses: 9847
% kept clauses: 182
% kept size sum: 2217
% kept mid-nuclei: 4907
% kept new demods: 0
% forw unit-subs: 2365
% forw double-subs: 974
% forw overdouble-subs: 1362
% backward subs: 62
% fast unit cutoff: 853
% full unit cutoff: 0
% dbl unit cutoff: 17
% real runtime : 0.28
% process. runtime: 0.27
% specific non-discr-tree subsumption statistics:
% tried: 11927
% length fails: 82
% strength fails: 1375
% predlist fails: 1858
% aux str. fails: 63
% by-lit fails: 5455
% full subs tried: 1630
% full subs fail: 1493
%
% ; 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-1.004+noeq.in")
%
%------------------------------------------------------------------------------