TSTP Solution File: GRP012-2 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : GRP012-2 : 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 : art10.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 30.0s
% Output : Assurance 30.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/GRP012-2+eq_r.in
% Using automatic strategy selection.
% Time limit in seconds: 600
%
% prove-all-passes started
%
% detected problem class: heq
% detected subclass: medium
% detected subclass: long
%
% strategies selected:
% (hyper 58 #f 2 7)
% (binary-posweight-order 29 #f 2 7)
% (binary-unit 29 #f 2 7)
% (binary-double 29 #f 2 7)
% (binary 29 #t 2 7)
% (hyper 29 #t)
% (hyper 105 #f)
% (binary-unit-uniteq 17 #f)
% (binary-weightorder 23 #f)
% (binary-posweight-order 70 #f)
% (binary-posweight-lex-big-order 29 #f)
% (binary-posweight-lex-small-order 11 #f)
% (binary-order 29 #f)
% (binary-unit 46 #f)
% (binary 67 #t)
%
%
% ********* EMPTY CLAUSE DERIVED *********
%
%
% timer checkpoints: c(12,40,0,24,0,0,4766,50,14,4778,0,14,267301,50,3671,267301,40,3671,267313,0,3671)
%
%
% START OF PROOF
% 267302 [] equal(X,X).
% 267303 [] product(identity,X,X).
% 267304 [] product(X,identity,X).
% 267305 [] product(inverse(X),X,identity).
% 267306 [] product(X,inverse(X),identity).
% 267307 [] product(X,Y,multiply(X,Y)).
% 267308 [] -product(X,Y,U) | -product(X,Y,Z) | equal(Z,U).
% 267309 [] -product(U,Y,V) | -product(W,X,U) | -product(X,Y,Z) | product(W,Z,V).
% 267311 [] product(a,b,c).
% 267312 [] product(inverse(b),inverse(a),d).
% 267313 [] -equal(inverse(c),d).
% 267320 [binary:267304,267308] -product(X,identity,Y) | equal(Y,X).
% 267329 [binary:267303,267309] -product(X,Y,identity) | -product(Y,Z,U) | product(X,U,Z).
% 267331 [binary:267311,267309] -product(Y,b,Z) | -product(X,Y,a) | product(X,Z,c).
% 267333 [binary:267305,267309] -product(X,Y,inverse(Z)) | product(X,U,identity) | -product(Y,Z,U).
% 267363 [binary:267305,267329] product(inverse(X),Y,Z) | -product(X,Z,Y).
% 267364 [binary:267306,267329] -product(inverse(X),Y,Z) | product(X,Z,Y).
% 267368 [binary:267307,267363.2] product(inverse(X),multiply(X,Y),Y).
% 267378 [binary:267312,267364] product(b,d,inverse(a)).
% 267386 [binary:267305,267331] -product(X,inverse(b),a) | product(X,identity,c).
% 267401 [binary:267378,267333] -product(d,a,X) | product(b,X,identity).
% 267403 [binary:267307,267401] product(b,multiply(d,a),identity).
% 267408 [binary:267363.2,267403] product(inverse(b),identity,multiply(d,a)).
% 267411 [binary:267320,267408] equal(multiply(d,a),inverse(b)).
% 267413 [para:267411.1.1,267368.1.2] product(inverse(d),inverse(b),a).
% 267425 [binary:267386,267413] product(inverse(d),identity,c).
% 267429 [binary:267320,267425] equal(c,inverse(d)).
% 267431 [para:267429.1.2,267305.1.1] product(c,d,identity).
% 267445 [binary:267363.2,267431] product(inverse(c),identity,d).
% 267463 [binary:267320,267445] equal(d,inverse(c)).
% 267464 [para:267463.1.2,267313.1.1,cut:267302] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using binary resolution
% using first neg lit preferred strategy
% not using sos 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 7
% clause depth limited to 2
% seconds given: 29
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 616
% derived clauses: 2582310
% kept clauses: 671
% kept size sum: 6687
% kept mid-nuclei: 266704
% kept new demods: 54
% forw unit-subs: 1660760
% forw double-subs: 16
% forw overdouble-subs: 7
% backward subs: 28
% fast unit cutoff: 1
% full unit cutoff: 0
% dbl unit cutoff: 0
% real runtime : 36.71
% process. runtime: 36.71
% specific non-discr-tree subsumption statistics:
% tried: 2223
% length fails: 0
% strength fails: 237
% predlist fails: 138
% aux str. fails: 394
% by-lit fails: 0
% full subs tried: 1454
% full subs fail: 1447
%
% ; 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/GRP012-2+eq_r.in")
%
%------------------------------------------------------------------------------