TSTP Solution File: GRP025-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : GRP025-1 : TPTP v3.4.2. Bugfixed v1.2.1.
% 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 29.6s
% Output : Assurance 29.6s
% 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/GRP025-1+eq_r.in
% Using automatic strategy selection.
% Time limit in seconds: 600
%
% prove-all-passes started
%
% detected problem class: neq
% detected subclass: medium
%
% strategies selected:
% (hyper 25 #f 2 7)
% (binary-unit 9 #f 2 7)
% (binary-double 9 #f 2 7)
% (binary-double 15 #f)
% (binary-double 15 #t)
% (binary 50 #t 2 7)
% (binary-order 25 #f 2 7)
% (binary-posweight-order 101 #f)
% (binary-posweight-lex-big-order 25 #f)
% (binary-posweight-lex-small-order 9 #f)
% (binary-order-sos 50 #t)
% (binary-unit-uniteq 25 #f)
% (binary-weightorder 50 #f)
% (binary-order 50 #f)
% (hyper-order 30 #f)
% (binary 112 #t)
%
%
% ********* EMPTY CLAUSE DERIVED *********
%
%
% timer checkpoints: c(33,40,1,66,0,1,13004,50,42,13037,0,42,104925,4,1845,163476,5,2460,163476,1,2460,163476,50,2463,163476,40,2463,163509,0,2463,180279,3,2914,181394,4,3139,182213,5,3364,182213,1,3364,182213,50,3365,182213,40,3365,182246,0,3365)
%
%
% START OF PROOF
% 164139 [?] ?
% 164158 [?] ?
% 165419 [?] ?
% 182223 [] -product(X,Y,Z,V) | -product(X,Y,Z,U) | equal(V,U).
% 182224 [] -product(X,V,Z,W) | -product(X,X1,Y,V) | -product(X,Y,Z,U) | product(X,X1,U,W).
% 182225 [] -product(X,V,U,W) | -product(X,V,Y,X1) | -product(X,Y,Z,U) | product(X,X1,Z,W).
% 182230 [] -group_member(X,g1) | equal(X,a) | equal(X,b).
% 182232 [] product(g1,a,a,a).
% 182235 [] product(g1,b,b,a).
% 182238 [] product(g2,d,c,d).
% 182239 [] product(g2,d,d,c).
% 182240 [] equal(an_isomorphism(a),c).
% 182241 [] equal(an_isomorphism(b),d).
% 182242 [] group_member(d1,g1).
% 182243 [] group_member(d2,g1).
% 182245 [] product(g1,d1,d2,d3).
% 182246 [] -product(g2,an_isomorphism(d1),an_isomorphism(d2),an_isomorphism(d3)).
% 182249 [input:182224,factor] -product(X,Z,Z,U) | -product(X,Y,Z,Y) | product(X,Y,U,Y).
% 182253 [input:182225,factor:factor] -product(X,Y,Y,U) | -product(X,Y,Z,Z) | product(X,U,Z,Z).
% 182256 [binary:182230,182242] equal(d1,a) | equal(d1,b).
% 182257 [binary:182230,182243] equal(d2,a) | equal(d2,b).
% 182266 [para:182230.2.2,182232.1.4] product(g1,a,a,X) | -group_member(X,g1) | equal(X,b).
% 182299 [para:182256.1.1,182246.1.2.1,demod:182240] -product(g2,c,an_isomorphism(d2),an_isomorphism(d3)) | equal(d1,b).
% 182311 [para:182257.1.1,182246.1.3.1,demod:182240] -product(g2,an_isomorphism(d1),c,an_isomorphism(d3)) | equal(d2,b).
% 182493 [binary:182245,182223] -product(g1,d1,d2,X) | equal(d3,X).
% 184519 [binary:182242,182266.2] product(g1,a,a,d1) | equal(d1,b).
% 184520 [binary:182243,182266.2] product(g1,a,a,d2) | equal(d2,b).
% 187583 [binary:182253,184519,cut:164139] equal(d1,b) | product(g1,d1,X,X).
% 187958 [binary:182493,187583.2] equal(d1,b) | equal(d3,d2).
% 188846 [binary:182249,184520,cut:164158] equal(d2,b) | product(g1,X,d2,X).
% 189167 [binary:182493,188846.2] equal(d2,b) | equal(d3,d1).
% 193422 [para:187958.2.1,182299.1.4.1,cut:165419] equal(d1,b).
% 193455 [para:193422.1.2,182241.1.1.1] equal(an_isomorphism(d1),d).
% 193460 [para:193422.1.2,182235.1.2] product(g1,d1,b,a).
% 194313 [para:189167.2.1,182311.1.4.1,demod:193455,cut:182238] equal(d2,b).
% 194336 [para:194313.1.2,182241.1.1.1] equal(an_isomorphism(d2),d).
% 194444 [para:194313.1.2,193460.1.3] product(g1,d1,d2,a).
% 194981 [binary:182493,194444] equal(d3,a).
% 194990 [para:194981.1.1,182246.1.4.1,demod:182240,194336,193455,cut:182239] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using binary resolution
% not using sos strategy
% using double 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: 9
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 5712
% derived clauses: 1783856
% kept clauses: 89241
% kept size sum: 381177
% kept mid-nuclei: 101505
% kept new demods: 121
% forw unit-subs: 877758
% forw double-subs: 90538
% forw overdouble-subs: 19832
% backward subs: 689
% fast unit cutoff: 889
% full unit cutoff: 5
% dbl unit cutoff: 11
% real runtime : 35.17
% process. runtime: 34.62
% specific non-discr-tree subsumption statistics:
% tried: 214871
% length fails: 10143
% strength fails: 63742
% predlist fails: 54799
% aux str. fails: 4494
% by-lit fails: 5635
% full subs tried: 42883
% full subs fail: 38227
%
% ; 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/GRP025-1+eq_r.in")
%
%------------------------------------------------------------------------------