TSTP Solution File: GRP039-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : GRP039-1 : 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 : 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/GRP039-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(17,40,0,34,0,0)
%
%
% START OF PROOF
% 19 [] product(identity,X,X).
% 20 [] product(X,identity,X).
% 21 [] product(inverse(X),X,identity).
% 23 [] product(X,Y,multiply(X,Y)).
% 24 [] -product(X,Y,U) | -product(X,Y,Z) | equal(Z,U).
% 25 [] -product(U,Y,V) | -product(W,X,U) | -product(X,Y,Z) | product(W,Z,V).
% 26 [] -product(U,Z,V) | -product(U,X,W) | -product(X,Y,Z) | product(W,Y,V).
% 27 [] subgroup_member(inverse(X)) | -subgroup_member(X).
% 28 [] -product(X,Y,Z) | -subgroup_member(X) | -subgroup_member(Y) | subgroup_member(Z).
% 29 [] subgroup_member(element_in_^o2(X,Y)) | subgroup_member(Y) | subgroup_member(X).
% 30 [] product(X,element_in_^o2(X,Y),Y) | subgroup_member(Y) | subgroup_member(X).
% 31 [] subgroup_member(b).
% 32 [] product(b,inverse(a),c).
% 33 [] product(a,c,d).
% 34 [] -subgroup_member(d).
% 37 [hyper:27,31] subgroup_member(inverse(b)).
% 130 [hyper:25,21,19,33] product(inverse(a),d,c).
% 151 [hyper:26,21,32,20] product(c,a,b).
% 154 [hyper:28,21,binarycut:27,slowcut:37] subgroup_member(identity).
% 219 [hyper:25,151,19,21] product(inverse(c),b,a).
% 363 [hyper:24,23,33] equal(d,multiply(a,c)).
% 1650 [hyper:34,29] subgroup_member(element_in_^o2(X,d)) | subgroup_member(X).
% 1795 [hyper:27,1650] subgroup_member(element_in_^o2(X,d)) | subgroup_member(inverse(X)).
% 2033 [hyper:26,30,130,21,cut:34] product(identity,element_in_^o2(a,d),c) | subgroup_member(a).
% 2445 [hyper:28,1795,32,cut:31] subgroup_member(element_in_^o2(a,d)) | subgroup_member(c).
% 2701 [hyper:28,2445,23,29,factor:cut:34] subgroup_member(element_in_^o2(a,d)).
% 11402 [hyper:28,2033,cut:154,cut:2701] subgroup_member(a) | subgroup_member(c).
% 11569 [hyper:27,11402] subgroup_member(inverse(a)) | subgroup_member(c).
% 11791 [hyper:28,11569,32,cut:31] subgroup_member(c).
% 11837 [hyper:27,11791] subgroup_member(inverse(c)).
% 12445 [hyper:28,11837,219,cut:31] subgroup_member(a).
% 12510 [hyper:28,12445,23,11791,demod:363,cut:34] 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 7
% clause depth limited to 2
% seconds given: 25
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 161
% derived clauses: 66928
% kept clauses: 2163
% kept size sum: 31557
% kept mid-nuclei: 8890
% kept new demods: 10
% forw unit-subs: 12586
% forw double-subs: 5907
% forw overdouble-subs: 4341
% backward subs: 73
% fast unit cutoff: 1857
% full unit cutoff: 5
% dbl unit cutoff: 3
% real runtime : 1.21
% process. runtime: 1.20
% specific non-discr-tree subsumption statistics:
% tried: 204161
% length fails: 13361
% strength fails: 82900
% predlist fails: 12877
% aux str. fails: 1074
% by-lit fails: 8
% full subs tried: 93853
% full subs fail: 89428
%
% ; 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/GRP039-1+eq_r.in")
%
%------------------------------------------------------------------------------