↑ Up

Gandalf---c-2.6.UNS-Ass.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : RNG029-3 : TPTP v3.4.2. Bugfixed v2.4.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 20.0s
% Output   : Assurance 20.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/RNG/RNG029-3+eq_r.in
% Using automatic strategy selection.
% Time limit in seconds: 600
% 
% prove-all-passes started
% 
% detected problem class: peq
% 
% strategies selected: 
% (hyper 30 #f 5 3)
% (binary-unit 12 #f)
% (binary-unit-uniteq 12 #f)
% (binary-posweight-kb-big-order 60 #f 5 3)
% (binary-posweight-lex-big-order 30 #f 5 3)
% (binary 30 #t)
% (binary-posweight-kb-big-order 156 #f)
% (binary-posweight-lex-big-order 102 #f)
% (binary-posweight-firstpref-order 60 #f)
% (binary-order 30 #f)
% (binary-posweight-kb-small-order 48 #f)
% (binary-posweight-lex-small-order 30 #f)
% 
% 
% ********* EMPTY CLAUSE DERIVED *********
% 
% ********* EMPTY CLAUSE DERIVED *********
% 
% 
% timer checkpoints: c(25,40,0,50,0,0,31957,4,2261)
% 
% 
% START OF PROOF
% 26 [] equal(X,X).
% 27 [] equal(add(additive_identity,X),X).
% 30 [] equal(add(additive_inverse(X),X),additive_identity).
% 32 [] equal(additive_inverse(additive_inverse(X)),X).
% 33 [] equal(multiply(X,add(Y,Z)),add(multiply(X,Y),multiply(X,Z))).
% 34 [] equal(multiply(add(X,Y),Z),add(multiply(X,Z),multiply(Y,Z))).
% 37 [] equal(multiply(additive_inverse(X),Y),additive_inverse(multiply(X,Y))).
% 38 [] equal(multiply(X,additive_inverse(Y)),multiply(additive_inverse(X),Y)).
% 40 [] equal(add(X,Y),add(Y,X)).
% 41 [] equal(add(X,add(Y,Z)),add(add(X,Y),Z)).
% 44 [] equal(associator(X,Y,Z),add(multiply(multiply(X,Y),Z),multiply(X,multiply(Y,additive_inverse(Z))))).
% 46 [] equal(associator(X,Y,Z),additive_inverse(associator(Y,X,Z))).
% 47 [] equal(associator(X,Y,Z),associator(Y,Z,X)).
% 49 [] equal(multiply(multiply(X,multiply(Y,X)),Z),multiply(X,multiply(Y,multiply(X,Z)))).
% 50 [] -equal(multiply(multiply(cx,cy),multiply(cz,cx)),multiply(cx,multiply(multiply(cy,cz),cx))).
% 56 [para:49.1.1,37.1.2.1,demod:38,37] equal(multiply(multiply(X,multiply(Y,additive_inverse(X))),Z),multiply(X,multiply(Y,multiply(X,additive_inverse(Z))))).
% 57 [para:37.1.2,38.1.2.1,demod:38] equal(multiply(multiply(X,Y),additive_inverse(Z)),multiply(multiply(X,additive_inverse(Y)),Z)).
% 104 [para:34.1.2,33.1.2] equal(multiply(X,add(Y,Y)),multiply(add(X,X),Y)).
% 127 [para:30.1.1,41.1.2.1,demod:27] equal(add(additive_inverse(X),add(X,Y)),Y).
% 143 [para:40.1.1,127.1.1.2] equal(add(additive_inverse(X),add(Y,X)),Y).
% 149 [para:41.1.2,127.1.1.2] equal(add(additive_inverse(add(X,Y)),add(X,add(Y,Z))),Z).
% 155 [para:32.1.1,44.1.2.2.2.2] equal(associator(X,Y,additive_inverse(Z)),add(multiply(multiply(X,Y),additive_inverse(Z)),multiply(X,multiply(Y,Z)))).
% 159 [para:44.1.2,40.1.1] equal(associator(X,Y,Z),add(multiply(X,multiply(Y,additive_inverse(Z))),multiply(multiply(X,Y),Z))).
% 161 [para:38.1.2,44.1.2.1.1,demod:155,32,37,38,57] equal(associator(additive_inverse(X),Y,Z),associator(X,Y,additive_inverse(Z))).
% 162 [para:38.1.2,44.1.2.2.2,demod:155,32,57] equal(associator(X,additive_inverse(Y),Z),associator(X,Y,additive_inverse(Z))).
% 166 [para:56.1.1,44.1.2.1,demod:159,33,32,57] equal(associator(X,multiply(Y,additive_inverse(X)),Z),multiply(X,associator(Y,X,Z))).
% 185 [para:32.1.1,166.1.1.2.2,demod:46,38,162,161] equal(associator(X,multiply(Y,X),additive_inverse(Z)),multiply(X,associator(X,Y,additive_inverse(Z)))).
% 188 [para:38.1.2,166.1.1.2,demod:161,32] equal(associator(X,multiply(Y,X),Z),multiply(X,associator(Y,X,additive_inverse(Z)))).
% 204 [para:44.1.2,143.1.1.2,demod:32,38,37] equal(add(multiply(X,multiply(Y,Z)),associator(X,Y,Z)),multiply(multiply(X,Y),Z)).
% 212 [para:32.1.1,188.1.2.2.3,demod:185] equal(multiply(X,associator(X,Y,additive_inverse(Z))),multiply(X,associator(Y,X,Z))).
% 213 [para:188.1.2,37.1.2.1,demod:212,46,38] equal(multiply(X,associator(Y,X,Z)),associator(multiply(Y,X),X,Z)).
% 288 [para:104.1.2,34.1.2.2] equal(multiply(add(X,add(Y,Y)),Z),add(multiply(X,Z),multiply(Y,add(Z,Z)))).
% 365 [para:213.1.2,47.1.1] equal(multiply(X,associator(Y,X,Z)),associator(X,Z,multiply(Y,X))).
% 7996 [para:47.1.1,204.1.1.2] equal(add(multiply(X,multiply(Y,Z)),associator(Y,Z,X)),multiply(multiply(X,Y),Z)).
% 8018 [para:365.1.2,204.1.1.2,demod:7996,33] equal(multiply(X,multiply(multiply(Y,Z),X)),multiply(multiply(X,Y),multiply(Z,X))).
% 20302 [para:149.1.1,288.1.1.1,demod:38,41] equal(multiply(X,Y),add(multiply(add(Z,add(X,Z)),additive_inverse(Y)),multiply(add(Z,X),add(Y,Y)))).
% 31958 [para:20302.1.1,50.1.1.2,demod:8018,20302,cut:26] contradiction
% END OF PROOF
% 
% Proof found by the following strategy:
% 
% using binary resolution
% not using sos strategy
% using dynamic demodulation
% using ordered paramodulation
% using kb ordering for equality
% preferring bigger arities for lex ordering
% clause length limited to 3
% clause depth limited to 5
% seconds given: 30
% 
% 
% ***GANDALF_FOUND_A_REFUTATION***
% 
% Global statistics over all passes: 
% 
%  given clauses:    1043
%  derived clauses:   855351
%  kept clauses:      31905
%  kept size sum:     695642
%  kept mid-nuclei:   0
%  kept new demods:   21957
%  forw unit-subs:    564538
%  forw double-subs: 0
%  forw overdouble-subs: 0
%  backward subs:     27
%  fast unit cutoff:  2
%  full unit cutoff:  0
%  dbl  unit cutoff:  0
%  real runtime  :  22.81
%  process. runtime:  22.80
% specific non-discr-tree subsumption statistics: 
%  tried:           0
%  length fails:    0
%  strength fails:  0
%  predlist fails:  0
%  aux str. fails:  0
%  by-lit fails:    0
%  full subs tried: 0
%  full subs fail:  0
% 
% ; 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/RNG/RNG029-3+eq_r.in")
% 
%------------------------------------------------------------------------------